/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-aggr-update1-4modifiers.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:53:38,154 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:53:38,196 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:53:38,200 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:53:38,200 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:53:38,200 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:53:38,200 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:53:38,220 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:53:38,220 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:53:38,220 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:53:38,221 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:53:38,222 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:53:38,222 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:53:38,222 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:53:38,222 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:53:38,222 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:53:38,222 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:53:38,222 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:53:38,222 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:53:38,222 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:53:38,222 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:53:38,222 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:53:38,223 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:53:38,223 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:53:38,223 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:53:38,223 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:53:38,223 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:53:38,223 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:53:38,223 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:53:38,223 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:53:38,223 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:53:38,223 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:53:38,223 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:53:38,223 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:53:38,223 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:53:38,223 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:53:38,223 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:53:38,223 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:53:38,223 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:53:38,223 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:53:38,224 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:53:38,224 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:53:38,224 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:53:38,443 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:53:38,449 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:53:38,451 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:53:38,452 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:53:38,453 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:53:38,454 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-aggr-update1-4modifiers.bpl [2025-04-26 16:53:38,454 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-aggr-update1-4modifiers.bpl' [2025-04-26 16:53:38,473 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:53:38,475 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:53:38,476 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:53:38,476 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:53:38,476 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:53:38,483 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "map-aggr-update1-4modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:38" (1/1) ... [2025-04-26 16:53:38,504 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "map-aggr-update1-4modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:38" (1/1) ... [2025-04-26 16:53:38,509 INFO L138 Inliner]: procedures = 4, calls = 6, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:53:38,510 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:53:38,511 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:53:38,511 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:53:38,511 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:53:38,516 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "map-aggr-update1-4modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:38" (1/1) ... [2025-04-26 16:53:38,516 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "map-aggr-update1-4modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:38" (1/1) ... [2025-04-26 16:53:38,518 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "map-aggr-update1-4modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:38" (1/1) ... [2025-04-26 16:53:38,518 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "map-aggr-update1-4modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:38" (1/1) ... [2025-04-26 16:53:38,521 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "map-aggr-update1-4modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:38" (1/1) ... [2025-04-26 16:53:38,522 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "map-aggr-update1-4modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:38" (1/1) ... [2025-04-26 16:53:38,524 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "map-aggr-update1-4modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:38" (1/1) ... [2025-04-26 16:53:38,527 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "map-aggr-update1-4modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:38" (1/1) ... [2025-04-26 16:53:38,528 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "map-aggr-update1-4modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:38" (1/1) ... [2025-04-26 16:53:38,534 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:53:38,534 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:53:38,534 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:53:38,534 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:53:38,535 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "map-aggr-update1-4modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:38" (1/1) ... [2025-04-26 16:53:38,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:53:38,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:38,558 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 16:53:38,564 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 16:53:38,581 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:53:38,581 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:53:38,581 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:53:38,581 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:53:38,581 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:53:38,581 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:53:38,581 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:53:38,581 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:53:38,582 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:53:38,582 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:53:38,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:53:38,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:53:38,582 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:53:38,615 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:53:38,617 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:53:38,720 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:53:38,721 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:53:38,727 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:53:38,728 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:53:38,728 INFO L201 PluginConnector]: Adding new model map-aggr-update1-4modifiers.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:53:38 BoogieIcfgContainer [2025-04-26 16:53:38,728 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:53:38,730 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:53:38,730 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:53:38,734 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:53:38,736 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:53:38,736 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-aggr-update1-4modifiers.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:38" (1/2) ... [2025-04-26 16:53:38,737 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@67738c0e and model type map-aggr-update1-4modifiers.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:53:38, skipping insertion in model container [2025-04-26 16:53:38,737 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:53:38,737 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-aggr-update1-4modifiers.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:53:38" (2/2) ... [2025-04-26 16:53:38,738 INFO L376 chiAutomizerObserver]: Analyzing ICFG map-aggr-update1-4modifiers.bpl [2025-04-26 16:53:38,828 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2025-04-26 16:53:38,864 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:53:38,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:53:38,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:38,867 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 16:53:38,872 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 16:53:38,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 70 transitions, 182 flow [2025-04-26 16:53:38,965 INFO L116 PetriNetUnfolderBase]: 8/58 cut-off events. [2025-04-26 16:53:38,969 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-26 16:53:38,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83 conditions, 58 events. 8/58 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 166 event pairs, 0 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2025-04-26 16:53:38,973 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 70 transitions, 182 flow [2025-04-26 16:53:38,978 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 69 places, 58 transitions, 152 flow [2025-04-26 16:53:38,978 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 69 places, 58 transitions, 152 flow [2025-04-26 16:53:38,983 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:53:43,534 WARN L140 AmpleReduction]: Number of pruned transitions: 121796 [2025-04-26 16:53:43,534 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:53:43,534 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 7813 [2025-04-26 16:53:43,534 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:73 [2025-04-26 16:53:43,534 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:24898 [2025-04-26 16:53:43,534 WARN L145 AmpleReduction]: Times succ was already a loop node:7709 [2025-04-26 16:53:43,534 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:23948 [2025-04-26 16:53:43,534 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:53:43,626 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 32785 states, 32783 states have (on average 2.5325016014397708) internal successors, (in total 83023), 32784 states have internal predecessors, (83023), 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 16:53:43,633 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:53:43,633 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:53:43,634 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:53:43,634 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:53:43,634 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:53:43,634 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:53:43,634 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:53:43,634 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:53:43,684 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 32785 states, 32783 states have (on average 2.5325016014397708) internal successors, (in total 83023), 32784 states have internal predecessors, (83023), 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 16:53:44,223 INFO L131 ngComponentsAnalysis]: Automaton has 1272 accepting balls. 25337 [2025-04-26 16:53:44,223 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:44,223 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:44,229 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:53:44,230 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:53:44,230 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:53:44,286 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 32785 states, 32783 states have (on average 2.5325016014397708) internal successors, (in total 83023), 32784 states have internal predecessors, (83023), 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 16:53:44,789 INFO L131 ngComponentsAnalysis]: Automaton has 1272 accepting balls. 25337 [2025-04-26 16:53:44,789 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:44,789 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:44,790 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:53:44,790 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:53:44,794 INFO L752 eck$LassoCheckResult]: Stem: "[94] $Ultimate##0-->L34: Formula: (and (<= 0 v_ULTIMATE.start_m_1) (< v_ULTIMATE.start_m_1 v_N_7)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} AuxVars[] AssignedVars[]" "[153] L34-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork3_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork3_thidvar0=v_thread1Thread1of1ForFork3_thidvar0_2, thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_thidvar0, thread1Thread1of1ForFork3_i]" "[100] $Ultimate##0-->L57-1: Formula: (= v_thread1Thread1of1ForFork3_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_i]" [2025-04-26 16:53:44,794 INFO L754 eck$LassoCheckResult]: Loop: "[102] L57-1-->L58: Formula: (< v_thread1Thread1of1ForFork3_i_5 v_N_1) InVars {thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_5, N=v_N_1} AuxVars[] AssignedVars[]" "[104] L58-->L59: Formula: (= (store v_A_2 v_thread1Thread1of1ForFork3_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork3_i_7))) (ite (< .cse0 0) 0 .cse0))) v_A_1) InVars {A=v_A_2, thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_7} AuxVars[] AssignedVars[A]" "[105] L59-->L57-1: Formula: (= v_thread1Thread1of1ForFork3_i_10 (+ v_thread1Thread1of1ForFork3_i_9 1)) InVars {thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_9} OutVars{thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_i]" [2025-04-26 16:53:44,800 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:44,801 INFO L85 PathProgramCache]: Analyzing trace with hash 124968, now seen corresponding path program 1 times [2025-04-26 16:53:44,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:44,807 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422444208] [2025-04-26 16:53:44,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:44,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:44,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:44,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:44,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:44,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:44,859 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:44,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:44,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:44,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:44,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:44,878 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:44,880 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:44,881 INFO L85 PathProgramCache]: Analyzing trace with hash 131142, now seen corresponding path program 1 times [2025-04-26 16:53:44,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:44,881 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086806071] [2025-04-26 16:53:44,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:44,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:44,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:44,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:44,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:44,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:44,891 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:44,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:44,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:44,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:44,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:44,896 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:44,897 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:44,897 INFO L85 PathProgramCache]: Analyzing trace with hash -571944257, now seen corresponding path program 1 times [2025-04-26 16:53:44,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:44,897 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117956191] [2025-04-26 16:53:44,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:44,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:44,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:53:44,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:53:44,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:44,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:44,903 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:44,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:53:44,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:53:44,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:44,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:44,908 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:45,072 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:45,074 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:45,077 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:45,077 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:45,077 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:53:45,077 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:45,078 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:45,078 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:45,078 INFO L132 ssoRankerPreferences]: Filename of dumped script: map-aggr-update1-4modifiers.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:53:45,078 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:45,079 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:45,101 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:45,147 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:45,196 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:53:45,198 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:53:45,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:45,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:45,207 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:45,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:53:45,210 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:45,237 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:45,237 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:45,238 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:45,238 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:45,246 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:45,246 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:45,254 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:53:45,279 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:53:45,279 INFO L437 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 16:53:45,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:45,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:45,284 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:45,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:53:45,286 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:53:45,314 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 16:53:45,315 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:53:45,315 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:53:45,315 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork3_i, N) = -1*thread1Thread1of1ForFork3_i + 1*N Supporting invariants [] [2025-04-26 16:53:45,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:53:45,349 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:53:45,380 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:45,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:45,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:45,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:45,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:45,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:53:45,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:45,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:45,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:45,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:45,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:45,435 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:53:45,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:45,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:53:45,529 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 16:53:45,591 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 32785 states, 32783 states have (on average 2.5325016014397708) internal successors, (in total 83023), 32784 states have internal predecessors, (83023), 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.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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 16:53:46,388 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 32785 states, 32783 states have (on average 2.5325016014397708) internal successors, (in total 83023), 32784 states have internal predecessors, (83023), 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.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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 75918 states and 189584 transitions. Complement of second has 6 states. [2025-04-26 16:53:46,389 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 16:53:46,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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 16:53:46,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2025-04-26 16:53:46,396 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 136 transitions. Stem has 3 letters. Loop has 3 letters. [2025-04-26 16:53:46,398 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:46,398 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 136 transitions. Stem has 6 letters. Loop has 3 letters. [2025-04-26 16:53:46,398 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:46,398 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 136 transitions. Stem has 3 letters. Loop has 6 letters. [2025-04-26 16:53:46,398 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:46,399 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75918 states and 189584 transitions. [2025-04-26 16:53:47,160 INFO L131 ngComponentsAnalysis]: Automaton has 787 accepting balls. 4247 [2025-04-26 16:53:47,719 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75918 states to 45148 states and 111048 transitions. [2025-04-26 16:53:47,720 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9574 [2025-04-26 16:53:47,780 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19894 [2025-04-26 16:53:47,781 INFO L74 IsDeterministic]: Start isDeterministic. Operand 45148 states and 111048 transitions. [2025-04-26 16:53:47,781 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:47,781 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45148 states and 111048 transitions. [2025-04-26 16:53:47,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45148 states and 111048 transitions. [2025-04-26 16:53:48,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45148 to 38737. [2025-04-26 16:53:48,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38737 states, 38737 states have (on average 2.596122570152567) internal successors, (in total 100566), 38736 states have internal predecessors, (100566), 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 16:53:49,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38737 states to 38737 states and 100566 transitions. [2025-04-26 16:53:49,125 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38737 states and 100566 transitions. [2025-04-26 16:53:49,130 INFO L438 stractBuchiCegarLoop]: Abstraction has 38737 states and 100566 transitions. [2025-04-26 16:53:49,130 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:53:49,130 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38737 states and 100566 transitions. [2025-04-26 16:53:49,301 INFO L131 ngComponentsAnalysis]: Automaton has 787 accepting balls. 4247 [2025-04-26 16:53:49,301 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:49,301 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:49,302 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:49,302 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:53:49,302 INFO L752 eck$LassoCheckResult]: Stem: "[94] $Ultimate##0-->L34: Formula: (and (<= 0 v_ULTIMATE.start_m_1) (< v_ULTIMATE.start_m_1 v_N_7)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} AuxVars[] AssignedVars[]" "[153] L34-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork3_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork3_thidvar0=v_thread1Thread1of1ForFork3_thidvar0_2, thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_thidvar0, thread1Thread1of1ForFork3_i]" "[100] $Ultimate##0-->L57-1: Formula: (= v_thread1Thread1of1ForFork3_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_i]" "[101] L57-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork3_i_3) InVars {thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_3, N=v_N_2} OutVars{thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_3, N=v_N_2} AuxVars[] AssignedVars[]" "[103] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[156] L34-1-->$Ultimate##0: Formula: (and (= v_thread2Thread1of1ForFork4_thidvar0_2 2) (= v_thread2Thread1of1ForFork4_thidvar1_2 2)) InVars {} OutVars{thread2Thread1of1ForFork4_cnt=v_thread2Thread1of1ForFork4_cnt_12, thread2Thread1of1ForFork4_j=v_thread2Thread1of1ForFork4_j_20, thread2Thread1of1ForFork4_thidvar0=v_thread2Thread1of1ForFork4_thidvar0_2, thread2Thread1of1ForFork4_thidvar1=v_thread2Thread1of1ForFork4_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_cnt, thread2Thread1of1ForFork4_j, thread2Thread1of1ForFork4_thidvar0, thread2Thread1of1ForFork4_thidvar1]" "[106] $Ultimate##0-->L70: Formula: (= v_thread2Thread1of1ForFork4_cnt_1 0) InVars {} OutVars{thread2Thread1of1ForFork4_cnt=v_thread2Thread1of1ForFork4_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_cnt]" "[107] L70-->L71-1: Formula: (= v_thread2Thread1of1ForFork4_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork4_j=v_thread2Thread1of1ForFork4_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_j]" [2025-04-26 16:53:49,302 INFO L754 eck$LassoCheckResult]: Loop: "[109] L71-1-->L72: Formula: (< v_thread2Thread1of1ForFork4_j_5 v_N_4) InVars {thread2Thread1of1ForFork4_j=v_thread2Thread1of1ForFork4_j_5, N=v_N_4} OutVars{thread2Thread1of1ForFork4_j=v_thread2Thread1of1ForFork4_j_5, N=v_N_4} AuxVars[] AssignedVars[]" "[112] L72-->L72-2: Formula: (<= (select v_A_4 v_thread2Thread1of1ForFork4_j_9) 0) InVars {A=v_A_4, thread2Thread1of1ForFork4_j=v_thread2Thread1of1ForFork4_j_9} OutVars{A=v_A_4, thread2Thread1of1ForFork4_j=v_thread2Thread1of1ForFork4_j_9} AuxVars[] AssignedVars[]" "[115] L72-2-->L75-1: Formula: (<= (select v_B_2 v_thread2Thread1of1ForFork4_j_13) 0) InVars {thread2Thread1of1ForFork4_j=v_thread2Thread1of1ForFork4_j_13, B=v_B_2} OutVars{thread2Thread1of1ForFork4_j=v_thread2Thread1of1ForFork4_j_13, B=v_B_2} AuxVars[] AssignedVars[]" "[117] L75-1-->L71-1: Formula: (= v_thread2Thread1of1ForFork4_j_16 (+ v_thread2Thread1of1ForFork4_j_15 1)) InVars {thread2Thread1of1ForFork4_j=v_thread2Thread1of1ForFork4_j_15} OutVars{thread2Thread1of1ForFork4_j=v_thread2Thread1of1ForFork4_j_16} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_j]" [2025-04-26 16:53:49,303 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:49,303 INFO L85 PathProgramCache]: Analyzing trace with hash 116482003, now seen corresponding path program 1 times [2025-04-26 16:53:49,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:49,303 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949260912] [2025-04-26 16:53:49,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:49,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:49,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:53:49,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:53:49,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:49,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:49,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:53:49,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:53:49,357 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949260912] [2025-04-26 16:53:49,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949260912] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:53:49,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:53:49,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:53:49,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228296852] [2025-04-26 16:53:49,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:53:49,361 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:53:49,362 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:49,362 INFO L85 PathProgramCache]: Analyzing trace with hash 4282054, now seen corresponding path program 1 times [2025-04-26 16:53:49,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:49,362 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225069289] [2025-04-26 16:53:49,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:49,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:49,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:53:49,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:53:49,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:49,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:49,366 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:49,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:53:49,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:53:49,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:49,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:49,370 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:49,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:53:49,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:53:49,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:53:49,404 INFO L87 Difference]: Start difference. First operand 38737 states and 100566 transitions. cyclomatic complexity: 63069 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 16:53:49,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:53:49,900 INFO L93 Difference]: Finished difference Result 38737 states and 100565 transitions. [2025-04-26 16:53:49,901 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38737 states and 100565 transitions. [2025-04-26 16:53:50,210 INFO L131 ngComponentsAnalysis]: Automaton has 787 accepting balls. 4247 [2025-04-26 16:53:50,601 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38737 states to 38737 states and 100565 transitions. [2025-04-26 16:53:50,601 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13483 [2025-04-26 16:53:50,629 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13483 [2025-04-26 16:53:50,630 INFO L74 IsDeterministic]: Start isDeterministic. Operand 38737 states and 100565 transitions. [2025-04-26 16:53:50,630 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:50,630 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38737 states and 100565 transitions. [2025-04-26 16:53:50,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38737 states and 100565 transitions. [2025-04-26 16:53:51,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38737 to 38737. [2025-04-26 16:53:51,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38737 states, 38737 states have (on average 2.5960967550404006) internal successors, (in total 100565), 38736 states have internal predecessors, (100565), 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 16:53:51,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38737 states to 38737 states and 100565 transitions. [2025-04-26 16:53:51,540 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38737 states and 100565 transitions. [2025-04-26 16:53:51,541 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 16:53:51,541 INFO L438 stractBuchiCegarLoop]: Abstraction has 38737 states and 100565 transitions. [2025-04-26 16:53:51,541 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:53:51,541 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38737 states and 100565 transitions. [2025-04-26 16:53:51,735 INFO L131 ngComponentsAnalysis]: Automaton has 787 accepting balls. 4247 [2025-04-26 16:53:51,735 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:51,735 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:51,735 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:51,735 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:53:51,736 INFO L752 eck$LassoCheckResult]: Stem: "[94] $Ultimate##0-->L34: Formula: (and (<= 0 v_ULTIMATE.start_m_1) (< v_ULTIMATE.start_m_1 v_N_7)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} AuxVars[] AssignedVars[]" "[153] L34-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork3_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork3_thidvar0=v_thread1Thread1of1ForFork3_thidvar0_2, thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_thidvar0, thread1Thread1of1ForFork3_i]" "[100] $Ultimate##0-->L57-1: Formula: (= v_thread1Thread1of1ForFork3_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_i]" "[102] L57-1-->L58: Formula: (< v_thread1Thread1of1ForFork3_i_5 v_N_1) InVars {thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_5, N=v_N_1} AuxVars[] AssignedVars[]" "[104] L58-->L59: Formula: (= (store v_A_2 v_thread1Thread1of1ForFork3_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork3_i_7))) (ite (< .cse0 0) 0 .cse0))) v_A_1) InVars {A=v_A_2, thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_7} AuxVars[] AssignedVars[A]" "[105] L59-->L57-1: Formula: (= v_thread1Thread1of1ForFork3_i_10 (+ v_thread1Thread1of1ForFork3_i_9 1)) InVars {thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_9} OutVars{thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_i]" "[101] L57-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork3_i_3) InVars {thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_3, N=v_N_2} OutVars{thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_3, N=v_N_2} AuxVars[] AssignedVars[]" "[103] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[156] L34-1-->$Ultimate##0: Formula: (and (= v_thread2Thread1of1ForFork4_thidvar0_2 2) (= v_thread2Thread1of1ForFork4_thidvar1_2 2)) InVars {} OutVars{thread2Thread1of1ForFork4_cnt=v_thread2Thread1of1ForFork4_cnt_12, thread2Thread1of1ForFork4_j=v_thread2Thread1of1ForFork4_j_20, thread2Thread1of1ForFork4_thidvar0=v_thread2Thread1of1ForFork4_thidvar0_2, thread2Thread1of1ForFork4_thidvar1=v_thread2Thread1of1ForFork4_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_cnt, thread2Thread1of1ForFork4_j, thread2Thread1of1ForFork4_thidvar0, thread2Thread1of1ForFork4_thidvar1]" "[106] $Ultimate##0-->L70: Formula: (= v_thread2Thread1of1ForFork4_cnt_1 0) InVars {} OutVars{thread2Thread1of1ForFork4_cnt=v_thread2Thread1of1ForFork4_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_cnt]" "[107] L70-->L71-1: Formula: (= v_thread2Thread1of1ForFork4_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork4_j=v_thread2Thread1of1ForFork4_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_j]" [2025-04-26 16:53:51,736 INFO L754 eck$LassoCheckResult]: Loop: "[109] L71-1-->L72: Formula: (< v_thread2Thread1of1ForFork4_j_5 v_N_4) InVars {thread2Thread1of1ForFork4_j=v_thread2Thread1of1ForFork4_j_5, N=v_N_4} OutVars{thread2Thread1of1ForFork4_j=v_thread2Thread1of1ForFork4_j_5, N=v_N_4} AuxVars[] AssignedVars[]" "[112] L72-->L72-2: Formula: (<= (select v_A_4 v_thread2Thread1of1ForFork4_j_9) 0) InVars {A=v_A_4, thread2Thread1of1ForFork4_j=v_thread2Thread1of1ForFork4_j_9} OutVars{A=v_A_4, thread2Thread1of1ForFork4_j=v_thread2Thread1of1ForFork4_j_9} AuxVars[] AssignedVars[]" "[115] L72-2-->L75-1: Formula: (<= (select v_B_2 v_thread2Thread1of1ForFork4_j_13) 0) InVars {thread2Thread1of1ForFork4_j=v_thread2Thread1of1ForFork4_j_13, B=v_B_2} OutVars{thread2Thread1of1ForFork4_j=v_thread2Thread1of1ForFork4_j_13, B=v_B_2} AuxVars[] AssignedVars[]" "[117] L75-1-->L71-1: Formula: (= v_thread2Thread1of1ForFork4_j_16 (+ v_thread2Thread1of1ForFork4_j_15 1)) InVars {thread2Thread1of1ForFork4_j=v_thread2Thread1of1ForFork4_j_15} OutVars{thread2Thread1of1ForFork4_j=v_thread2Thread1of1ForFork4_j_16} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_j]" [2025-04-26 16:53:51,736 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:51,736 INFO L85 PathProgramCache]: Analyzing trace with hash 947420060, now seen corresponding path program 1 times [2025-04-26 16:53:51,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:51,736 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118354408] [2025-04-26 16:53:51,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:51,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:51,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:53:51,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:53:51,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:51,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:51,743 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:51,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:53:51,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:53:51,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:51,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:51,749 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:51,749 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:51,750 INFO L85 PathProgramCache]: Analyzing trace with hash 4282054, now seen corresponding path program 2 times [2025-04-26 16:53:51,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:51,750 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024279156] [2025-04-26 16:53:51,750 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:53:51,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:51,752 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:53:51,753 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:53:51,753 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:53:51,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:51,753 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:51,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:53:51,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:53:51,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:51,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:51,756 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:51,757 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:51,757 INFO L85 PathProgramCache]: Analyzing trace with hash 176983265, now seen corresponding path program 1 times [2025-04-26 16:53:51,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:51,757 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357628223] [2025-04-26 16:53:51,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:51,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:51,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:53:51,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:53:51,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:51,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:51,766 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:51,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:53:51,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:53:51,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:51,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:51,774 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:51,962 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:51,963 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:51,963 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:51,963 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:51,963 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:53:51,963 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:51,963 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:51,963 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:51,963 INFO L132 ssoRankerPreferences]: Filename of dumped script: map-aggr-update1-4modifiers.bpl_petrified1_Iteration3_Lasso [2025-04-26 16:53:51,963 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:51,963 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:51,965 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:52,054 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:52,057 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:52,060 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:52,062 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:52,065 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:52,200 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:53:52,200 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:53:52,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:52,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:52,203 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:52,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:53:52,206 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:52,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:52,217 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:52,217 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:52,217 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:52,225 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:52,225 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:52,231 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:53:52,247 INFO L436 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-04-26 16:53:52,248 INFO L437 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 16:53:52,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:52,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:52,250 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:52,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:53:52,253 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:53:52,270 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 16:53:52,270 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 16:53:52,270 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:53:52,270 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork4_j) = -2*thread2Thread1of1ForFork4_j + 1 Supporting invariants [-1*N + 1 >= 0] [2025-04-26 16:53:52,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 16:53:52,281 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:53:52,305 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:52,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:53:52,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:53:52,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:52,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:52,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:53:52,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:52,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:53:52,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:53:52,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:52,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:52,421 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:53:52,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:52,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:53:52,457 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2025-04-26 16:53:52,457 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38737 states and 100565 transitions. cyclomatic complexity: 63068 Second operand has 6 states, 6 states have (on average 2.5) internal successors, (in total 15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:53,069 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38737 states and 100565 transitions. cyclomatic complexity: 63068. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (in total 15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 47294 states and 115697 transitions. Complement of second has 11 states. [2025-04-26 16:53:53,070 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 2 non-accepting loop states 2 accepting loop states [2025-04-26 16:53:53,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (in total 15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:53,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions. [2025-04-26 16:53:53,071 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 134 transitions. Stem has 11 letters. Loop has 4 letters. [2025-04-26 16:53:53,071 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:53,072 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 134 transitions. Stem has 15 letters. Loop has 4 letters. [2025-04-26 16:53:53,072 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:53,072 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 134 transitions. Stem has 11 letters. Loop has 8 letters. [2025-04-26 16:53:53,072 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:53,072 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47294 states and 115697 transitions. [2025-04-26 16:53:53,539 INFO L131 ngComponentsAnalysis]: Automaton has 1214 accepting balls. 6215 [2025-04-26 16:53:53,792 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47294 states to 45104 states and 111670 transitions. [2025-04-26 16:53:53,793 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16809 [2025-04-26 16:53:53,824 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18691 [2025-04-26 16:53:53,825 INFO L74 IsDeterministic]: Start isDeterministic. Operand 45104 states and 111670 transitions. [2025-04-26 16:53:53,825 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:53,825 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45104 states and 111670 transitions. [2025-04-26 16:53:53,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45104 states and 111670 transitions. [2025-04-26 16:53:54,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45104 to 39388. [2025-04-26 16:53:54,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39388 states, 39388 states have (on average 2.5788818929623236) internal successors, (in total 101577), 39387 states have internal predecessors, (101577), 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 16:53:54,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39388 states to 39388 states and 101577 transitions. [2025-04-26 16:53:54,697 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39388 states and 101577 transitions. [2025-04-26 16:53:54,697 INFO L438 stractBuchiCegarLoop]: Abstraction has 39388 states and 101577 transitions. [2025-04-26 16:53:54,697 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:53:54,697 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39388 states and 101577 transitions. [2025-04-26 16:53:55,070 INFO L131 ngComponentsAnalysis]: Automaton has 813 accepting balls. 4371 [2025-04-26 16:53:55,071 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:55,071 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:55,071 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:55,071 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:53:55,072 INFO L752 eck$LassoCheckResult]: Stem: "[94] $Ultimate##0-->L34: Formula: (and (<= 0 v_ULTIMATE.start_m_1) (< v_ULTIMATE.start_m_1 v_N_7)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} AuxVars[] AssignedVars[]" "[153] L34-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork3_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork3_thidvar0=v_thread1Thread1of1ForFork3_thidvar0_2, thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_thidvar0, thread1Thread1of1ForFork3_i]" "[100] $Ultimate##0-->L57-1: Formula: (= v_thread1Thread1of1ForFork3_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_i]" "[102] L57-1-->L58: Formula: (< v_thread1Thread1of1ForFork3_i_5 v_N_1) InVars {thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_5, N=v_N_1} AuxVars[] AssignedVars[]" "[104] L58-->L59: Formula: (= (store v_A_2 v_thread1Thread1of1ForFork3_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork3_i_7))) (ite (< .cse0 0) 0 .cse0))) v_A_1) InVars {A=v_A_2, thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_7} AuxVars[] AssignedVars[A]" "[105] L59-->L57-1: Formula: (= v_thread1Thread1of1ForFork3_i_10 (+ v_thread1Thread1of1ForFork3_i_9 1)) InVars {thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_9} OutVars{thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_i]" "[102] L57-1-->L58: Formula: (< v_thread1Thread1of1ForFork3_i_5 v_N_1) InVars {thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_5, N=v_N_1} AuxVars[] AssignedVars[]" "[104] L58-->L59: Formula: (= (store v_A_2 v_thread1Thread1of1ForFork3_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork3_i_7))) (ite (< .cse0 0) 0 .cse0))) v_A_1) InVars {A=v_A_2, thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_7} AuxVars[] AssignedVars[A]" "[105] L59-->L57-1: Formula: (= v_thread1Thread1of1ForFork3_i_10 (+ v_thread1Thread1of1ForFork3_i_9 1)) InVars {thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_9} OutVars{thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_i]" "[101] L57-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork3_i_3) InVars {thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_3, N=v_N_2} OutVars{thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_3, N=v_N_2} AuxVars[] AssignedVars[]" "[103] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[156] L34-1-->$Ultimate##0: Formula: (and (= v_thread2Thread1of1ForFork4_thidvar0_2 2) (= v_thread2Thread1of1ForFork4_thidvar1_2 2)) InVars {} OutVars{thread2Thread1of1ForFork4_cnt=v_thread2Thread1of1ForFork4_cnt_12, thread2Thread1of1ForFork4_j=v_thread2Thread1of1ForFork4_j_20, thread2Thread1of1ForFork4_thidvar0=v_thread2Thread1of1ForFork4_thidvar0_2, thread2Thread1of1ForFork4_thidvar1=v_thread2Thread1of1ForFork4_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_cnt, thread2Thread1of1ForFork4_j, thread2Thread1of1ForFork4_thidvar0, thread2Thread1of1ForFork4_thidvar1]" "[106] $Ultimate##0-->L70: Formula: (= v_thread2Thread1of1ForFork4_cnt_1 0) InVars {} OutVars{thread2Thread1of1ForFork4_cnt=v_thread2Thread1of1ForFork4_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_cnt]" "[107] L70-->L71-1: Formula: (= v_thread2Thread1of1ForFork4_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork4_j=v_thread2Thread1of1ForFork4_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_j]" [2025-04-26 16:53:55,072 INFO L754 eck$LassoCheckResult]: Loop: "[109] L71-1-->L72: Formula: (< v_thread2Thread1of1ForFork4_j_5 v_N_4) InVars {thread2Thread1of1ForFork4_j=v_thread2Thread1of1ForFork4_j_5, N=v_N_4} OutVars{thread2Thread1of1ForFork4_j=v_thread2Thread1of1ForFork4_j_5, N=v_N_4} AuxVars[] AssignedVars[]" "[112] L72-->L72-2: Formula: (<= (select v_A_4 v_thread2Thread1of1ForFork4_j_9) 0) InVars {A=v_A_4, thread2Thread1of1ForFork4_j=v_thread2Thread1of1ForFork4_j_9} OutVars{A=v_A_4, thread2Thread1of1ForFork4_j=v_thread2Thread1of1ForFork4_j_9} AuxVars[] AssignedVars[]" "[115] L72-2-->L75-1: Formula: (<= (select v_B_2 v_thread2Thread1of1ForFork4_j_13) 0) InVars {thread2Thread1of1ForFork4_j=v_thread2Thread1of1ForFork4_j_13, B=v_B_2} OutVars{thread2Thread1of1ForFork4_j=v_thread2Thread1of1ForFork4_j_13, B=v_B_2} AuxVars[] AssignedVars[]" "[117] L75-1-->L71-1: Formula: (= v_thread2Thread1of1ForFork4_j_16 (+ v_thread2Thread1of1ForFork4_j_15 1)) InVars {thread2Thread1of1ForFork4_j=v_thread2Thread1of1ForFork4_j_15} OutVars{thread2Thread1of1ForFork4_j=v_thread2Thread1of1ForFork4_j_16} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_j]" [2025-04-26 16:53:55,072 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:55,072 INFO L85 PathProgramCache]: Analyzing trace with hash -768417997, now seen corresponding path program 2 times [2025-04-26 16:53:55,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:55,072 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852522770] [2025-04-26 16:53:55,072 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:53:55,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:55,081 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-26 16:53:55,098 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:53:55,098 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:53:55,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:55,098 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:55,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:53:55,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:53:55,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:55,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:55,111 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:55,112 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:55,112 INFO L85 PathProgramCache]: Analyzing trace with hash 4282054, now seen corresponding path program 3 times [2025-04-26 16:53:55,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:55,112 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954725609] [2025-04-26 16:53:55,112 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:53:55,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:55,118 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:53:55,119 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:53:55,119 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:53:55,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:55,119 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:55,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:53:55,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:53:55,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:55,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:55,123 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:55,124 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:55,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1297265416, now seen corresponding path program 2 times [2025-04-26 16:53:55,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:55,124 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115631659] [2025-04-26 16:53:55,124 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:53:55,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:55,132 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-26 16:53:55,142 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:53:55,143 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:53:55,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:55,143 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:55,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:53:55,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:53:55,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:55,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:55,159 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:55,398 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:55,398 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:55,398 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:55,398 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:55,398 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:53:55,398 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:55,398 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:55,398 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:55,398 INFO L132 ssoRankerPreferences]: Filename of dumped script: map-aggr-update1-4modifiers.bpl_petrified1_Iteration4_Lasso [2025-04-26 16:53:55,398 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:55,399 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:55,401 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:55,406 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:55,409 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:55,411 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:55,414 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:55,719 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:55,724 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:55,929 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:53:55,929 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:53:55,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:55,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:55,933 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 16:53:55,934 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 16:53:55,935 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:55,945 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:55,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:55,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:55,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:55,948 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:55,948 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:55,951 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:55,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:55,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:55,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:55,960 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 16:53:56,036 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 16:53:56,037 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:56,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:56,047 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:56,047 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:56,048 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:56,049 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:56,050 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:56,052 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:56,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:56,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:56,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:56,061 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 16:53:56,063 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 16:53:56,064 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:56,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:56,074 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:56,074 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:56,074 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:56,076 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:56,076 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:56,079 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:56,085 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 16:53:56,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:56,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:56,088 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 16:53:56,089 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 16:53:56,091 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:56,101 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:56,101 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:56,101 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:56,101 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:56,103 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:56,103 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:56,106 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:56,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:56,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:56,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:56,114 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 16:53:56,115 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 16:53:56,116 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:56,126 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:56,126 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:53:56,126 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:56,126 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:56,129 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-04-26 16:53:56,129 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:56,132 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:56,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 16:53:56,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:56,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:56,146 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 16:53:56,148 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 16:53:56,148 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:56,158 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:56,159 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:53:56,159 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:56,159 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:56,165 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-04-26 16:53:56,165 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:56,169 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:56,175 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 16:53:56,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:56,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:56,178 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 16:53:56,180 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 16:53:56,181 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:56,191 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:56,191 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:56,191 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:56,191 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:56,193 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:56,193 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:56,198 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:53:56,208 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:53:56,208 INFO L437 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 16:53:56,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:56,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:56,210 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 16:53:56,211 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 16:53:56,211 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:53:56,228 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 16:53:56,229 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:53:56,229 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:53:56,229 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork4_j, N) = -1*thread2Thread1of1ForFork4_j + 1*N Supporting invariants [] [2025-04-26 16:53:56,235 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 16:53:56,238 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:53:56,253 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:56,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:53:56,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:53:56,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:56,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:56,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:53:56,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:56,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:53:56,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:53:56,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:56,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:56,282 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:53:56,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:56,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:53:56,300 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 16:53:56,300 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39388 states and 101577 transitions. cyclomatic complexity: 63485 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:56,952 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39388 states and 101577 transitions. cyclomatic complexity: 63485. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 84898 states and 212775 transitions. Complement of second has 6 states. [2025-04-26 16:53:56,955 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 16:53:56,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:56,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2025-04-26 16:53:56,957 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 133 transitions. Stem has 14 letters. Loop has 4 letters. [2025-04-26 16:53:56,958 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:56,958 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 133 transitions. Stem has 18 letters. Loop has 4 letters. [2025-04-26 16:53:56,958 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:56,958 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 133 transitions. Stem has 14 letters. Loop has 8 letters. [2025-04-26 16:53:56,958 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:56,958 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84898 states and 212775 transitions. [2025-04-26 16:53:57,842 INFO L131 ngComponentsAnalysis]: Automaton has 696 accepting balls. 3199 [2025-04-26 16:53:58,358 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84898 states to 63303 states and 157269 transitions. [2025-04-26 16:53:58,359 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18745 [2025-04-26 16:53:58,395 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20652 [2025-04-26 16:53:58,395 INFO L74 IsDeterministic]: Start isDeterministic. Operand 63303 states and 157269 transitions. [2025-04-26 16:53:58,395 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:58,395 INFO L218 hiAutomatonCegarLoop]: Abstraction has 63303 states and 157269 transitions. [2025-04-26 16:53:58,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63303 states and 157269 transitions. [2025-04-26 16:53:59,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63303 to 60838. [2025-04-26 16:53:59,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60838 states, 60838 states have (on average 2.508958216903909) internal successors, (in total 152640), 60837 states have internal predecessors, (152640), 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 16:53:59,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60838 states to 60838 states and 152640 transitions. [2025-04-26 16:53:59,737 INFO L240 hiAutomatonCegarLoop]: Abstraction has 60838 states and 152640 transitions. [2025-04-26 16:53:59,737 INFO L438 stractBuchiCegarLoop]: Abstraction has 60838 states and 152640 transitions. [2025-04-26 16:53:59,738 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:53:59,738 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60838 states and 152640 transitions. [2025-04-26 16:54:00,223 INFO L131 ngComponentsAnalysis]: Automaton has 670 accepting balls. 3075 [2025-04-26 16:54:00,223 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:00,223 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:00,224 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:00,224 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:54:00,224 INFO L752 eck$LassoCheckResult]: Stem: "[94] $Ultimate##0-->L34: Formula: (and (<= 0 v_ULTIMATE.start_m_1) (< v_ULTIMATE.start_m_1 v_N_7)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} AuxVars[] AssignedVars[]" "[153] L34-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork3_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork3_thidvar0=v_thread1Thread1of1ForFork3_thidvar0_2, thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_thidvar0, thread1Thread1of1ForFork3_i]" "[100] $Ultimate##0-->L57-1: Formula: (= v_thread1Thread1of1ForFork3_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_i]" "[102] L57-1-->L58: Formula: (< v_thread1Thread1of1ForFork3_i_5 v_N_1) InVars {thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_5, N=v_N_1} AuxVars[] AssignedVars[]" "[104] L58-->L59: Formula: (= (store v_A_2 v_thread1Thread1of1ForFork3_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork3_i_7))) (ite (< .cse0 0) 0 .cse0))) v_A_1) InVars {A=v_A_2, thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_7} AuxVars[] AssignedVars[A]" "[105] L59-->L57-1: Formula: (= v_thread1Thread1of1ForFork3_i_10 (+ v_thread1Thread1of1ForFork3_i_9 1)) InVars {thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_9} OutVars{thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_i]" "[101] L57-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork3_i_3) InVars {thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_3, N=v_N_2} OutVars{thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_3, N=v_N_2} AuxVars[] AssignedVars[]" "[103] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[156] L34-1-->$Ultimate##0: Formula: (and (= v_thread2Thread1of1ForFork4_thidvar0_2 2) (= v_thread2Thread1of1ForFork4_thidvar1_2 2)) InVars {} OutVars{thread2Thread1of1ForFork4_cnt=v_thread2Thread1of1ForFork4_cnt_12, thread2Thread1of1ForFork4_j=v_thread2Thread1of1ForFork4_j_20, thread2Thread1of1ForFork4_thidvar0=v_thread2Thread1of1ForFork4_thidvar0_2, thread2Thread1of1ForFork4_thidvar1=v_thread2Thread1of1ForFork4_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_cnt, thread2Thread1of1ForFork4_j, thread2Thread1of1ForFork4_thidvar0, thread2Thread1of1ForFork4_thidvar1]" "[106] $Ultimate##0-->L70: Formula: (= v_thread2Thread1of1ForFork4_cnt_1 0) InVars {} OutVars{thread2Thread1of1ForFork4_cnt=v_thread2Thread1of1ForFork4_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_cnt]" "[107] L70-->L71-1: Formula: (= v_thread2Thread1of1ForFork4_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork4_j=v_thread2Thread1of1ForFork4_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_j]" "[108] L71-1-->thread2FINAL: Formula: (<= v_N_3 v_thread2Thread1of1ForFork4_j_3) InVars {thread2Thread1of1ForFork4_j=v_thread2Thread1of1ForFork4_j_3, N=v_N_3} OutVars{thread2Thread1of1ForFork4_j=v_thread2Thread1of1ForFork4_j_3, N=v_N_3} AuxVars[] AssignedVars[]" "[110] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[159] L35-->$Ultimate##0: Formula: (and (= v_thread3Thread1of1ForFork5_thidvar0_2 3) (= v_thread3Thread1of1ForFork5_thidvar2_2 3) (= v_thread3Thread1of1ForFork5_thidvar1_2 3)) InVars {} OutVars{thread3Thread1of1ForFork5_thidvar2=v_thread3Thread1of1ForFork5_thidvar2_2, thread3Thread1of1ForFork5_thidvar1=v_thread3Thread1of1ForFork5_thidvar1_2, thread3Thread1of1ForFork5_thidvar0=v_thread3Thread1of1ForFork5_thidvar0_2, thread3Thread1of1ForFork5_k=v_thread3Thread1of1ForFork5_k_14} AuxVars[] AssignedVars[thread3Thread1of1ForFork5_thidvar2, thread3Thread1of1ForFork5_thidvar1, thread3Thread1of1ForFork5_thidvar0, thread3Thread1of1ForFork5_k]" "[118] $Ultimate##0-->L89-1: Formula: (= v_thread3Thread1of1ForFork5_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork5_k=v_thread3Thread1of1ForFork5_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork5_k]" [2025-04-26 16:54:00,224 INFO L754 eck$LassoCheckResult]: Loop: "[120] L89-1-->L90: Formula: (< v_thread3Thread1of1ForFork5_k_5 v_N_5) InVars {N=v_N_5, thread3Thread1of1ForFork5_k=v_thread3Thread1of1ForFork5_k_5} OutVars{N=v_N_5, thread3Thread1of1ForFork5_k=v_thread3Thread1of1ForFork5_k_5} AuxVars[] AssignedVars[]" "[122] L90-->L91: Formula: (= (store v_B_4 v_thread3Thread1of1ForFork5_k_7 v_thread3Thread1of1ForFork5_k_7) v_B_3) InVars {thread3Thread1of1ForFork5_k=v_thread3Thread1of1ForFork5_k_7, B=v_B_4} OutVars{thread3Thread1of1ForFork5_k=v_thread3Thread1of1ForFork5_k_7, B=v_B_3} AuxVars[] AssignedVars[B]" "[123] L91-->L89-1: Formula: (= (+ v_thread3Thread1of1ForFork5_k_9 1) v_thread3Thread1of1ForFork5_k_10) InVars {thread3Thread1of1ForFork5_k=v_thread3Thread1of1ForFork5_k_9} OutVars{thread3Thread1of1ForFork5_k=v_thread3Thread1of1ForFork5_k_10} AuxVars[] AssignedVars[thread3Thread1of1ForFork5_k]" [2025-04-26 16:54:00,224 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:00,225 INFO L85 PathProgramCache]: Analyzing trace with hash 176952917, now seen corresponding path program 1 times [2025-04-26 16:54:00,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:00,225 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559422129] [2025-04-26 16:54:00,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:00,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:00,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:54:00,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:54:00,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:00,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:00,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-26 16:54:00,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:54:00,274 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559422129] [2025-04-26 16:54:00,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559422129] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:54:00,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:54:00,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:54:00,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128910781] [2025-04-26 16:54:00,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:54:00,275 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:54:00,275 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:00,275 INFO L85 PathProgramCache]: Analyzing trace with hash 149016, now seen corresponding path program 1 times [2025-04-26 16:54:00,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:00,275 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399315374] [2025-04-26 16:54:00,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:00,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:00,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:00,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:00,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:00,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:00,279 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:00,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:00,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:00,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:00,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:00,284 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:00,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:54:00,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:54:00,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:54:00,304 INFO L87 Difference]: Start difference. First operand 60838 states and 152640 transitions. cyclomatic complexity: 93468 Second operand has 4 states, 4 states have (on average 3.75) internal successors, (in total 15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:01,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:54:01,076 INFO L93 Difference]: Finished difference Result 106447 states and 264630 transitions. [2025-04-26 16:54:01,077 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 106447 states and 264630 transitions. [2025-04-26 16:54:02,077 INFO L131 ngComponentsAnalysis]: Automaton has 756 accepting balls. 3479 [2025-04-26 16:54:03,110 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 106447 states to 106447 states and 264630 transitions. [2025-04-26 16:54:03,110 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30910 [2025-04-26 16:54:03,206 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30910 [2025-04-26 16:54:03,207 INFO L74 IsDeterministic]: Start isDeterministic. Operand 106447 states and 264630 transitions. [2025-04-26 16:54:03,207 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:03,207 INFO L218 hiAutomatonCegarLoop]: Abstraction has 106447 states and 264630 transitions. [2025-04-26 16:54:03,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106447 states and 264630 transitions. [2025-04-26 16:54:04,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106447 to 65633. [2025-04-26 16:54:04,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65633 states, 65633 states have (on average 2.4911553639175414) internal successors, (in total 163502), 65632 states have internal predecessors, (163502), 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 16:54:04,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65633 states to 65633 states and 163502 transitions. [2025-04-26 16:54:04,988 INFO L240 hiAutomatonCegarLoop]: Abstraction has 65633 states and 163502 transitions. [2025-04-26 16:54:04,989 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 16:54:04,989 INFO L438 stractBuchiCegarLoop]: Abstraction has 65633 states and 163502 transitions. [2025-04-26 16:54:04,989 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:54:04,989 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65633 states and 163502 transitions. [2025-04-26 16:54:05,270 INFO L131 ngComponentsAnalysis]: Automaton has 670 accepting balls. 3075 [2025-04-26 16:54:05,270 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:05,270 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:05,271 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:05,271 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:54:05,271 INFO L752 eck$LassoCheckResult]: Stem: "[94] $Ultimate##0-->L34: Formula: (and (<= 0 v_ULTIMATE.start_m_1) (< v_ULTIMATE.start_m_1 v_N_7)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} AuxVars[] AssignedVars[]" "[153] L34-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork3_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork3_thidvar0=v_thread1Thread1of1ForFork3_thidvar0_2, thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_thidvar0, thread1Thread1of1ForFork3_i]" "[100] $Ultimate##0-->L57-1: Formula: (= v_thread1Thread1of1ForFork3_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_i]" "[102] L57-1-->L58: Formula: (< v_thread1Thread1of1ForFork3_i_5 v_N_1) InVars {thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_5, N=v_N_1} AuxVars[] AssignedVars[]" "[104] L58-->L59: Formula: (= (store v_A_2 v_thread1Thread1of1ForFork3_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork3_i_7))) (ite (< .cse0 0) 0 .cse0))) v_A_1) InVars {A=v_A_2, thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_7} AuxVars[] AssignedVars[A]" "[105] L59-->L57-1: Formula: (= v_thread1Thread1of1ForFork3_i_10 (+ v_thread1Thread1of1ForFork3_i_9 1)) InVars {thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_9} OutVars{thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_i]" "[101] L57-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork3_i_3) InVars {thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_3, N=v_N_2} OutVars{thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_3, N=v_N_2} AuxVars[] AssignedVars[]" "[103] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[156] L34-1-->$Ultimate##0: Formula: (and (= v_thread2Thread1of1ForFork4_thidvar0_2 2) (= v_thread2Thread1of1ForFork4_thidvar1_2 2)) InVars {} OutVars{thread2Thread1of1ForFork4_cnt=v_thread2Thread1of1ForFork4_cnt_12, thread2Thread1of1ForFork4_j=v_thread2Thread1of1ForFork4_j_20, thread2Thread1of1ForFork4_thidvar0=v_thread2Thread1of1ForFork4_thidvar0_2, thread2Thread1of1ForFork4_thidvar1=v_thread2Thread1of1ForFork4_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_cnt, thread2Thread1of1ForFork4_j, thread2Thread1of1ForFork4_thidvar0, thread2Thread1of1ForFork4_thidvar1]" "[106] $Ultimate##0-->L70: Formula: (= v_thread2Thread1of1ForFork4_cnt_1 0) InVars {} OutVars{thread2Thread1of1ForFork4_cnt=v_thread2Thread1of1ForFork4_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_cnt]" "[107] L70-->L71-1: Formula: (= v_thread2Thread1of1ForFork4_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork4_j=v_thread2Thread1of1ForFork4_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_j]" "[109] L71-1-->L72: Formula: (< v_thread2Thread1of1ForFork4_j_5 v_N_4) InVars {thread2Thread1of1ForFork4_j=v_thread2Thread1of1ForFork4_j_5, N=v_N_4} OutVars{thread2Thread1of1ForFork4_j=v_thread2Thread1of1ForFork4_j_5, N=v_N_4} AuxVars[] AssignedVars[]" "[112] L72-->L72-2: Formula: (<= (select v_A_4 v_thread2Thread1of1ForFork4_j_9) 0) InVars {A=v_A_4, thread2Thread1of1ForFork4_j=v_thread2Thread1of1ForFork4_j_9} OutVars{A=v_A_4, thread2Thread1of1ForFork4_j=v_thread2Thread1of1ForFork4_j_9} AuxVars[] AssignedVars[]" "[159] L35-->$Ultimate##0: Formula: (and (= v_thread3Thread1of1ForFork5_thidvar0_2 3) (= v_thread3Thread1of1ForFork5_thidvar2_2 3) (= v_thread3Thread1of1ForFork5_thidvar1_2 3)) InVars {} OutVars{thread3Thread1of1ForFork5_thidvar2=v_thread3Thread1of1ForFork5_thidvar2_2, thread3Thread1of1ForFork5_thidvar1=v_thread3Thread1of1ForFork5_thidvar1_2, thread3Thread1of1ForFork5_thidvar0=v_thread3Thread1of1ForFork5_thidvar0_2, thread3Thread1of1ForFork5_k=v_thread3Thread1of1ForFork5_k_14} AuxVars[] AssignedVars[thread3Thread1of1ForFork5_thidvar2, thread3Thread1of1ForFork5_thidvar1, thread3Thread1of1ForFork5_thidvar0, thread3Thread1of1ForFork5_k]" "[118] $Ultimate##0-->L89-1: Formula: (= v_thread3Thread1of1ForFork5_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork5_k=v_thread3Thread1of1ForFork5_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork5_k]" [2025-04-26 16:54:05,271 INFO L754 eck$LassoCheckResult]: Loop: "[120] L89-1-->L90: Formula: (< v_thread3Thread1of1ForFork5_k_5 v_N_5) InVars {N=v_N_5, thread3Thread1of1ForFork5_k=v_thread3Thread1of1ForFork5_k_5} OutVars{N=v_N_5, thread3Thread1of1ForFork5_k=v_thread3Thread1of1ForFork5_k_5} AuxVars[] AssignedVars[]" "[122] L90-->L91: Formula: (= (store v_B_4 v_thread3Thread1of1ForFork5_k_7 v_thread3Thread1of1ForFork5_k_7) v_B_3) InVars {thread3Thread1of1ForFork5_k=v_thread3Thread1of1ForFork5_k_7, B=v_B_4} OutVars{thread3Thread1of1ForFork5_k=v_thread3Thread1of1ForFork5_k_7, B=v_B_3} AuxVars[] AssignedVars[B]" "[123] L91-->L89-1: Formula: (= (+ v_thread3Thread1of1ForFork5_k_9 1) v_thread3Thread1of1ForFork5_k_10) InVars {thread3Thread1of1ForFork5_k=v_thread3Thread1of1ForFork5_k_9} OutVars{thread3Thread1of1ForFork5_k=v_thread3Thread1of1ForFork5_k_10} AuxVars[] AssignedVars[thread3Thread1of1ForFork5_k]" [2025-04-26 16:54:05,272 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:05,272 INFO L85 PathProgramCache]: Analyzing trace with hash 176984630, now seen corresponding path program 1 times [2025-04-26 16:54:05,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:05,272 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826591416] [2025-04-26 16:54:05,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:05,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:05,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:54:05,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:54:05,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:05,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:05,286 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:05,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:54:05,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:54:05,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:05,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:05,293 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:05,293 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:05,293 INFO L85 PathProgramCache]: Analyzing trace with hash 149016, now seen corresponding path program 2 times [2025-04-26 16:54:05,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:05,294 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534840895] [2025-04-26 16:54:05,294 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:54:05,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:05,295 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:05,299 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:05,299 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:54:05,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:05,299 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:05,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:05,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:05,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:05,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:05,301 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:05,302 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:05,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1670607933, now seen corresponding path program 1 times [2025-04-26 16:54:05,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:05,302 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427021962] [2025-04-26 16:54:05,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:05,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:05,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:54:05,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:54:05,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:05,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:05,314 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:05,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:54:05,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:54:05,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:05,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:05,322 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:05,661 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:05,661 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:05,661 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:05,661 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:05,661 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:05,661 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:05,661 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:05,661 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:05,661 INFO L132 ssoRankerPreferences]: Filename of dumped script: map-aggr-update1-4modifiers.bpl_petrified1_Iteration6_Lasso [2025-04-26 16:54:05,661 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:05,661 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:05,662 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:05,666 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:05,668 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:05,670 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:05,672 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:05,674 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:05,676 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:05,678 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:05,680 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:05,689 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:05,710 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:05,794 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:05,794 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:05,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:05,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:05,796 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 16:54:05,798 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 16:54:05,800 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:05,811 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:05,811 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:05,811 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:05,811 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:05,812 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:05,812 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:05,816 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:05,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:05,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:05,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:05,824 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:05,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 16:54:05,826 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:05,836 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:05,836 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:05,836 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:05,836 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:05,838 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:05,838 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:05,840 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:05,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 16:54:05,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:05,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:05,847 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:05,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 16:54:05,849 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:05,860 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:05,861 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:05,861 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:05,861 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:05,862 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:05,862 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:05,867 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:05,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 16:54:05,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:05,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:05,876 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:05,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 16:54:05,879 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:05,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:05,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:05,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:05,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:05,890 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:05,890 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:05,893 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:05,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:05,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:05,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:05,900 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:05,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 16:54:05,906 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:05,915 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:05,916 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:05,916 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:05,916 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:05,917 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:05,917 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:05,919 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:05,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-04-26 16:54:05,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:05,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:05,926 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:05,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 16:54:05,928 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:05,937 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:05,938 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:05,938 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:05,938 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:05,939 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:05,939 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:05,941 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:05,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:05,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:05,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:05,948 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:05,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 16:54:05,951 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:05,960 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:05,960 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:05,960 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:05,960 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:05,961 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:05,961 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:05,963 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:05,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:05,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:05,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:05,997 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:05,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 16:54:05,999 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:06,009 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:06,009 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:06,009 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:06,009 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:06,010 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:06,010 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:06,014 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:06,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-04-26 16:54:06,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:06,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:06,021 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:06,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 16:54:06,023 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:06,032 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:06,032 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:54:06,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:06,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:06,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:06,033 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:54:06,033 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:54:06,034 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:06,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:06,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:06,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:06,040 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:06,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 16:54:06,042 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:06,051 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:06,052 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:06,052 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:06,052 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:06,055 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:06,055 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:06,059 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:06,068 INFO L436 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-04-26 16:54:06,069 INFO L437 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 16:54:06,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:06,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:06,071 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:06,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-04-26 16:54:06,072 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:06,088 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-04-26 16:54:06,089 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:54:06,089 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:06,089 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, thread3Thread1of1ForFork5_k) = 1*N - 1*thread3Thread1of1ForFork5_k Supporting invariants [] [2025-04-26 16:54:06,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:06,095 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:54:06,103 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:06,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:54:06,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:54:06,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:06,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:06,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:54:06,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:06,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:06,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:06,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:06,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:06,131 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:54:06,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:06,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:06,143 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 16:54:06,143 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 65633 states and 163502 transitions. cyclomatic complexity: 99640 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (in total 18), 3 states have internal predecessors, (18), 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 16:54:07,233 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 65633 states and 163502 transitions. cyclomatic complexity: 99640. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (in total 18), 3 states have internal predecessors, (18), 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 141034 states and 342176 transitions. Complement of second has 6 states. [2025-04-26 16:54:07,233 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 16:54:07,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (in total 18), 3 states have internal predecessors, (18), 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 16:54:07,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2025-04-26 16:54:07,234 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 136 transitions. Stem has 15 letters. Loop has 3 letters. [2025-04-26 16:54:07,234 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:07,234 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 136 transitions. Stem has 18 letters. Loop has 3 letters. [2025-04-26 16:54:07,234 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:07,234 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 136 transitions. Stem has 15 letters. Loop has 6 letters. [2025-04-26 16:54:07,234 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:07,234 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 141034 states and 342176 transitions. [2025-04-26 16:54:08,728 INFO L131 ngComponentsAnalysis]: Automaton has 558 accepting balls. 2225 [2025-04-26 16:54:09,425 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 141034 states to 105980 states and 254780 transitions. [2025-04-26 16:54:09,425 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27524 [2025-04-26 16:54:09,483 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28707 [2025-04-26 16:54:09,483 INFO L74 IsDeterministic]: Start isDeterministic. Operand 105980 states and 254780 transitions. [2025-04-26 16:54:09,483 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:09,483 INFO L218 hiAutomatonCegarLoop]: Abstraction has 105980 states and 254780 transitions. [2025-04-26 16:54:09,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105980 states and 254780 transitions. [2025-04-26 16:54:11,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105980 to 104018. [2025-04-26 16:54:11,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104018 states, 104018 states have (on average 2.419792728181661) internal successors, (in total 251702), 104017 states have internal predecessors, (251702), 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 16:54:11,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104018 states to 104018 states and 251702 transitions. [2025-04-26 16:54:11,895 INFO L240 hiAutomatonCegarLoop]: Abstraction has 104018 states and 251702 transitions. [2025-04-26 16:54:11,895 INFO L438 stractBuchiCegarLoop]: Abstraction has 104018 states and 251702 transitions. [2025-04-26 16:54:11,895 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 16:54:11,896 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104018 states and 251702 transitions. [2025-04-26 16:54:12,622 INFO L131 ngComponentsAnalysis]: Automaton has 558 accepting balls. 2225 [2025-04-26 16:54:12,622 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:12,622 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:12,623 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:12,623 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:54:12,624 INFO L752 eck$LassoCheckResult]: Stem: "[94] $Ultimate##0-->L34: Formula: (and (<= 0 v_ULTIMATE.start_m_1) (< v_ULTIMATE.start_m_1 v_N_7)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} AuxVars[] AssignedVars[]" "[153] L34-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork3_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork3_thidvar0=v_thread1Thread1of1ForFork3_thidvar0_2, thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_thidvar0, thread1Thread1of1ForFork3_i]" "[100] $Ultimate##0-->L57-1: Formula: (= v_thread1Thread1of1ForFork3_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_i]" "[102] L57-1-->L58: Formula: (< v_thread1Thread1of1ForFork3_i_5 v_N_1) InVars {thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_5, N=v_N_1} AuxVars[] AssignedVars[]" "[104] L58-->L59: Formula: (= (store v_A_2 v_thread1Thread1of1ForFork3_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork3_i_7))) (ite (< .cse0 0) 0 .cse0))) v_A_1) InVars {A=v_A_2, thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_7} AuxVars[] AssignedVars[A]" "[105] L59-->L57-1: Formula: (= v_thread1Thread1of1ForFork3_i_10 (+ v_thread1Thread1of1ForFork3_i_9 1)) InVars {thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_9} OutVars{thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_i]" "[101] L57-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork3_i_3) InVars {thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_3, N=v_N_2} OutVars{thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_3, N=v_N_2} AuxVars[] AssignedVars[]" "[103] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[156] L34-1-->$Ultimate##0: Formula: (and (= v_thread2Thread1of1ForFork4_thidvar0_2 2) (= v_thread2Thread1of1ForFork4_thidvar1_2 2)) InVars {} OutVars{thread2Thread1of1ForFork4_cnt=v_thread2Thread1of1ForFork4_cnt_12, thread2Thread1of1ForFork4_j=v_thread2Thread1of1ForFork4_j_20, thread2Thread1of1ForFork4_thidvar0=v_thread2Thread1of1ForFork4_thidvar0_2, thread2Thread1of1ForFork4_thidvar1=v_thread2Thread1of1ForFork4_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_cnt, thread2Thread1of1ForFork4_j, thread2Thread1of1ForFork4_thidvar0, thread2Thread1of1ForFork4_thidvar1]" "[106] $Ultimate##0-->L70: Formula: (= v_thread2Thread1of1ForFork4_cnt_1 0) InVars {} OutVars{thread2Thread1of1ForFork4_cnt=v_thread2Thread1of1ForFork4_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_cnt]" "[107] L70-->L71-1: Formula: (= v_thread2Thread1of1ForFork4_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork4_j=v_thread2Thread1of1ForFork4_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_j]" "[109] L71-1-->L72: Formula: (< v_thread2Thread1of1ForFork4_j_5 v_N_4) InVars {thread2Thread1of1ForFork4_j=v_thread2Thread1of1ForFork4_j_5, N=v_N_4} OutVars{thread2Thread1of1ForFork4_j=v_thread2Thread1of1ForFork4_j_5, N=v_N_4} AuxVars[] AssignedVars[]" "[112] L72-->L72-2: Formula: (<= (select v_A_4 v_thread2Thread1of1ForFork4_j_9) 0) InVars {A=v_A_4, thread2Thread1of1ForFork4_j=v_thread2Thread1of1ForFork4_j_9} OutVars{A=v_A_4, thread2Thread1of1ForFork4_j=v_thread2Thread1of1ForFork4_j_9} AuxVars[] AssignedVars[]" "[159] L35-->$Ultimate##0: Formula: (and (= v_thread3Thread1of1ForFork5_thidvar0_2 3) (= v_thread3Thread1of1ForFork5_thidvar2_2 3) (= v_thread3Thread1of1ForFork5_thidvar1_2 3)) InVars {} OutVars{thread3Thread1of1ForFork5_thidvar2=v_thread3Thread1of1ForFork5_thidvar2_2, thread3Thread1of1ForFork5_thidvar1=v_thread3Thread1of1ForFork5_thidvar1_2, thread3Thread1of1ForFork5_thidvar0=v_thread3Thread1of1ForFork5_thidvar0_2, thread3Thread1of1ForFork5_k=v_thread3Thread1of1ForFork5_k_14} AuxVars[] AssignedVars[thread3Thread1of1ForFork5_thidvar2, thread3Thread1of1ForFork5_thidvar1, thread3Thread1of1ForFork5_thidvar0, thread3Thread1of1ForFork5_k]" "[118] $Ultimate##0-->L89-1: Formula: (= v_thread3Thread1of1ForFork5_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork5_k=v_thread3Thread1of1ForFork5_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork5_k]" "[120] L89-1-->L90: Formula: (< v_thread3Thread1of1ForFork5_k_5 v_N_5) InVars {N=v_N_5, thread3Thread1of1ForFork5_k=v_thread3Thread1of1ForFork5_k_5} OutVars{N=v_N_5, thread3Thread1of1ForFork5_k=v_thread3Thread1of1ForFork5_k_5} AuxVars[] AssignedVars[]" "[144] L36-->$Ultimate##0: Formula: (and (= 4 v_thread3Thread1of1ForFork0_thidvar1_2) (= 4 v_thread3Thread1of1ForFork0_thidvar0_2) (= 4 v_thread3Thread1of1ForFork0_thidvar2_2) (= 4 v_thread3Thread1of1ForFork0_thidvar3_2)) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_14, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_2, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k, thread3Thread1of1ForFork0_thidvar3, thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0]" "[124] $Ultimate##0-->L89-1: Formula: (= v_thread3Thread1of1ForFork0_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k]" [2025-04-26 16:54:12,624 INFO L754 eck$LassoCheckResult]: Loop: "[126] L89-1-->L90: Formula: (< v_thread3Thread1of1ForFork0_k_5 v_N_5) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} AuxVars[] AssignedVars[]" "[128] L90-->L91: Formula: (= (store v_B_4 v_thread3Thread1of1ForFork0_k_7 v_thread3Thread1of1ForFork0_k_7) v_B_3) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_7, B=v_B_4} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_7, B=v_B_3} AuxVars[] AssignedVars[B]" "[129] L91-->L89-1: Formula: (= v_thread3Thread1of1ForFork0_k_10 (+ v_thread3Thread1of1ForFork0_k_9 1)) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_9} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_10} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k]" [2025-04-26 16:54:12,624 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:12,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1670607250, now seen corresponding path program 1 times [2025-04-26 16:54:12,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:12,624 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136859786] [2025-04-26 16:54:12,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:12,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:12,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:54:12,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:54:12,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:12,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:12,634 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:12,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:54:12,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:54:12,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:12,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:12,645 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:12,646 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:12,646 INFO L85 PathProgramCache]: Analyzing trace with hash 154974, now seen corresponding path program 1 times [2025-04-26 16:54:12,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:12,646 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044785005] [2025-04-26 16:54:12,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:12,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:12,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:12,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:12,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:12,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:12,650 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:12,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:12,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:12,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:12,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:12,652 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:12,652 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:12,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1020566481, now seen corresponding path program 1 times [2025-04-26 16:54:12,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:12,653 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611484455] [2025-04-26 16:54:12,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:12,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:12,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 16:54:12,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 16:54:12,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:12,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:12,663 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:12,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 16:54:12,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 16:54:12,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:12,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:12,672 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:12,856 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:12,856 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:12,856 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:12,856 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:12,856 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:12,856 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:12,856 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:12,856 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:12,856 INFO L132 ssoRankerPreferences]: Filename of dumped script: map-aggr-update1-4modifiers.bpl_petrified1_Iteration7_Lasso [2025-04-26 16:54:12,856 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:12,856 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:12,858 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:12,861 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:12,863 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:12,865 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:12,867 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:12,868 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:12,870 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:12,872 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:12,889 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:12,893 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:12,895 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:12,897 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:12,906 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:12,908 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:12,910 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:12,912 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:13,033 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:13,034 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:13,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:13,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:13,036 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:13,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-04-26 16:54:13,038 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:13,048 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:13,049 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:13,049 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:13,049 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:13,050 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:13,050 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:13,052 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:13,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:13,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:13,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:13,060 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:13,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-04-26 16:54:13,065 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:13,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:13,075 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:13,075 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:13,075 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:13,077 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:13,077 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:13,081 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:13,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:13,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:13,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:13,088 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:13,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-04-26 16:54:13,092 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:13,102 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:13,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:13,103 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:13,103 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:13,104 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:13,104 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:13,106 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:13,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-04-26 16:54:13,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:13,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:13,114 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:13,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-04-26 16:54:13,117 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:13,127 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:13,127 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:13,127 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:13,127 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:13,128 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:13,128 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:13,130 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:13,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:13,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:13,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:13,139 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:13,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-04-26 16:54:13,142 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:13,151 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:13,152 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:13,152 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:13,152 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:13,154 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:13,154 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:13,156 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:13,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:13,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:13,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:13,164 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:13,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-04-26 16:54:13,167 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:13,178 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:13,178 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:13,178 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:13,178 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:13,181 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:13,181 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:13,184 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:13,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:13,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:13,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:13,194 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:13,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-04-26 16:54:13,197 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:13,211 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:13,211 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:13,211 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:13,211 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:13,216 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:13,216 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:13,222 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:13,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-04-26 16:54:13,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:13,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:13,237 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:13,247 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:13,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-04-26 16:54:13,259 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:13,259 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:13,259 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:13,259 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:13,261 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:13,261 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:13,266 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:13,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-04-26 16:54:13,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:13,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:13,286 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:13,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-04-26 16:54:13,289 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:13,303 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:13,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:13,303 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:13,303 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:13,304 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:13,306 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:13,312 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:13,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-04-26 16:54:13,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:13,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:13,323 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:13,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-04-26 16:54:13,326 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:13,336 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:13,336 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:13,336 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:13,336 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:13,339 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:13,339 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:13,341 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:13,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:13,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:13,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:13,349 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:13,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-04-26 16:54:13,352 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:13,363 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:13,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:13,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:13,363 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:13,364 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:13,364 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:13,366 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:13,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-04-26 16:54:13,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:13,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:13,374 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:13,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-04-26 16:54:13,375 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:13,385 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:13,385 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:54:13,385 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:13,385 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:13,385 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:13,385 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:54:13,385 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:54:13,386 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:13,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:13,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:13,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:13,396 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:13,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-04-26 16:54:13,399 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:13,409 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:13,410 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:13,410 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:13,410 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:13,412 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:13,412 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:13,417 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:13,424 INFO L436 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2025-04-26 16:54:13,425 INFO L437 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 16:54:13,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:13,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:13,427 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:13,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-04-26 16:54:13,428 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:13,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2025-04-26 16:54:13,444 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:54:13,445 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:13,445 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread3Thread1of1ForFork0_k, N) = -1*thread3Thread1of1ForFork0_k + 1*N Supporting invariants [] [2025-04-26 16:54:13,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2025-04-26 16:54:13,452 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:54:13,459 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:13,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:54:13,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:54:13,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:13,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:13,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:54:13,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:13,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:13,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:13,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:13,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:13,493 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:54:13,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:13,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:13,506 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 16:54:13,506 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 104018 states and 251702 transitions. cyclomatic complexity: 150413 Second operand has 3 states, 3 states have (on average 7.0) internal successors, (in total 21), 3 states have internal predecessors, (21), 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 16:54:15,489 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 104018 states and 251702 transitions. cyclomatic complexity: 150413. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (in total 21), 3 states have internal predecessors, (21), 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 220845 states and 522722 transitions. Complement of second has 6 states. [2025-04-26 16:54:15,490 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 16:54:15,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (in total 21), 3 states have internal predecessors, (21), 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 16:54:15,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 140 transitions. [2025-04-26 16:54:15,491 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 140 transitions. Stem has 18 letters. Loop has 3 letters. [2025-04-26 16:54:15,491 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:15,491 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 140 transitions. Stem has 21 letters. Loop has 3 letters. [2025-04-26 16:54:15,491 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:15,491 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 140 transitions. Stem has 18 letters. Loop has 6 letters. [2025-04-26 16:54:15,491 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:15,491 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 220845 states and 522722 transitions. [2025-04-26 16:54:17,760 INFO L131 ngComponentsAnalysis]: Automaton has 393 accepting balls. 1349 [2025-04-26 16:54:18,825 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 220845 states to 156903 states and 367158 transitions. [2025-04-26 16:54:18,825 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36791 [2025-04-26 16:54:19,051 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37783 [2025-04-26 16:54:19,051 INFO L74 IsDeterministic]: Start isDeterministic. Operand 156903 states and 367158 transitions. [2025-04-26 16:54:19,051 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:19,051 INFO L218 hiAutomatonCegarLoop]: Abstraction has 156903 states and 367158 transitions. [2025-04-26 16:54:19,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156903 states and 367158 transitions. [2025-04-26 16:54:21,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156903 to 153839. [2025-04-26 16:54:21,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153839 states, 153839 states have (on average 2.3576661314751135) internal successors, (in total 362701), 153838 states have internal predecessors, (362701), 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 16:54:22,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153839 states to 153839 states and 362701 transitions. [2025-04-26 16:54:22,277 INFO L240 hiAutomatonCegarLoop]: Abstraction has 153839 states and 362701 transitions. [2025-04-26 16:54:22,277 INFO L438 stractBuchiCegarLoop]: Abstraction has 153839 states and 362701 transitions. [2025-04-26 16:54:22,277 INFO L340 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-04-26 16:54:22,277 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 153839 states and 362701 transitions. [2025-04-26 16:54:23,077 INFO L131 ngComponentsAnalysis]: Automaton has 393 accepting balls. 1349 [2025-04-26 16:54:23,078 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:23,078 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:23,078 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:23,078 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:54:23,079 INFO L752 eck$LassoCheckResult]: Stem: "[94] $Ultimate##0-->L34: Formula: (and (<= 0 v_ULTIMATE.start_m_1) (< v_ULTIMATE.start_m_1 v_N_7)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} AuxVars[] AssignedVars[]" "[153] L34-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork3_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork3_thidvar0=v_thread1Thread1of1ForFork3_thidvar0_2, thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_thidvar0, thread1Thread1of1ForFork3_i]" "[100] $Ultimate##0-->L57-1: Formula: (= v_thread1Thread1of1ForFork3_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_i]" "[102] L57-1-->L58: Formula: (< v_thread1Thread1of1ForFork3_i_5 v_N_1) InVars {thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_5, N=v_N_1} AuxVars[] AssignedVars[]" "[104] L58-->L59: Formula: (= (store v_A_2 v_thread1Thread1of1ForFork3_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork3_i_7))) (ite (< .cse0 0) 0 .cse0))) v_A_1) InVars {A=v_A_2, thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_7} AuxVars[] AssignedVars[A]" "[105] L59-->L57-1: Formula: (= v_thread1Thread1of1ForFork3_i_10 (+ v_thread1Thread1of1ForFork3_i_9 1)) InVars {thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_9} OutVars{thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_i]" "[101] L57-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork3_i_3) InVars {thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_3, N=v_N_2} OutVars{thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_3, N=v_N_2} AuxVars[] AssignedVars[]" "[103] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[156] L34-1-->$Ultimate##0: Formula: (and (= v_thread2Thread1of1ForFork4_thidvar0_2 2) (= v_thread2Thread1of1ForFork4_thidvar1_2 2)) InVars {} OutVars{thread2Thread1of1ForFork4_cnt=v_thread2Thread1of1ForFork4_cnt_12, thread2Thread1of1ForFork4_j=v_thread2Thread1of1ForFork4_j_20, thread2Thread1of1ForFork4_thidvar0=v_thread2Thread1of1ForFork4_thidvar0_2, thread2Thread1of1ForFork4_thidvar1=v_thread2Thread1of1ForFork4_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_cnt, thread2Thread1of1ForFork4_j, thread2Thread1of1ForFork4_thidvar0, thread2Thread1of1ForFork4_thidvar1]" "[106] $Ultimate##0-->L70: Formula: (= v_thread2Thread1of1ForFork4_cnt_1 0) InVars {} OutVars{thread2Thread1of1ForFork4_cnt=v_thread2Thread1of1ForFork4_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_cnt]" "[107] L70-->L71-1: Formula: (= v_thread2Thread1of1ForFork4_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork4_j=v_thread2Thread1of1ForFork4_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_j]" "[109] L71-1-->L72: Formula: (< v_thread2Thread1of1ForFork4_j_5 v_N_4) InVars {thread2Thread1of1ForFork4_j=v_thread2Thread1of1ForFork4_j_5, N=v_N_4} OutVars{thread2Thread1of1ForFork4_j=v_thread2Thread1of1ForFork4_j_5, N=v_N_4} AuxVars[] AssignedVars[]" "[112] L72-->L72-2: Formula: (<= (select v_A_4 v_thread2Thread1of1ForFork4_j_9) 0) InVars {A=v_A_4, thread2Thread1of1ForFork4_j=v_thread2Thread1of1ForFork4_j_9} OutVars{A=v_A_4, thread2Thread1of1ForFork4_j=v_thread2Thread1of1ForFork4_j_9} AuxVars[] AssignedVars[]" "[159] L35-->$Ultimate##0: Formula: (and (= v_thread3Thread1of1ForFork5_thidvar0_2 3) (= v_thread3Thread1of1ForFork5_thidvar2_2 3) (= v_thread3Thread1of1ForFork5_thidvar1_2 3)) InVars {} OutVars{thread3Thread1of1ForFork5_thidvar2=v_thread3Thread1of1ForFork5_thidvar2_2, thread3Thread1of1ForFork5_thidvar1=v_thread3Thread1of1ForFork5_thidvar1_2, thread3Thread1of1ForFork5_thidvar0=v_thread3Thread1of1ForFork5_thidvar0_2, thread3Thread1of1ForFork5_k=v_thread3Thread1of1ForFork5_k_14} AuxVars[] AssignedVars[thread3Thread1of1ForFork5_thidvar2, thread3Thread1of1ForFork5_thidvar1, thread3Thread1of1ForFork5_thidvar0, thread3Thread1of1ForFork5_k]" "[118] $Ultimate##0-->L89-1: Formula: (= v_thread3Thread1of1ForFork5_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork5_k=v_thread3Thread1of1ForFork5_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork5_k]" "[120] L89-1-->L90: Formula: (< v_thread3Thread1of1ForFork5_k_5 v_N_5) InVars {N=v_N_5, thread3Thread1of1ForFork5_k=v_thread3Thread1of1ForFork5_k_5} OutVars{N=v_N_5, thread3Thread1of1ForFork5_k=v_thread3Thread1of1ForFork5_k_5} AuxVars[] AssignedVars[]" "[144] L36-->$Ultimate##0: Formula: (and (= 4 v_thread3Thread1of1ForFork0_thidvar1_2) (= 4 v_thread3Thread1of1ForFork0_thidvar0_2) (= 4 v_thread3Thread1of1ForFork0_thidvar2_2) (= 4 v_thread3Thread1of1ForFork0_thidvar3_2)) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_14, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_2, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k, thread3Thread1of1ForFork0_thidvar3, thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0]" "[124] $Ultimate##0-->L89-1: Formula: (= v_thread3Thread1of1ForFork0_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k]" "[126] L89-1-->L90: Formula: (< v_thread3Thread1of1ForFork0_k_5 v_N_5) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} AuxVars[] AssignedVars[]" "[147] L37-->$Ultimate##0: Formula: (and (= 5 v_thread3Thread1of1ForFork1_thidvar1_2) (= 5 v_thread3Thread1of1ForFork1_thidvar2_2) (= 5 v_thread3Thread1of1ForFork1_thidvar3_2) (= 5 v_thread3Thread1of1ForFork1_thidvar0_2) (= 5 v_thread3Thread1of1ForFork1_thidvar4_2)) InVars {} OutVars{thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_14, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_2, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_2, thread3Thread1of1ForFork1_thidvar4=v_thread3Thread1of1ForFork1_thidvar4_2, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_2, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_k, thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_thidvar3, thread3Thread1of1ForFork1_thidvar4, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2]" "[136] $Ultimate##0-->L89-1: Formula: (= v_thread3Thread1of1ForFork1_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_k]" [2025-04-26 16:54:23,079 INFO L754 eck$LassoCheckResult]: Loop: "[138] L89-1-->L90: Formula: (< v_thread3Thread1of1ForFork1_k_5 v_N_5) InVars {N=v_N_5, thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_5} OutVars{N=v_N_5, thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_5} AuxVars[] AssignedVars[]" "[140] L90-->L91: Formula: (= v_B_3 (store v_B_4 v_thread3Thread1of1ForFork1_k_7 v_thread3Thread1of1ForFork1_k_7)) InVars {thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_7, B=v_B_4} OutVars{thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_7, B=v_B_3} AuxVars[] AssignedVars[B]" "[141] L91-->L89-1: Formula: (= (+ v_thread3Thread1of1ForFork1_k_9 1) v_thread3Thread1of1ForFork1_k_10) InVars {thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_9} OutVars{thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_10} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_k]" [2025-04-26 16:54:23,079 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:23,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1020567077, now seen corresponding path program 1 times [2025-04-26 16:54:23,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:23,080 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785456178] [2025-04-26 16:54:23,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:23,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:23,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 16:54:23,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 16:54:23,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:23,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:23,086 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:23,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 16:54:23,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 16:54:23,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:23,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:23,091 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:23,092 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:23,092 INFO L85 PathProgramCache]: Analyzing trace with hash 166890, now seen corresponding path program 1 times [2025-04-26 16:54:23,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:23,092 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173487238] [2025-04-26 16:54:23,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:23,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:23,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:23,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:23,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:23,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:23,098 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:23,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:23,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:23,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:23,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:23,099 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:23,099 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:23,100 INFO L85 PathProgramCache]: Analyzing trace with hash -359560378, now seen corresponding path program 1 times [2025-04-26 16:54:23,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:23,100 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012356721] [2025-04-26 16:54:23,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:23,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:23,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-26 16:54:23,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 16:54:23,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:23,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:23,109 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:23,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-26 16:54:23,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 16:54:23,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:23,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:23,115 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:23,363 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:23,363 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:23,363 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:23,363 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:23,363 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:23,363 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:23,363 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:23,363 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:23,363 INFO L132 ssoRankerPreferences]: Filename of dumped script: map-aggr-update1-4modifiers.bpl_petrified1_Iteration8_Lasso [2025-04-26 16:54:23,363 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:23,363 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:23,364 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:23,368 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:23,369 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:23,371 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:23,373 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:23,387 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:23,388 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:23,392 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:23,394 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:23,396 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:23,398 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:23,400 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:23,403 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:23,405 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:23,407 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:23,409 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:23,411 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:23,413 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:23,423 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:23,426 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:23,428 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:23,431 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:23,584 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:23,584 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:23,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:23,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:23,586 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:23,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-04-26 16:54:23,588 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:23,600 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:23,601 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:23,601 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:23,601 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:23,602 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:23,602 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:23,605 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:23,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2025-04-26 16:54:23,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:23,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:23,612 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:23,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-04-26 16:54:23,614 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:23,623 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:23,624 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:23,624 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:23,624 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:23,625 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:23,625 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:23,627 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:23,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2025-04-26 16:54:23,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:23,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:23,634 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:23,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-04-26 16:54:23,636 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:23,645 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:23,645 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:23,645 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:23,645 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:23,650 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:23,650 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:23,652 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:23,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2025-04-26 16:54:23,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:23,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:23,659 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:23,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-04-26 16:54:23,661 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:23,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:23,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:23,670 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:23,670 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:23,671 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:23,671 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:23,673 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:23,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:23,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:23,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:23,680 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:23,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-04-26 16:54:23,766 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:23,775 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:23,775 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:23,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:23,775 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:23,776 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:23,776 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:23,778 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:23,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2025-04-26 16:54:23,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:23,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:23,785 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:23,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-04-26 16:54:23,786 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:23,795 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:23,795 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:23,795 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:23,795 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:23,796 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:23,796 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:23,798 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:23,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:23,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:23,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:23,806 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:23,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-04-26 16:54:23,807 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:23,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:23,817 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:23,817 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:23,817 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:23,818 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:23,818 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:23,820 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:23,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2025-04-26 16:54:23,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:23,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:23,827 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:23,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-04-26 16:54:23,829 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:23,838 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:23,839 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:23,839 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:23,839 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:23,841 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:23,841 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:23,843 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:23,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2025-04-26 16:54:23,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:23,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:23,851 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:23,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-04-26 16:54:23,852 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:23,862 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:23,863 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:23,863 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:23,863 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:23,864 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:23,864 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:23,866 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:23,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:23,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:23,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:23,873 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:23,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-04-26 16:54:23,874 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:23,884 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:23,884 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:23,884 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:23,884 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:23,885 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:23,885 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:23,887 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:23,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2025-04-26 16:54:23,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:23,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:23,894 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:23,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-04-26 16:54:23,895 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:23,905 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:23,905 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:23,905 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:23,905 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:23,906 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:23,906 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:23,908 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:23,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2025-04-26 16:54:23,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:23,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:23,915 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:23,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2025-04-26 16:54:23,917 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:23,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:23,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:23,927 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:23,927 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:23,927 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:23,927 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:23,929 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:23,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:23,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:23,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:23,936 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:23,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2025-04-26 16:54:23,938 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:23,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:23,947 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:23,947 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:23,947 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:23,948 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:23,948 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:23,950 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:23,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2025-04-26 16:54:23,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:23,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:23,957 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:23,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2025-04-26 16:54:23,958 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:23,968 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:23,968 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:23,968 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:23,968 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:23,969 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:23,969 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:23,971 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:23,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2025-04-26 16:54:23,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:23,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:23,978 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:23,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2025-04-26 16:54:23,980 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:23,989 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:23,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:23,990 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:23,990 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:23,990 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:23,990 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:23,992 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:23,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2025-04-26 16:54:23,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:23,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:23,999 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:24,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2025-04-26 16:54:24,000 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:24,010 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:24,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:24,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:24,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:24,011 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:24,011 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:24,014 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:24,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2025-04-26 16:54:24,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:24,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:24,021 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:24,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2025-04-26 16:54:24,022 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:24,032 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:24,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:24,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:24,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:24,033 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:24,033 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:24,035 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:24,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2025-04-26 16:54:24,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:24,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:24,041 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:24,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2025-04-26 16:54:24,043 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:24,053 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:24,053 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:54:24,053 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:24,053 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:24,053 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:24,053 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:54:24,054 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:54:24,054 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:24,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2025-04-26 16:54:24,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:24,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:24,061 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:24,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2025-04-26 16:54:24,063 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:24,072 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:24,073 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:24,073 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:24,073 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:24,074 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:24,074 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:24,078 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:24,084 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:54:24,085 INFO L437 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 16:54:24,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:24,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:24,086 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:24,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2025-04-26 16:54:24,088 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:24,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2025-04-26 16:54:24,103 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:54:24,103 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:24,103 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread3Thread1of1ForFork1_k, N) = -1*thread3Thread1of1ForFork1_k + 1*N Supporting invariants [] [2025-04-26 16:54:24,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2025-04-26 16:54:24,110 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:54:24,117 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:24,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 16:54:24,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 16:54:24,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:24,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:24,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:54:24,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:24,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:24,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:24,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:24,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:24,156 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:54:24,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:24,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:24,167 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 16:54:24,167 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 153839 states and 362701 transitions. cyclomatic complexity: 212997 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (in total 24), 3 states have internal predecessors, (24), 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 16:54:26,265 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 153839 states and 362701 transitions. cyclomatic complexity: 212997. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (in total 24), 3 states have internal predecessors, (24), 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 319310 states and 739556 transitions. Complement of second has 6 states. [2025-04-26 16:54:26,265 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 16:54:26,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (in total 24), 3 states have internal predecessors, (24), 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 16:54:26,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2025-04-26 16:54:26,266 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 144 transitions. Stem has 21 letters. Loop has 3 letters. [2025-04-26 16:54:26,266 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:26,266 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 144 transitions. Stem has 24 letters. Loop has 3 letters. [2025-04-26 16:54:26,266 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:26,266 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 144 transitions. Stem has 21 letters. Loop has 6 letters. [2025-04-26 16:54:26,266 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:26,266 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 319310 states and 739556 transitions. [2025-04-26 16:54:29,126 INFO L131 ngComponentsAnalysis]: Automaton has 201 accepting balls. 603 [2025-04-26 16:54:30,591 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 319310 states to 188598 states and 428633 transitions. [2025-04-26 16:54:30,591 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42045 [2025-04-26 16:54:30,698 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42692 [2025-04-26 16:54:30,698 INFO L74 IsDeterministic]: Start isDeterministic. Operand 188598 states and 428633 transitions. [2025-04-26 16:54:30,698 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:30,698 INFO L218 hiAutomatonCegarLoop]: Abstraction has 188598 states and 428633 transitions. [2025-04-26 16:54:31,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188598 states and 428633 transitions. [2025-04-26 16:54:33,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188598 to 185436. [2025-04-26 16:54:33,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185436 states, 185436 states have (on average 2.2862766668823746) internal successors, (in total 423958), 185435 states have internal predecessors, (423958), 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 16:54:34,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185436 states to 185436 states and 423958 transitions. [2025-04-26 16:54:34,883 INFO L240 hiAutomatonCegarLoop]: Abstraction has 185436 states and 423958 transitions. [2025-04-26 16:54:34,883 INFO L438 stractBuchiCegarLoop]: Abstraction has 185436 states and 423958 transitions. [2025-04-26 16:54:34,883 INFO L340 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-04-26 16:54:34,883 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 185436 states and 423958 transitions. [2025-04-26 16:54:35,838 INFO L131 ngComponentsAnalysis]: Automaton has 201 accepting balls. 603 [2025-04-26 16:54:35,838 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:35,838 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:35,839 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:35,839 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:54:35,840 INFO L752 eck$LassoCheckResult]: Stem: "[94] $Ultimate##0-->L34: Formula: (and (<= 0 v_ULTIMATE.start_m_1) (< v_ULTIMATE.start_m_1 v_N_7)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} AuxVars[] AssignedVars[]" "[153] L34-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork3_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork3_thidvar0=v_thread1Thread1of1ForFork3_thidvar0_2, thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_thidvar0, thread1Thread1of1ForFork3_i]" "[100] $Ultimate##0-->L57-1: Formula: (= v_thread1Thread1of1ForFork3_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_i]" "[102] L57-1-->L58: Formula: (< v_thread1Thread1of1ForFork3_i_5 v_N_1) InVars {thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_5, N=v_N_1} AuxVars[] AssignedVars[]" "[104] L58-->L59: Formula: (= (store v_A_2 v_thread1Thread1of1ForFork3_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork3_i_7))) (ite (< .cse0 0) 0 .cse0))) v_A_1) InVars {A=v_A_2, thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_7} AuxVars[] AssignedVars[A]" "[105] L59-->L57-1: Formula: (= v_thread1Thread1of1ForFork3_i_10 (+ v_thread1Thread1of1ForFork3_i_9 1)) InVars {thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_9} OutVars{thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_i]" "[101] L57-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork3_i_3) InVars {thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_3, N=v_N_2} OutVars{thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_3, N=v_N_2} AuxVars[] AssignedVars[]" "[103] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[156] L34-1-->$Ultimate##0: Formula: (and (= v_thread2Thread1of1ForFork4_thidvar0_2 2) (= v_thread2Thread1of1ForFork4_thidvar1_2 2)) InVars {} OutVars{thread2Thread1of1ForFork4_cnt=v_thread2Thread1of1ForFork4_cnt_12, thread2Thread1of1ForFork4_j=v_thread2Thread1of1ForFork4_j_20, thread2Thread1of1ForFork4_thidvar0=v_thread2Thread1of1ForFork4_thidvar0_2, thread2Thread1of1ForFork4_thidvar1=v_thread2Thread1of1ForFork4_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_cnt, thread2Thread1of1ForFork4_j, thread2Thread1of1ForFork4_thidvar0, thread2Thread1of1ForFork4_thidvar1]" "[106] $Ultimate##0-->L70: Formula: (= v_thread2Thread1of1ForFork4_cnt_1 0) InVars {} OutVars{thread2Thread1of1ForFork4_cnt=v_thread2Thread1of1ForFork4_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_cnt]" "[107] L70-->L71-1: Formula: (= v_thread2Thread1of1ForFork4_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork4_j=v_thread2Thread1of1ForFork4_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_j]" "[109] L71-1-->L72: Formula: (< v_thread2Thread1of1ForFork4_j_5 v_N_4) InVars {thread2Thread1of1ForFork4_j=v_thread2Thread1of1ForFork4_j_5, N=v_N_4} OutVars{thread2Thread1of1ForFork4_j=v_thread2Thread1of1ForFork4_j_5, N=v_N_4} AuxVars[] AssignedVars[]" "[112] L72-->L72-2: Formula: (<= (select v_A_4 v_thread2Thread1of1ForFork4_j_9) 0) InVars {A=v_A_4, thread2Thread1of1ForFork4_j=v_thread2Thread1of1ForFork4_j_9} OutVars{A=v_A_4, thread2Thread1of1ForFork4_j=v_thread2Thread1of1ForFork4_j_9} AuxVars[] AssignedVars[]" "[159] L35-->$Ultimate##0: Formula: (and (= v_thread3Thread1of1ForFork5_thidvar0_2 3) (= v_thread3Thread1of1ForFork5_thidvar2_2 3) (= v_thread3Thread1of1ForFork5_thidvar1_2 3)) InVars {} OutVars{thread3Thread1of1ForFork5_thidvar2=v_thread3Thread1of1ForFork5_thidvar2_2, thread3Thread1of1ForFork5_thidvar1=v_thread3Thread1of1ForFork5_thidvar1_2, thread3Thread1of1ForFork5_thidvar0=v_thread3Thread1of1ForFork5_thidvar0_2, thread3Thread1of1ForFork5_k=v_thread3Thread1of1ForFork5_k_14} AuxVars[] AssignedVars[thread3Thread1of1ForFork5_thidvar2, thread3Thread1of1ForFork5_thidvar1, thread3Thread1of1ForFork5_thidvar0, thread3Thread1of1ForFork5_k]" "[118] $Ultimate##0-->L89-1: Formula: (= v_thread3Thread1of1ForFork5_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork5_k=v_thread3Thread1of1ForFork5_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork5_k]" "[120] L89-1-->L90: Formula: (< v_thread3Thread1of1ForFork5_k_5 v_N_5) InVars {N=v_N_5, thread3Thread1of1ForFork5_k=v_thread3Thread1of1ForFork5_k_5} OutVars{N=v_N_5, thread3Thread1of1ForFork5_k=v_thread3Thread1of1ForFork5_k_5} AuxVars[] AssignedVars[]" "[144] L36-->$Ultimate##0: Formula: (and (= 4 v_thread3Thread1of1ForFork0_thidvar1_2) (= 4 v_thread3Thread1of1ForFork0_thidvar0_2) (= 4 v_thread3Thread1of1ForFork0_thidvar2_2) (= 4 v_thread3Thread1of1ForFork0_thidvar3_2)) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_14, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_2, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k, thread3Thread1of1ForFork0_thidvar3, thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0]" "[124] $Ultimate##0-->L89-1: Formula: (= v_thread3Thread1of1ForFork0_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k]" "[126] L89-1-->L90: Formula: (< v_thread3Thread1of1ForFork0_k_5 v_N_5) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} AuxVars[] AssignedVars[]" "[147] L37-->$Ultimate##0: Formula: (and (= 5 v_thread3Thread1of1ForFork1_thidvar1_2) (= 5 v_thread3Thread1of1ForFork1_thidvar2_2) (= 5 v_thread3Thread1of1ForFork1_thidvar3_2) (= 5 v_thread3Thread1of1ForFork1_thidvar0_2) (= 5 v_thread3Thread1of1ForFork1_thidvar4_2)) InVars {} OutVars{thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_14, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_2, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_2, thread3Thread1of1ForFork1_thidvar4=v_thread3Thread1of1ForFork1_thidvar4_2, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_2, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_k, thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_thidvar3, thread3Thread1of1ForFork1_thidvar4, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2]" "[136] $Ultimate##0-->L89-1: Formula: (= v_thread3Thread1of1ForFork1_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_k]" "[138] L89-1-->L90: Formula: (< v_thread3Thread1of1ForFork1_k_5 v_N_5) InVars {N=v_N_5, thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_5} OutVars{N=v_N_5, thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_5} AuxVars[] AssignedVars[]" "[150] L38-->$Ultimate##0: Formula: (and (= 6 v_thread3Thread1of1ForFork2_thidvar2_2) (= 6 v_thread3Thread1of1ForFork2_thidvar0_2) (= 6 v_thread3Thread1of1ForFork2_thidvar4_2) (= 6 v_thread3Thread1of1ForFork2_thidvar5_2) (= 6 v_thread3Thread1of1ForFork2_thidvar1_2) (= 6 v_thread3Thread1of1ForFork2_thidvar3_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_2, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar5=v_thread3Thread1of1ForFork2_thidvar5_2, thread3Thread1of1ForFork2_thidvar4=v_thread3Thread1of1ForFork2_thidvar4_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2, thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_14} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar3, thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar5, thread3Thread1of1ForFork2_thidvar4, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0, thread3Thread1of1ForFork2_k]" "[130] $Ultimate##0-->L89-1: Formula: (= v_thread3Thread1of1ForFork2_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_k]" "[132] L89-1-->L90: Formula: (< v_thread3Thread1of1ForFork2_k_5 v_N_5) InVars {thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_5, N=v_N_5} AuxVars[] AssignedVars[]" "[160] thread1EXIT-->L40: Formula: (= v_thread1Thread1of1ForFork3_thidvar0_4 1) InVars {thread1Thread1of1ForFork3_thidvar0=v_thread1Thread1of1ForFork3_thidvar0_4} OutVars{thread1Thread1of1ForFork3_thidvar0=v_thread1Thread1of1ForFork3_thidvar0_4} AuxVars[] AssignedVars[]" [2025-04-26 16:54:35,840 INFO L754 eck$LassoCheckResult]: Loop: "[134] L90-->L91: Formula: (= v_B_3 (store v_B_4 v_thread3Thread1of1ForFork2_k_7 v_thread3Thread1of1ForFork2_k_7)) InVars {thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_7, B=v_B_4} OutVars{thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_7, B=v_B_3} AuxVars[] AssignedVars[B]" "[135] L91-->L89-1: Formula: (= v_thread3Thread1of1ForFork2_k_10 (+ v_thread3Thread1of1ForFork2_k_9 1)) InVars {thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_9} OutVars{thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_10} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_k]" "[132] L89-1-->L90: Formula: (< v_thread3Thread1of1ForFork2_k_5 v_N_5) InVars {thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_5, N=v_N_5} AuxVars[] AssignedVars[]" [2025-04-26 16:54:35,840 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:35,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1939847987, now seen corresponding path program 1 times [2025-04-26 16:54:35,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:35,840 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884947231] [2025-04-26 16:54:35,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:35,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:35,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 16:54:35,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:54:35,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:35,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:35,846 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:35,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 16:54:35,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:54:35,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:35,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:35,851 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:35,852 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:35,852 INFO L85 PathProgramCache]: Analyzing trace with hash 162882, now seen corresponding path program 1 times [2025-04-26 16:54:35,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:35,852 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816047300] [2025-04-26 16:54:35,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:35,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:35,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:35,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:35,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:35,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:35,858 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:35,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:35,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:35,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:35,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:35,860 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:35,860 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:35,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1226279946, now seen corresponding path program 1 times [2025-04-26 16:54:35,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:35,861 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699958556] [2025-04-26 16:54:35,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:35,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:35,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-26 16:54:35,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-26 16:54:35,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:35,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:35,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:35,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:54:35,934 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699958556] [2025-04-26 16:54:35,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699958556] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 16:54:35,934 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131640638] [2025-04-26 16:54:35,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:35,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 16:54:35,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:35,936 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-26 16:54:35,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2025-04-26 16:54:35,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-26 16:54:35,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-26 16:54:35,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:35,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:35,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-26 16:54:35,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:36,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:36,014 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-26 16:54:36,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:36,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131640638] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-26 16:54:36,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-26 16:54:36,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-04-26 16:54:36,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122037319] [2025-04-26 16:54:36,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-26 16:54:36,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:54:36,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-26 16:54:36,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-04-26 16:54:36,073 INFO L87 Difference]: Start difference. First operand 185436 states and 423958 transitions. cyclomatic complexity: 243584 Second operand has 10 states, 9 states have (on average 4.444444444444445) internal successors, (in total 40), 10 states have internal predecessors, (40), 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 16:54:37,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:54:37,201 INFO L93 Difference]: Finished difference Result 190055 states and 431176 transitions. [2025-04-26 16:54:37,201 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 190055 states and 431176 transitions. [2025-04-26 16:54:39,022 INFO L131 ngComponentsAnalysis]: Automaton has 201 accepting balls. 603 [2025-04-26 16:54:40,376 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 190055 states to 185454 states and 423982 transitions. [2025-04-26 16:54:40,376 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41894 [2025-04-26 16:54:40,457 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41894 [2025-04-26 16:54:40,457 INFO L74 IsDeterministic]: Start isDeterministic. Operand 185454 states and 423982 transitions. [2025-04-26 16:54:40,457 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:40,457 INFO L218 hiAutomatonCegarLoop]: Abstraction has 185454 states and 423982 transitions. [2025-04-26 16:54:40,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185454 states and 423982 transitions. [2025-04-26 16:54:43,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185454 to 185442. [2025-04-26 16:54:43,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185442 states, 185442 states have (on average 2.2862404417553734) internal successors, (in total 423965), 185441 states have internal predecessors, (423965), 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 16:54:44,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185442 states to 185442 states and 423965 transitions. [2025-04-26 16:54:44,445 INFO L240 hiAutomatonCegarLoop]: Abstraction has 185442 states and 423965 transitions. [2025-04-26 16:54:44,446 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-26 16:54:44,446 INFO L438 stractBuchiCegarLoop]: Abstraction has 185442 states and 423965 transitions. [2025-04-26 16:54:44,446 INFO L340 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-04-26 16:54:44,446 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 185442 states and 423965 transitions. [2025-04-26 16:54:45,521 INFO L131 ngComponentsAnalysis]: Automaton has 201 accepting balls. 603 [2025-04-26 16:54:45,521 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:45,521 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:45,523 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:45,523 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:54:45,523 INFO L752 eck$LassoCheckResult]: Stem: "[94] $Ultimate##0-->L34: Formula: (and (<= 0 v_ULTIMATE.start_m_1) (< v_ULTIMATE.start_m_1 v_N_7)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} AuxVars[] AssignedVars[]" "[153] L34-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork3_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork3_thidvar0=v_thread1Thread1of1ForFork3_thidvar0_2, thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_thidvar0, thread1Thread1of1ForFork3_i]" "[100] $Ultimate##0-->L57-1: Formula: (= v_thread1Thread1of1ForFork3_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_i]" "[102] L57-1-->L58: Formula: (< v_thread1Thread1of1ForFork3_i_5 v_N_1) InVars {thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_5, N=v_N_1} AuxVars[] AssignedVars[]" "[104] L58-->L59: Formula: (= (store v_A_2 v_thread1Thread1of1ForFork3_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork3_i_7))) (ite (< .cse0 0) 0 .cse0))) v_A_1) InVars {A=v_A_2, thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_7} AuxVars[] AssignedVars[A]" "[105] L59-->L57-1: Formula: (= v_thread1Thread1of1ForFork3_i_10 (+ v_thread1Thread1of1ForFork3_i_9 1)) InVars {thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_9} OutVars{thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_i]" "[102] L57-1-->L58: Formula: (< v_thread1Thread1of1ForFork3_i_5 v_N_1) InVars {thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_5, N=v_N_1} AuxVars[] AssignedVars[]" "[104] L58-->L59: Formula: (= (store v_A_2 v_thread1Thread1of1ForFork3_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork3_i_7))) (ite (< .cse0 0) 0 .cse0))) v_A_1) InVars {A=v_A_2, thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_7} AuxVars[] AssignedVars[A]" "[105] L59-->L57-1: Formula: (= v_thread1Thread1of1ForFork3_i_10 (+ v_thread1Thread1of1ForFork3_i_9 1)) InVars {thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_9} OutVars{thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_i]" "[101] L57-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork3_i_3) InVars {thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_3, N=v_N_2} OutVars{thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_3, N=v_N_2} AuxVars[] AssignedVars[]" "[103] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[156] L34-1-->$Ultimate##0: Formula: (and (= v_thread2Thread1of1ForFork4_thidvar0_2 2) (= v_thread2Thread1of1ForFork4_thidvar1_2 2)) InVars {} OutVars{thread2Thread1of1ForFork4_cnt=v_thread2Thread1of1ForFork4_cnt_12, thread2Thread1of1ForFork4_j=v_thread2Thread1of1ForFork4_j_20, thread2Thread1of1ForFork4_thidvar0=v_thread2Thread1of1ForFork4_thidvar0_2, thread2Thread1of1ForFork4_thidvar1=v_thread2Thread1of1ForFork4_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_cnt, thread2Thread1of1ForFork4_j, thread2Thread1of1ForFork4_thidvar0, thread2Thread1of1ForFork4_thidvar1]" "[106] $Ultimate##0-->L70: Formula: (= v_thread2Thread1of1ForFork4_cnt_1 0) InVars {} OutVars{thread2Thread1of1ForFork4_cnt=v_thread2Thread1of1ForFork4_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_cnt]" "[107] L70-->L71-1: Formula: (= v_thread2Thread1of1ForFork4_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork4_j=v_thread2Thread1of1ForFork4_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_j]" "[109] L71-1-->L72: Formula: (< v_thread2Thread1of1ForFork4_j_5 v_N_4) InVars {thread2Thread1of1ForFork4_j=v_thread2Thread1of1ForFork4_j_5, N=v_N_4} OutVars{thread2Thread1of1ForFork4_j=v_thread2Thread1of1ForFork4_j_5, N=v_N_4} AuxVars[] AssignedVars[]" "[112] L72-->L72-2: Formula: (<= (select v_A_4 v_thread2Thread1of1ForFork4_j_9) 0) InVars {A=v_A_4, thread2Thread1of1ForFork4_j=v_thread2Thread1of1ForFork4_j_9} OutVars{A=v_A_4, thread2Thread1of1ForFork4_j=v_thread2Thread1of1ForFork4_j_9} AuxVars[] AssignedVars[]" "[159] L35-->$Ultimate##0: Formula: (and (= v_thread3Thread1of1ForFork5_thidvar0_2 3) (= v_thread3Thread1of1ForFork5_thidvar2_2 3) (= v_thread3Thread1of1ForFork5_thidvar1_2 3)) InVars {} OutVars{thread3Thread1of1ForFork5_thidvar2=v_thread3Thread1of1ForFork5_thidvar2_2, thread3Thread1of1ForFork5_thidvar1=v_thread3Thread1of1ForFork5_thidvar1_2, thread3Thread1of1ForFork5_thidvar0=v_thread3Thread1of1ForFork5_thidvar0_2, thread3Thread1of1ForFork5_k=v_thread3Thread1of1ForFork5_k_14} AuxVars[] AssignedVars[thread3Thread1of1ForFork5_thidvar2, thread3Thread1of1ForFork5_thidvar1, thread3Thread1of1ForFork5_thidvar0, thread3Thread1of1ForFork5_k]" "[118] $Ultimate##0-->L89-1: Formula: (= v_thread3Thread1of1ForFork5_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork5_k=v_thread3Thread1of1ForFork5_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork5_k]" "[120] L89-1-->L90: Formula: (< v_thread3Thread1of1ForFork5_k_5 v_N_5) InVars {N=v_N_5, thread3Thread1of1ForFork5_k=v_thread3Thread1of1ForFork5_k_5} OutVars{N=v_N_5, thread3Thread1of1ForFork5_k=v_thread3Thread1of1ForFork5_k_5} AuxVars[] AssignedVars[]" "[144] L36-->$Ultimate##0: Formula: (and (= 4 v_thread3Thread1of1ForFork0_thidvar1_2) (= 4 v_thread3Thread1of1ForFork0_thidvar0_2) (= 4 v_thread3Thread1of1ForFork0_thidvar2_2) (= 4 v_thread3Thread1of1ForFork0_thidvar3_2)) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_14, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_2, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k, thread3Thread1of1ForFork0_thidvar3, thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0]" "[124] $Ultimate##0-->L89-1: Formula: (= v_thread3Thread1of1ForFork0_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k]" "[126] L89-1-->L90: Formula: (< v_thread3Thread1of1ForFork0_k_5 v_N_5) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} AuxVars[] AssignedVars[]" "[147] L37-->$Ultimate##0: Formula: (and (= 5 v_thread3Thread1of1ForFork1_thidvar1_2) (= 5 v_thread3Thread1of1ForFork1_thidvar2_2) (= 5 v_thread3Thread1of1ForFork1_thidvar3_2) (= 5 v_thread3Thread1of1ForFork1_thidvar0_2) (= 5 v_thread3Thread1of1ForFork1_thidvar4_2)) InVars {} OutVars{thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_14, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_2, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_2, thread3Thread1of1ForFork1_thidvar4=v_thread3Thread1of1ForFork1_thidvar4_2, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_2, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_k, thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_thidvar3, thread3Thread1of1ForFork1_thidvar4, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2]" "[136] $Ultimate##0-->L89-1: Formula: (= v_thread3Thread1of1ForFork1_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_k]" "[138] L89-1-->L90: Formula: (< v_thread3Thread1of1ForFork1_k_5 v_N_5) InVars {N=v_N_5, thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_5} OutVars{N=v_N_5, thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_5} AuxVars[] AssignedVars[]" "[150] L38-->$Ultimate##0: Formula: (and (= 6 v_thread3Thread1of1ForFork2_thidvar2_2) (= 6 v_thread3Thread1of1ForFork2_thidvar0_2) (= 6 v_thread3Thread1of1ForFork2_thidvar4_2) (= 6 v_thread3Thread1of1ForFork2_thidvar5_2) (= 6 v_thread3Thread1of1ForFork2_thidvar1_2) (= 6 v_thread3Thread1of1ForFork2_thidvar3_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_2, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar5=v_thread3Thread1of1ForFork2_thidvar5_2, thread3Thread1of1ForFork2_thidvar4=v_thread3Thread1of1ForFork2_thidvar4_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2, thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_14} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar3, thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar5, thread3Thread1of1ForFork2_thidvar4, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0, thread3Thread1of1ForFork2_k]" "[130] $Ultimate##0-->L89-1: Formula: (= v_thread3Thread1of1ForFork2_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_k]" "[132] L89-1-->L90: Formula: (< v_thread3Thread1of1ForFork2_k_5 v_N_5) InVars {thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_5, N=v_N_5} AuxVars[] AssignedVars[]" "[160] thread1EXIT-->L40: Formula: (= v_thread1Thread1of1ForFork3_thidvar0_4 1) InVars {thread1Thread1of1ForFork3_thidvar0=v_thread1Thread1of1ForFork3_thidvar0_4} OutVars{thread1Thread1of1ForFork3_thidvar0=v_thread1Thread1of1ForFork3_thidvar0_4} AuxVars[] AssignedVars[]" [2025-04-26 16:54:45,523 INFO L754 eck$LassoCheckResult]: Loop: "[134] L90-->L91: Formula: (= v_B_3 (store v_B_4 v_thread3Thread1of1ForFork2_k_7 v_thread3Thread1of1ForFork2_k_7)) InVars {thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_7, B=v_B_4} OutVars{thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_7, B=v_B_3} AuxVars[] AssignedVars[B]" "[135] L91-->L89-1: Formula: (= v_thread3Thread1of1ForFork2_k_10 (+ v_thread3Thread1of1ForFork2_k_9 1)) InVars {thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_9} OutVars{thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_10} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_k]" "[132] L89-1-->L90: Formula: (< v_thread3Thread1of1ForFork2_k_5 v_N_5) InVars {thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_5, N=v_N_5} AuxVars[] AssignedVars[]" [2025-04-26 16:54:45,523 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:45,523 INFO L85 PathProgramCache]: Analyzing trace with hash 2101174358, now seen corresponding path program 2 times [2025-04-26 16:54:45,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:45,523 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981031284] [2025-04-26 16:54:45,524 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:54:45,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:45,526 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-26 16:54:45,529 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-26 16:54:45,529 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:54:45,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:45,529 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:45,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-26 16:54:45,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-26 16:54:45,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:45,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:45,539 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:45,540 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:45,540 INFO L85 PathProgramCache]: Analyzing trace with hash 162882, now seen corresponding path program 2 times [2025-04-26 16:54:45,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:45,540 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501182715] [2025-04-26 16:54:45,540 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:54:45,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:45,542 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:45,543 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:45,543 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:54:45,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:45,544 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:45,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:45,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:45,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:45,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:45,545 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:45,546 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:45,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1232060365, now seen corresponding path program 2 times [2025-04-26 16:54:45,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:45,546 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535437303] [2025-04-26 16:54:45,546 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:54:45,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:45,548 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-04-26 16:54:45,551 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-26 16:54:45,551 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:54:45,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:45,552 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:45,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-26 16:54:45,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-26 16:54:45,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:45,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:45,558 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:45,977 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:45,977 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:45,977 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:45,977 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:45,977 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:45,977 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:45,977 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:45,977 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:45,977 INFO L132 ssoRankerPreferences]: Filename of dumped script: map-aggr-update1-4modifiers.bpl_petrified1_Iteration10_Lasso [2025-04-26 16:54:45,977 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:45,977 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:45,979 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:45,985 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:45,992 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:45,994 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:45,995 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:45,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:45,998 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:46,000 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:46,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:46,003 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:46,004 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:46,005 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:46,007 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:46,008 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:46,010 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:46,011 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:46,012 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:46,014 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:46,015 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:46,017 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:46,018 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:46,019 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:46,022 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:46,023 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:46,025 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:46,026 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:46,028 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:46,086 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:46,087 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:46,089 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:46,422 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:46,422 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:46,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:46,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:46,424 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:46,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2025-04-26 16:54:46,432 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:46,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:46,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:46,442 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:46,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:46,443 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:46,443 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:46,446 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:46,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:46,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:46,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:46,452 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:46,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2025-04-26 16:54:46,454 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:46,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:46,464 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:46,464 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:46,464 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:46,465 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:46,465 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:46,469 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:46,476 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:54:46,476 INFO L437 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 16:54:46,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:46,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:46,478 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:46,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2025-04-26 16:54:46,480 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:46,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:46,495 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:54:46,496 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:46,496 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, thread3Thread1of1ForFork2_k) = 1*N - 1*thread3Thread1of1ForFork2_k Supporting invariants [] [2025-04-26 16:54:46,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:46,502 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:54:46,511 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:46,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-26 16:54:46,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-26 16:54:46,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:46,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:46,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:54:46,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:46,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:46,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:46,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:46,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:46,559 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:54:46,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:46,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:46,568 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 16:54:46,569 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 185442 states and 423965 transitions. cyclomatic complexity: 243585 Second operand has 4 states, 4 states have (on average 7.25) internal successors, (in total 29), 4 states have internal predecessors, (29), 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 16:54:47,867 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 185442 states and 423965 transitions. cyclomatic complexity: 243585. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (in total 29), 4 states have internal predecessors, (29), 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 189554 states and 431657 transitions. Complement of second has 6 states. [2025-04-26 16:54:47,868 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 16:54:47,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (in total 29), 4 states have internal predecessors, (29), 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 16:54:47,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2025-04-26 16:54:47,869 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 120 transitions. Stem has 29 letters. Loop has 3 letters. [2025-04-26 16:54:47,869 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:47,869 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 120 transitions. Stem has 32 letters. Loop has 3 letters. [2025-04-26 16:54:47,869 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:47,869 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 120 transitions. Stem has 29 letters. Loop has 6 letters. [2025-04-26 16:54:47,869 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:47,869 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 189554 states and 431657 transitions. [2025-04-26 16:54:49,708 INFO L131 ngComponentsAnalysis]: Automaton has 120 accepting balls. 360 [2025-04-26 16:54:50,869 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 189554 states to 172935 states and 393477 transitions. [2025-04-26 16:54:50,869 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36623 [2025-04-26 16:54:50,945 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36807 [2025-04-26 16:54:50,945 INFO L74 IsDeterministic]: Start isDeterministic. Operand 172935 states and 393477 transitions. [2025-04-26 16:54:50,945 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:50,945 INFO L218 hiAutomatonCegarLoop]: Abstraction has 172935 states and 393477 transitions. [2025-04-26 16:54:51,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172935 states and 393477 transitions. [2025-04-26 16:54:53,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172935 to 171152. [2025-04-26 16:54:53,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171152 states, 171152 states have (on average 2.2885271571468637) internal successors, (in total 391686), 171151 states have internal predecessors, (391686), 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 16:54:54,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171152 states to 171152 states and 391686 transitions. [2025-04-26 16:54:54,621 INFO L240 hiAutomatonCegarLoop]: Abstraction has 171152 states and 391686 transitions. [2025-04-26 16:54:54,621 INFO L438 stractBuchiCegarLoop]: Abstraction has 171152 states and 391686 transitions. [2025-04-26 16:54:54,621 INFO L340 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-04-26 16:54:54,621 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 171152 states and 391686 transitions. [2025-04-26 16:54:55,683 INFO L131 ngComponentsAnalysis]: Automaton has 120 accepting balls. 360 [2025-04-26 16:54:55,683 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:55,683 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:55,684 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:55,684 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:54:55,684 INFO L752 eck$LassoCheckResult]: Stem: "[94] $Ultimate##0-->L34: Formula: (and (<= 0 v_ULTIMATE.start_m_1) (< v_ULTIMATE.start_m_1 v_N_7)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_1, N=v_N_7} AuxVars[] AssignedVars[]" "[153] L34-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork3_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork3_thidvar0=v_thread1Thread1of1ForFork3_thidvar0_2, thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_thidvar0, thread1Thread1of1ForFork3_i]" "[100] $Ultimate##0-->L57-1: Formula: (= v_thread1Thread1of1ForFork3_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_i]" "[102] L57-1-->L58: Formula: (< v_thread1Thread1of1ForFork3_i_5 v_N_1) InVars {thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_5, N=v_N_1} AuxVars[] AssignedVars[]" "[104] L58-->L59: Formula: (= (store v_A_2 v_thread1Thread1of1ForFork3_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork3_i_7))) (ite (< .cse0 0) 0 .cse0))) v_A_1) InVars {A=v_A_2, thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_7} AuxVars[] AssignedVars[A]" "[156] L34-1-->$Ultimate##0: Formula: (and (= v_thread2Thread1of1ForFork4_thidvar0_2 2) (= v_thread2Thread1of1ForFork4_thidvar1_2 2)) InVars {} OutVars{thread2Thread1of1ForFork4_cnt=v_thread2Thread1of1ForFork4_cnt_12, thread2Thread1of1ForFork4_j=v_thread2Thread1of1ForFork4_j_20, thread2Thread1of1ForFork4_thidvar0=v_thread2Thread1of1ForFork4_thidvar0_2, thread2Thread1of1ForFork4_thidvar1=v_thread2Thread1of1ForFork4_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_cnt, thread2Thread1of1ForFork4_j, thread2Thread1of1ForFork4_thidvar0, thread2Thread1of1ForFork4_thidvar1]" "[106] $Ultimate##0-->L70: Formula: (= v_thread2Thread1of1ForFork4_cnt_1 0) InVars {} OutVars{thread2Thread1of1ForFork4_cnt=v_thread2Thread1of1ForFork4_cnt_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_cnt]" "[105] L59-->L57-1: Formula: (= v_thread1Thread1of1ForFork3_i_10 (+ v_thread1Thread1of1ForFork3_i_9 1)) InVars {thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_9} OutVars{thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_i]" "[102] L57-1-->L58: Formula: (< v_thread1Thread1of1ForFork3_i_5 v_N_1) InVars {thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_5, N=v_N_1} AuxVars[] AssignedVars[]" "[159] L35-->$Ultimate##0: Formula: (and (= v_thread3Thread1of1ForFork5_thidvar0_2 3) (= v_thread3Thread1of1ForFork5_thidvar2_2 3) (= v_thread3Thread1of1ForFork5_thidvar1_2 3)) InVars {} OutVars{thread3Thread1of1ForFork5_thidvar2=v_thread3Thread1of1ForFork5_thidvar2_2, thread3Thread1of1ForFork5_thidvar1=v_thread3Thread1of1ForFork5_thidvar1_2, thread3Thread1of1ForFork5_thidvar0=v_thread3Thread1of1ForFork5_thidvar0_2, thread3Thread1of1ForFork5_k=v_thread3Thread1of1ForFork5_k_14} AuxVars[] AssignedVars[thread3Thread1of1ForFork5_thidvar2, thread3Thread1of1ForFork5_thidvar1, thread3Thread1of1ForFork5_thidvar0, thread3Thread1of1ForFork5_k]" "[118] $Ultimate##0-->L89-1: Formula: (= v_thread3Thread1of1ForFork5_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork5_k=v_thread3Thread1of1ForFork5_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork5_k]" "[104] L58-->L59: Formula: (= (store v_A_2 v_thread1Thread1of1ForFork3_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork3_i_7))) (ite (< .cse0 0) 0 .cse0))) v_A_1) InVars {A=v_A_2, thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_7} AuxVars[] AssignedVars[A]" "[105] L59-->L57-1: Formula: (= v_thread1Thread1of1ForFork3_i_10 (+ v_thread1Thread1of1ForFork3_i_9 1)) InVars {thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_9} OutVars{thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_i]" "[144] L36-->$Ultimate##0: Formula: (and (= 4 v_thread3Thread1of1ForFork0_thidvar1_2) (= 4 v_thread3Thread1of1ForFork0_thidvar0_2) (= 4 v_thread3Thread1of1ForFork0_thidvar2_2) (= 4 v_thread3Thread1of1ForFork0_thidvar3_2)) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_14, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_2, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k, thread3Thread1of1ForFork0_thidvar3, thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0]" "[124] $Ultimate##0-->L89-1: Formula: (= v_thread3Thread1of1ForFork0_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_k]" "[102] L57-1-->L58: Formula: (< v_thread1Thread1of1ForFork3_i_5 v_N_1) InVars {thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_5, N=v_N_1} AuxVars[] AssignedVars[]" "[104] L58-->L59: Formula: (= (store v_A_2 v_thread1Thread1of1ForFork3_i_7 (let ((.cse0 (select v_A_2 v_thread1Thread1of1ForFork3_i_7))) (ite (< .cse0 0) 0 .cse0))) v_A_1) InVars {A=v_A_2, thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_7} OutVars{A=v_A_1, thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_7} AuxVars[] AssignedVars[A]" "[147] L37-->$Ultimate##0: Formula: (and (= 5 v_thread3Thread1of1ForFork1_thidvar1_2) (= 5 v_thread3Thread1of1ForFork1_thidvar2_2) (= 5 v_thread3Thread1of1ForFork1_thidvar3_2) (= 5 v_thread3Thread1of1ForFork1_thidvar0_2) (= 5 v_thread3Thread1of1ForFork1_thidvar4_2)) InVars {} OutVars{thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_14, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_2, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_2, thread3Thread1of1ForFork1_thidvar4=v_thread3Thread1of1ForFork1_thidvar4_2, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_2, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_k, thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_thidvar3, thread3Thread1of1ForFork1_thidvar4, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2]" "[136] $Ultimate##0-->L89-1: Formula: (= v_thread3Thread1of1ForFork1_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_k]" "[105] L59-->L57-1: Formula: (= v_thread1Thread1of1ForFork3_i_10 (+ v_thread1Thread1of1ForFork3_i_9 1)) InVars {thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_9} OutVars{thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_i]" "[101] L57-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork3_i_3) InVars {thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_3, N=v_N_2} OutVars{thread1Thread1of1ForFork3_i=v_thread1Thread1of1ForFork3_i_3, N=v_N_2} AuxVars[] AssignedVars[]" "[107] L70-->L71-1: Formula: (= v_thread2Thread1of1ForFork4_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork4_j=v_thread2Thread1of1ForFork4_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork4_j]" "[109] L71-1-->L72: Formula: (< v_thread2Thread1of1ForFork4_j_5 v_N_4) InVars {thread2Thread1of1ForFork4_j=v_thread2Thread1of1ForFork4_j_5, N=v_N_4} OutVars{thread2Thread1of1ForFork4_j=v_thread2Thread1of1ForFork4_j_5, N=v_N_4} AuxVars[] AssignedVars[]" "[112] L72-->L72-2: Formula: (<= (select v_A_4 v_thread2Thread1of1ForFork4_j_9) 0) InVars {A=v_A_4, thread2Thread1of1ForFork4_j=v_thread2Thread1of1ForFork4_j_9} OutVars{A=v_A_4, thread2Thread1of1ForFork4_j=v_thread2Thread1of1ForFork4_j_9} AuxVars[] AssignedVars[]" "[137] L89-1-->thread3FINAL: Formula: (<= v_N_6 v_thread3Thread1of1ForFork1_k_3) InVars {N=v_N_6, thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_3} OutVars{N=v_N_6, thread3Thread1of1ForFork1_k=v_thread3Thread1of1ForFork1_k_3} AuxVars[] AssignedVars[]" "[120] L89-1-->L90: Formula: (< v_thread3Thread1of1ForFork5_k_5 v_N_5) InVars {N=v_N_5, thread3Thread1of1ForFork5_k=v_thread3Thread1of1ForFork5_k_5} OutVars{N=v_N_5, thread3Thread1of1ForFork5_k=v_thread3Thread1of1ForFork5_k_5} AuxVars[] AssignedVars[]" "[126] L89-1-->L90: Formula: (< v_thread3Thread1of1ForFork0_k_5 v_N_5) InVars {thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork0_k=v_thread3Thread1of1ForFork0_k_5, N=v_N_5} AuxVars[] AssignedVars[]" "[150] L38-->$Ultimate##0: Formula: (and (= 6 v_thread3Thread1of1ForFork2_thidvar2_2) (= 6 v_thread3Thread1of1ForFork2_thidvar0_2) (= 6 v_thread3Thread1of1ForFork2_thidvar4_2) (= 6 v_thread3Thread1of1ForFork2_thidvar5_2) (= 6 v_thread3Thread1of1ForFork2_thidvar1_2) (= 6 v_thread3Thread1of1ForFork2_thidvar3_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_2, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar5=v_thread3Thread1of1ForFork2_thidvar5_2, thread3Thread1of1ForFork2_thidvar4=v_thread3Thread1of1ForFork2_thidvar4_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2, thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_14} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar3, thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar5, thread3Thread1of1ForFork2_thidvar4, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0, thread3Thread1of1ForFork2_k]" "[130] $Ultimate##0-->L89-1: Formula: (= v_thread3Thread1of1ForFork2_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_k]" "[132] L89-1-->L90: Formula: (< v_thread3Thread1of1ForFork2_k_5 v_N_5) InVars {thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_5, N=v_N_5} AuxVars[] AssignedVars[]" "[103] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:54:55,685 INFO L754 eck$LassoCheckResult]: Loop: "[134] L90-->L91: Formula: (= v_B_3 (store v_B_4 v_thread3Thread1of1ForFork2_k_7 v_thread3Thread1of1ForFork2_k_7)) InVars {thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_7, B=v_B_4} OutVars{thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_7, B=v_B_3} AuxVars[] AssignedVars[B]" "[135] L91-->L89-1: Formula: (= v_thread3Thread1of1ForFork2_k_10 (+ v_thread3Thread1of1ForFork2_k_9 1)) InVars {thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_9} OutVars{thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_10} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_k]" "[132] L89-1-->L90: Formula: (< v_thread3Thread1of1ForFork2_k_5 v_N_5) InVars {thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_5, N=v_N_5} OutVars{thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_5, N=v_N_5} AuxVars[] AssignedVars[]" [2025-04-26 16:54:55,685 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:55,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1166027524, now seen corresponding path program 1 times [2025-04-26 16:54:55,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:55,685 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316458439] [2025-04-26 16:54:55,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:55,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:55,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-26 16:54:55,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-26 16:54:55,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:55,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:55,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:55,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:54:55,744 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316458439] [2025-04-26 16:54:55,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316458439] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:54:55,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:54:55,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:54:55,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172788937] [2025-04-26 16:54:55,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:54:55,744 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:54:55,745 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:55,745 INFO L85 PathProgramCache]: Analyzing trace with hash 162882, now seen corresponding path program 3 times [2025-04-26 16:54:55,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:55,745 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980518580] [2025-04-26 16:54:55,745 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:54:55,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:55,747 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:55,748 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:55,748 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:54:55,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:55,749 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:55,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:55,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:55,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:55,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:55,752 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:55,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:54:55,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:54:55,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:54:55,765 INFO L87 Difference]: Start difference. First operand 171152 states and 391686 transitions. cyclomatic complexity: 225074 Second operand has 4 states, 4 states have (on average 6.5) internal successors, (in total 26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:57,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:54:57,740 INFO L93 Difference]: Finished difference Result 292037 states and 668658 transitions. [2025-04-26 16:54:57,740 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 292037 states and 668658 transitions. [2025-04-26 16:55:00,470 INFO L131 ngComponentsAnalysis]: Automaton has 162 accepting balls. 486 [2025-04-26 16:55:02,731 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 292037 states to 290901 states and 665988 transitions. [2025-04-26 16:55:02,731 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 61259 [2025-04-26 16:55:02,878 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61303 [2025-04-26 16:55:02,878 INFO L74 IsDeterministic]: Start isDeterministic. Operand 290901 states and 665988 transitions. [2025-04-26 16:55:02,878 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:02,878 INFO L218 hiAutomatonCegarLoop]: Abstraction has 290901 states and 665988 transitions. [2025-04-26 16:55:03,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290901 states and 665988 transitions. [2025-04-26 16:55:06,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290901 to 190965. [2025-04-26 16:55:06,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190965 states, 190965 states have (on average 2.2989762521928103) internal successors, (in total 439024), 190964 states have internal predecessors, (439024), 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 16:55:07,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190965 states to 190965 states and 439024 transitions. [2025-04-26 16:55:07,941 INFO L240 hiAutomatonCegarLoop]: Abstraction has 190965 states and 439024 transitions. [2025-04-26 16:55:07,941 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 16:55:07,942 INFO L438 stractBuchiCegarLoop]: Abstraction has 190965 states and 439024 transitions. [2025-04-26 16:55:07,942 INFO L340 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-04-26 16:55:07,942 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 190965 states and 439024 transitions.