/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 18:39:02,417 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:39:02,465 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:39:02,472 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:39:02,472 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:39:02,472 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:39:02,472 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:39:02,497 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:39:02,497 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:39:02,497 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:39:02,498 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:39:02,498 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:39:02,498 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:39:02,498 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:39:02,498 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:39:02,498 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:39:02,498 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:39:02,498 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:39:02,498 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:39:02,498 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:39:02,499 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:39:02,499 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:39:02,500 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:39:02,500 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:39:02,500 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:39:02,500 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:39:02,500 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:39:02,500 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:39:02,500 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:39:02,500 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:39:02,500 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:39:02,500 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:39:02,500 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:39:02,500 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:39:02,500 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:39:02,500 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:39:02,501 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:39:02,501 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:39:02,501 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:39:02,501 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:39:02,501 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:39:02,501 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:39:02,501 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:39:02,723 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:39:02,735 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:39:02,736 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:39:02,737 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:39:02,738 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:39:02,739 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 18:39:02,740 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-aggr-update1-4modifiers.bpl' [2025-04-26 18:39:02,759 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:39:02,762 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:39:02,762 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:39:02,762 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:39:02,762 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:39:02,769 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 06:39:02" (1/1) ... [2025-04-26 18:39:02,790 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 06:39:02" (1/1) ... [2025-04-26 18:39:02,799 INFO L138 Inliner]: procedures = 4, calls = 6, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:39:02,801 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:39:02,802 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:39:02,802 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:39:02,802 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:39:02,806 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 06:39:02" (1/1) ... [2025-04-26 18:39:02,807 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 06:39:02" (1/1) ... [2025-04-26 18:39:02,807 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 06:39:02" (1/1) ... [2025-04-26 18:39:02,807 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 06:39:02" (1/1) ... [2025-04-26 18:39:02,809 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 06:39:02" (1/1) ... [2025-04-26 18:39:02,810 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 06:39:02" (1/1) ... [2025-04-26 18:39:02,812 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 06:39:02" (1/1) ... [2025-04-26 18:39:02,812 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 06:39:02" (1/1) ... [2025-04-26 18:39:02,812 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 06:39:02" (1/1) ... [2025-04-26 18:39:02,821 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:39:02,822 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:39:02,822 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:39:02,822 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:39:02,823 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 06:39:02" (1/1) ... [2025-04-26 18:39:02,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:39:02,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:02,849 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:02,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 18:39:02,879 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:39:02,879 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:39:02,879 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:39:02,879 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:39:02,879 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:39:02,879 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:39:02,879 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:39:02,879 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:39:02,880 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:39:02,880 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:39:02,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:39:02,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:39:02,880 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 18:39:02,917 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:39:02,919 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:39:03,029 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:39:03,029 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:39:03,038 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:39:03,038 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:39:03,039 INFO L201 PluginConnector]: Adding new model map-aggr-update1-4modifiers.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:39:03 BoogieIcfgContainer [2025-04-26 18:39:03,039 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:39:03,040 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:39:03,040 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:39:03,045 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:39:03,047 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:39:03,047 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 06:39:02" (1/2) ... [2025-04-26 18:39:03,049 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@79b92ee and model type map-aggr-update1-4modifiers.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:39:03, skipping insertion in model container [2025-04-26 18:39:03,049 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:39:03,050 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 06:39:03" (2/2) ... [2025-04-26 18:39:03,051 INFO L376 chiAutomizerObserver]: Analyzing ICFG map-aggr-update1-4modifiers.bpl [2025-04-26 18:39:03,128 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2025-04-26 18:39:03,159 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:39:03,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:39:03,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:03,163 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:03,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 18:39:03,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 70 transitions, 182 flow [2025-04-26 18:39:03,260 INFO L116 PetriNetUnfolderBase]: 8/58 cut-off events. [2025-04-26 18:39:03,264 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-26 18:39:03,271 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 18:39:03,271 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 70 transitions, 182 flow [2025-04-26 18:39:03,275 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 69 places, 58 transitions, 152 flow [2025-04-26 18:39:03,275 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 69 places, 58 transitions, 152 flow [2025-04-26 18:39:03,275 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 69 places, 58 transitions, 152 flow [2025-04-26 18:39:07,027 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 107826 states, 107824 states have (on average 6.151079537023297) internal successors, (in total 663234), 107825 states have internal predecessors, (663234), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:07,215 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 107826 states, 107824 states have (on average 6.151079537023297) internal successors, (in total 663234), 107825 states have internal predecessors, (663234), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:07,218 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:39:10,421 WARN L140 AmpleReduction]: Number of pruned transitions: 122217 [2025-04-26 18:39:10,422 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:39:10,422 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 7822 [2025-04-26 18:39:10,422 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:73 [2025-04-26 18:39:10,422 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:24992 [2025-04-26 18:39:10,422 WARN L145 AmpleReduction]: Times succ was already a loop node:7727 [2025-04-26 18:39:10,422 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:24021 [2025-04-26 18:39:10,422 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:39:10,482 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 32888 states, 32886 states have (on average 2.529617466399076) internal successors, (in total 83189), 32887 states have internal predecessors, (83189), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:10,489 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:39:10,489 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:39:10,489 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:39:10,489 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:39:10,489 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:39:10,489 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:39:10,489 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:39:10,489 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:39:10,540 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 32888 states, 32886 states have (on average 2.529617466399076) internal successors, (in total 83189), 32887 states have internal predecessors, (83189), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:11,019 INFO L131 ngComponentsAnalysis]: Automaton has 1273 accepting balls. 25369 [2025-04-26 18:39:11,020 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:11,020 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:11,025 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:39:11,026 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:39:11,026 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:39:11,075 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 32888 states, 32886 states have (on average 2.529617466399076) internal successors, (in total 83189), 32887 states have internal predecessors, (83189), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:11,502 INFO L131 ngComponentsAnalysis]: Automaton has 1273 accepting balls. 25369 [2025-04-26 18:39:11,503 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:11,503 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:11,504 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:39:11,504 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:39:11,508 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 18:39:11,508 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 18:39:11,512 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:11,514 INFO L85 PathProgramCache]: Analyzing trace with hash 124968, now seen corresponding path program 1 times [2025-04-26 18:39:11,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:11,519 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531343364] [2025-04-26 18:39:11,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:11,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:11,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:11,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:11,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:11,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:11,572 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:11,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:11,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:11,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:11,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:11,592 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:11,594 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:11,595 INFO L85 PathProgramCache]: Analyzing trace with hash 131142, now seen corresponding path program 1 times [2025-04-26 18:39:11,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:11,595 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47832023] [2025-04-26 18:39:11,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:11,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:11,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:11,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:11,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:11,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:11,608 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:11,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:11,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:11,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:11,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:11,618 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:11,619 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:11,619 INFO L85 PathProgramCache]: Analyzing trace with hash -571944257, now seen corresponding path program 1 times [2025-04-26 18:39:11,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:11,619 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790873398] [2025-04-26 18:39:11,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:11,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:11,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:39:11,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:39:11,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:11,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:11,631 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:11,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:39:11,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:39:11,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:11,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:11,709 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:11,883 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:11,883 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:11,883 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:11,883 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:11,883 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:11,883 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:11,884 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:11,884 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:11,884 INFO L132 ssoRankerPreferences]: Filename of dumped script: map-aggr-update1-4modifiers.bpl_petrified1_Iteration1_Lasso [2025-04-26 18:39:11,884 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:11,884 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:11,908 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:11,967 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:12,029 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:12,032 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:12,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:12,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:12,035 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:12,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 18:39:12,044 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:12,066 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:12,067 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:12,067 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:12,067 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:12,082 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:12,082 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:12,088 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:12,107 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 18:39:12,107 INFO L437 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 18:39:12,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:12,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:12,110 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:12,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 18:39:12,117 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:12,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 18:39:12,146 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:39:12,146 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:12,147 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork3_i, N) = -1*thread1Thread1of1ForFork3_i + 1*N Supporting invariants [] [2025-04-26 18:39:12,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:12,155 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:39:12,182 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:12,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:12,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:12,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:12,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:12,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:12,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:12,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:12,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:12,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:12,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:12,226 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:12,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:12,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:39:12,286 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:39:12,333 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 32888 states, 32886 states have (on average 2.529617466399076) internal successors, (in total 83189), 32887 states have internal predecessors, (83189), 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 18:39:13,677 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 32888 states, 32886 states have (on average 2.529617466399076) internal successors, (in total 83189), 32887 states have internal predecessors, (83189), 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 76112 states and 189847 transitions. Complement of second has 6 states. [2025-04-26 18:39:13,678 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:39:13,682 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 18:39:13,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2025-04-26 18:39:13,689 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 136 transitions. Stem has 3 letters. Loop has 3 letters. [2025-04-26 18:39:13,690 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:13,690 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 136 transitions. Stem has 6 letters. Loop has 3 letters. [2025-04-26 18:39:13,690 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:13,692 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 136 transitions. Stem has 3 letters. Loop has 6 letters. [2025-04-26 18:39:13,692 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:13,692 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76112 states and 189847 transitions. [2025-04-26 18:39:14,409 INFO L131 ngComponentsAnalysis]: Automaton has 788 accepting balls. 4279 [2025-04-26 18:39:14,840 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76112 states to 45239 states and 111145 transitions. [2025-04-26 18:39:14,841 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9665 [2025-04-26 18:39:14,891 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19985 [2025-04-26 18:39:14,892 INFO L74 IsDeterministic]: Start isDeterministic. Operand 45239 states and 111145 transitions. [2025-04-26 18:39:14,893 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:14,893 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45239 states and 111145 transitions. [2025-04-26 18:39:14,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45239 states and 111145 transitions. [2025-04-26 18:39:15,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45239 to 38840. [2025-04-26 18:39:15,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38840 states, 38840 states have (on average 2.5935118434603504) internal successors, (in total 100732), 38839 states have internal predecessors, (100732), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:16,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38840 states to 38840 states and 100732 transitions. [2025-04-26 18:39:16,688 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38840 states and 100732 transitions. [2025-04-26 18:39:16,688 INFO L438 stractBuchiCegarLoop]: Abstraction has 38840 states and 100732 transitions. [2025-04-26 18:39:16,688 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:39:16,688 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38840 states and 100732 transitions. [2025-04-26 18:39:16,840 INFO L131 ngComponentsAnalysis]: Automaton has 788 accepting balls. 4279 [2025-04-26 18:39:16,841 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:16,841 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:16,841 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:16,841 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:39:16,842 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 18:39:16,842 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 18:39:16,842 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:16,842 INFO L85 PathProgramCache]: Analyzing trace with hash 116482003, now seen corresponding path program 1 times [2025-04-26 18:39:16,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:16,842 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407285259] [2025-04-26 18:39:16,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:16,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:16,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:39:16,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:39:16,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:16,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:16,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:39:16,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:39:16,900 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407285259] [2025-04-26 18:39:16,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407285259] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:39:16,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:39:16,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:39:16,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063746678] [2025-04-26 18:39:16,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:39:16,903 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:39:16,904 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:16,904 INFO L85 PathProgramCache]: Analyzing trace with hash 4282054, now seen corresponding path program 1 times [2025-04-26 18:39:16,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:16,904 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558247651] [2025-04-26 18:39:16,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:16,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:16,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:39:16,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:39:16,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:16,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:16,908 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:16,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:39:16,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:39:16,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:16,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:16,914 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:16,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:39:16,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 18:39:16,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 18:39:16,940 INFO L87 Difference]: Start difference. First operand 38840 states and 100732 transitions. cyclomatic complexity: 63133 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:17,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:39:17,305 INFO L93 Difference]: Finished difference Result 38840 states and 100731 transitions. [2025-04-26 18:39:17,305 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38840 states and 100731 transitions. [2025-04-26 18:39:17,609 INFO L131 ngComponentsAnalysis]: Automaton has 788 accepting balls. 4279 [2025-04-26 18:39:17,892 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38840 states to 38840 states and 100731 transitions. [2025-04-26 18:39:17,893 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13586 [2025-04-26 18:39:17,926 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13586 [2025-04-26 18:39:17,926 INFO L74 IsDeterministic]: Start isDeterministic. Operand 38840 states and 100731 transitions. [2025-04-26 18:39:17,926 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:17,927 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38840 states and 100731 transitions. [2025-04-26 18:39:17,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38840 states and 100731 transitions. [2025-04-26 18:39:18,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38840 to 38840. [2025-04-26 18:39:18,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38840 states, 38840 states have (on average 2.593486096807415) internal successors, (in total 100731), 38839 states have internal predecessors, (100731), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:19,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38840 states to 38840 states and 100731 transitions. [2025-04-26 18:39:19,263 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38840 states and 100731 transitions. [2025-04-26 18:39:19,264 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 18:39:19,264 INFO L438 stractBuchiCegarLoop]: Abstraction has 38840 states and 100731 transitions. [2025-04-26 18:39:19,264 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:39:19,264 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38840 states and 100731 transitions. [2025-04-26 18:39:19,402 INFO L131 ngComponentsAnalysis]: Automaton has 788 accepting balls. 4279 [2025-04-26 18:39:19,402 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:19,402 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:19,403 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:19,403 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:39:19,403 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 18:39:19,403 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 18:39:19,404 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:19,404 INFO L85 PathProgramCache]: Analyzing trace with hash 947420060, now seen corresponding path program 1 times [2025-04-26 18:39:19,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:19,404 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235185994] [2025-04-26 18:39:19,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:19,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:19,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:39:19,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:39:19,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:19,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:19,410 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:19,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:39:19,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:39:19,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:19,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:19,415 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:19,415 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:19,415 INFO L85 PathProgramCache]: Analyzing trace with hash 4282054, now seen corresponding path program 2 times [2025-04-26 18:39:19,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:19,415 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402946529] [2025-04-26 18:39:19,415 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:39:19,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:19,417 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:39:19,418 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:39:19,418 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:39:19,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:19,418 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:19,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:39:19,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:39:19,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:19,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:19,421 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:19,421 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:19,421 INFO L85 PathProgramCache]: Analyzing trace with hash 176983265, now seen corresponding path program 1 times [2025-04-26 18:39:19,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:19,421 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75543728] [2025-04-26 18:39:19,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:19,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:19,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:39:19,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:39:19,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:19,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:19,430 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:19,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:39:19,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:39:19,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:19,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:19,442 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:19,586 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:19,586 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:19,586 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:19,586 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:19,586 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:19,586 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:19,586 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:19,586 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:19,586 INFO L132 ssoRankerPreferences]: Filename of dumped script: map-aggr-update1-4modifiers.bpl_petrified1_Iteration3_Lasso [2025-04-26 18:39:19,587 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:19,587 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:19,589 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:19,659 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:19,662 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:19,664 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:19,667 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:19,669 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:19,791 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:19,791 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:19,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:19,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:19,794 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:19,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 18:39:19,796 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:19,806 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:19,806 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:19,806 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:19,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:19,809 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:19,809 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:19,814 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:19,822 INFO L436 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-04-26 18:39:19,823 INFO L437 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 18:39:19,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:19,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:19,826 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:19,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 18:39:19,828 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:19,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:19,845 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 18:39:19,845 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:19,845 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 18:39:19,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 18:39:19,854 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:39:19,873 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:19,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:39:19,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:39:19,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:19,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:19,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 18:39:19,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:19,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:39:19,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:39:19,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:19,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:19,972 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 18:39:19,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:20,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:39:20,003 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 18:39:20,004 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38840 states and 100731 transitions. cyclomatic complexity: 63132 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 18:39:20,506 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38840 states and 100731 transitions. cyclomatic complexity: 63132. 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 47429 states and 115976 transitions. Complement of second has 11 states. [2025-04-26 18:39:20,507 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 18:39:20,507 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 18:39:20,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions. [2025-04-26 18:39:20,507 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 134 transitions. Stem has 11 letters. Loop has 4 letters. [2025-04-26 18:39:20,508 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:20,508 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 134 transitions. Stem has 15 letters. Loop has 4 letters. [2025-04-26 18:39:20,508 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:20,508 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 134 transitions. Stem has 11 letters. Loop has 8 letters. [2025-04-26 18:39:20,508 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:20,508 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47429 states and 115976 transitions. [2025-04-26 18:39:20,952 INFO L131 ngComponentsAnalysis]: Automaton has 1215 accepting balls. 6272 [2025-04-26 18:39:21,220 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47429 states to 45224 states and 111900 transitions. [2025-04-26 18:39:21,220 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16929 [2025-04-26 18:39:21,255 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18811 [2025-04-26 18:39:21,255 INFO L74 IsDeterministic]: Start isDeterministic. Operand 45224 states and 111900 transitions. [2025-04-26 18:39:21,256 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:21,256 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45224 states and 111900 transitions. [2025-04-26 18:39:21,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45224 states and 111900 transitions. [2025-04-26 18:39:22,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45224 to 39491. [2025-04-26 18:39:22,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39491 states, 39491 states have (on average 2.5763591704438986) internal successors, (in total 101743), 39490 states have internal predecessors, (101743), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:22,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39491 states to 39491 states and 101743 transitions. [2025-04-26 18:39:22,277 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39491 states and 101743 transitions. [2025-04-26 18:39:22,277 INFO L438 stractBuchiCegarLoop]: Abstraction has 39491 states and 101743 transitions. [2025-04-26 18:39:22,277 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:39:22,278 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39491 states and 101743 transitions. [2025-04-26 18:39:22,456 INFO L131 ngComponentsAnalysis]: Automaton has 814 accepting balls. 4403 [2025-04-26 18:39:22,457 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:22,457 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:22,457 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:22,457 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:39:22,458 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 18:39:22,458 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 18:39:22,458 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:22,458 INFO L85 PathProgramCache]: Analyzing trace with hash -768417997, now seen corresponding path program 2 times [2025-04-26 18:39:22,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:22,458 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132845987] [2025-04-26 18:39:22,459 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:39:22,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:22,633 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-26 18:39:22,643 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:39:22,643 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 18:39:22,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:22,644 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:22,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:39:22,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:39:22,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:22,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:22,654 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:22,655 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:22,655 INFO L85 PathProgramCache]: Analyzing trace with hash 4282054, now seen corresponding path program 3 times [2025-04-26 18:39:22,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:22,655 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881579609] [2025-04-26 18:39:22,655 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 18:39:22,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:22,657 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:39:22,662 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:39:22,663 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 18:39:22,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:22,663 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:22,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:39:22,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:39:22,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:22,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:22,666 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:22,666 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:22,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1297265416, now seen corresponding path program 2 times [2025-04-26 18:39:22,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:22,666 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179560967] [2025-04-26 18:39:22,668 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:39:22,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:22,671 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-26 18:39:22,676 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 18:39:22,677 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 18:39:22,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:22,677 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:22,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 18:39:22,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 18:39:22,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:22,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:22,689 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:22,895 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:22,895 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:22,895 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:22,895 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:22,895 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:22,895 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:22,895 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:22,895 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:22,895 INFO L132 ssoRankerPreferences]: Filename of dumped script: map-aggr-update1-4modifiers.bpl_petrified1_Iteration4_Lasso [2025-04-26 18:39:22,895 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:22,895 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:22,898 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:22,903 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:22,906 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:22,909 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:22,911 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:23,154 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:23,158 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:23,329 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:23,329 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:23,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:23,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:23,331 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:23,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 18:39:23,333 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:23,343 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:23,344 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:23,344 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:23,344 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:23,345 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:23,345 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:23,347 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:23,353 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 18:39:23,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:23,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:23,355 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:23,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 18:39:23,358 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:23,367 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:23,368 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:23,368 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:23,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:23,369 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:23,369 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:23,371 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:23,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 18:39:23,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:23,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:23,379 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:23,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 18:39:23,382 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:23,392 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:23,392 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:23,392 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:23,392 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:23,393 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:23,393 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:23,395 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:23,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 18:39:23,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:23,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:23,403 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:23,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 18:39:23,409 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:23,426 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:23,426 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:23,426 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:23,426 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:23,430 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:23,430 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:23,433 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:23,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 18:39:23,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:23,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:23,451 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:23,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 18:39:23,457 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:23,471 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:23,471 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 18:39:23,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:23,472 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:23,475 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-04-26 18:39:23,475 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:23,478 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:23,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:23,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:23,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:23,487 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:23,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 18:39:23,490 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:23,499 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:23,500 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 18:39:23,500 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:23,500 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:23,502 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-04-26 18:39:23,502 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:23,506 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:23,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:23,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:23,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:23,513 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:23,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 18:39:23,516 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:23,525 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:23,526 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:23,526 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:23,526 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:23,528 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:23,528 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:23,533 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:23,538 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 18:39:23,539 INFO L437 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 18:39:23,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:23,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:23,543 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:23,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 18:39:23,545 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:23,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 18:39:23,560 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:39:23,560 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:23,560 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork4_j, N) = -1*thread2Thread1of1ForFork4_j + 1*N Supporting invariants [] [2025-04-26 18:39:23,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 18:39:23,570 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:39:23,579 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:23,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:39:23,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:39:23,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:23,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:23,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:23,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:23,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:39:23,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:39:23,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:23,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:23,609 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:23,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:23,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:39:23,631 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:39:23,631 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39491 states and 101743 transitions. cyclomatic complexity: 63549 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 18:39:24,239 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39491 states and 101743 transitions. cyclomatic complexity: 63549. 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 85093 states and 213052 transitions. Complement of second has 6 states. [2025-04-26 18:39:24,239 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:39:24,240 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 18:39:24,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2025-04-26 18:39:24,240 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 133 transitions. Stem has 14 letters. Loop has 4 letters. [2025-04-26 18:39:24,240 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:24,240 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 133 transitions. Stem has 18 letters. Loop has 4 letters. [2025-04-26 18:39:24,240 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:24,240 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 133 transitions. Stem has 14 letters. Loop has 8 letters. [2025-04-26 18:39:24,240 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:24,241 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85093 states and 213052 transitions. [2025-04-26 18:39:24,889 INFO L131 ngComponentsAnalysis]: Automaton has 698 accepting balls. 3232 [2025-04-26 18:39:25,623 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85093 states to 63472 states and 157486 transitions. [2025-04-26 18:39:25,624 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18813 [2025-04-26 18:39:25,664 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20738 [2025-04-26 18:39:25,664 INFO L74 IsDeterministic]: Start isDeterministic. Operand 63472 states and 157486 transitions. [2025-04-26 18:39:25,664 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:25,664 INFO L218 hiAutomatonCegarLoop]: Abstraction has 63472 states and 157486 transitions. [2025-04-26 18:39:25,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63472 states and 157486 transitions. [2025-04-26 18:39:26,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63472 to 60997. [2025-04-26 18:39:26,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60997 states, 60997 states have (on average 2.5055986359984916) internal successors, (in total 152834), 60996 states have internal predecessors, (152834), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:27,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60997 states to 60997 states and 152834 transitions. [2025-04-26 18:39:27,001 INFO L240 hiAutomatonCegarLoop]: Abstraction has 60997 states and 152834 transitions. [2025-04-26 18:39:27,001 INFO L438 stractBuchiCegarLoop]: Abstraction has 60997 states and 152834 transitions. [2025-04-26 18:39:27,001 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:39:27,001 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60997 states and 152834 transitions. [2025-04-26 18:39:27,292 INFO L131 ngComponentsAnalysis]: Automaton has 672 accepting balls. 3108 [2025-04-26 18:39:27,292 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:27,292 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:27,292 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:27,292 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:39:27,293 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 18:39:27,293 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 18:39:27,293 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:27,293 INFO L85 PathProgramCache]: Analyzing trace with hash 176952917, now seen corresponding path program 1 times [2025-04-26 18:39:27,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:27,293 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678876791] [2025-04-26 18:39:27,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:27,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:27,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:39:27,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:39:27,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:27,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:27,384 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 18:39:27,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:39:27,384 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678876791] [2025-04-26 18:39:27,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678876791] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:39:27,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:39:27,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:39:27,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756482378] [2025-04-26 18:39:27,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:39:27,385 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:39:27,385 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:27,385 INFO L85 PathProgramCache]: Analyzing trace with hash 149016, now seen corresponding path program 1 times [2025-04-26 18:39:27,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:27,385 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650356686] [2025-04-26 18:39:27,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:27,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:27,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:27,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:27,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:27,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:27,398 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:27,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:27,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:27,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:27,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:27,406 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:27,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:39:27,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 18:39:27,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-26 18:39:27,429 INFO L87 Difference]: Start difference. First operand 60997 states and 152834 transitions. cyclomatic complexity: 93506 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 18:39:28,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:39:28,261 INFO L93 Difference]: Finished difference Result 106706 states and 264887 transitions. [2025-04-26 18:39:28,261 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 106706 states and 264887 transitions. [2025-04-26 18:39:29,205 INFO L131 ngComponentsAnalysis]: Automaton has 760 accepting balls. 3521 [2025-04-26 18:39:30,050 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 106706 states to 106706 states and 264887 transitions. [2025-04-26 18:39:30,050 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31030 [2025-04-26 18:39:30,119 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31030 [2025-04-26 18:39:30,119 INFO L74 IsDeterministic]: Start isDeterministic. Operand 106706 states and 264887 transitions. [2025-04-26 18:39:30,119 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:30,119 INFO L218 hiAutomatonCegarLoop]: Abstraction has 106706 states and 264887 transitions. [2025-04-26 18:39:30,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106706 states and 264887 transitions. [2025-04-26 18:39:31,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106706 to 65792. [2025-04-26 18:39:31,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65792 states, 65792 states have (on average 2.4880836575875485) internal successors, (in total 163696), 65791 states have internal predecessors, (163696), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:31,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65792 states to 65792 states and 163696 transitions. [2025-04-26 18:39:31,939 INFO L240 hiAutomatonCegarLoop]: Abstraction has 65792 states and 163696 transitions. [2025-04-26 18:39:31,939 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 18:39:31,940 INFO L438 stractBuchiCegarLoop]: Abstraction has 65792 states and 163696 transitions. [2025-04-26 18:39:31,940 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 18:39:31,940 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65792 states and 163696 transitions. [2025-04-26 18:39:32,221 INFO L131 ngComponentsAnalysis]: Automaton has 672 accepting balls. 3108 [2025-04-26 18:39:32,221 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:32,221 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:32,222 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:32,222 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:39:32,222 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 18:39:32,222 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 18:39:32,223 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:32,223 INFO L85 PathProgramCache]: Analyzing trace with hash 176984630, now seen corresponding path program 1 times [2025-04-26 18:39:32,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:32,223 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145503485] [2025-04-26 18:39:32,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:32,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:32,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:39:32,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:39:32,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:32,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:32,232 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:32,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:39:32,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:39:32,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:32,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:32,237 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:32,238 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:32,238 INFO L85 PathProgramCache]: Analyzing trace with hash 149016, now seen corresponding path program 2 times [2025-04-26 18:39:32,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:32,238 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432838884] [2025-04-26 18:39:32,238 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:39:32,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:32,239 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:32,240 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:32,241 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:39:32,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:32,241 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:32,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:32,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:32,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:32,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:32,242 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:32,243 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:32,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1670607933, now seen corresponding path program 1 times [2025-04-26 18:39:32,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:32,243 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408367278] [2025-04-26 18:39:32,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:32,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:32,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 18:39:32,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 18:39:32,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:32,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:32,249 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:32,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 18:39:32,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 18:39:32,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:32,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:32,254 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:32,592 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:32,592 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:32,592 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:32,592 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:32,592 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:32,592 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:32,592 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:32,592 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:32,592 INFO L132 ssoRankerPreferences]: Filename of dumped script: map-aggr-update1-4modifiers.bpl_petrified1_Iteration6_Lasso [2025-04-26 18:39:32,592 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:32,592 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:32,593 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:32,595 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:32,597 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:32,599 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:32,601 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:32,603 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:32,605 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:32,607 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:32,608 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:32,618 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:32,638 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:32,720 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:32,720 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:32,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:32,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:32,723 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:32,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 18:39:32,724 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:32,734 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:32,734 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:32,734 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:32,734 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:32,735 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:32,735 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:32,739 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:32,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 18:39:32,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:32,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:32,746 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:32,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 18:39:32,747 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:32,757 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:32,757 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:32,757 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:32,757 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:32,758 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:32,758 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:32,760 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:32,765 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 18:39:32,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:32,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:32,767 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:32,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 18:39:32,769 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:32,778 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:32,778 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:32,778 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:32,778 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:32,779 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:32,779 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:32,781 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:32,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 18:39:32,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:32,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:32,789 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:32,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 18:39:32,790 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:32,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:32,799 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:32,799 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:32,800 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:32,801 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:32,801 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:32,803 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:32,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:32,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:32,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:32,810 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:32,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 18:39:32,811 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:32,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:32,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:32,821 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:32,821 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:32,822 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:32,822 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:32,824 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:32,829 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 18:39:32,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:32,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:32,831 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:32,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 18:39:32,834 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:32,843 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:32,843 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:32,843 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:32,843 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:32,844 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:32,844 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:32,846 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:32,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-04-26 18:39:32,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:32,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:32,861 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 18:39:32,863 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 18:39:32,864 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:32,873 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:32,873 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:32,873 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:32,873 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:32,874 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:32,874 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:32,877 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:32,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-04-26 18:39:32,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:32,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:32,885 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 18:39:32,886 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 18:39:32,887 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:32,897 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:32,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:32,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:32,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:32,899 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:32,899 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:32,904 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:32,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:32,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:32,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:32,911 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 18:39:32,914 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 18:39:32,915 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:32,924 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:32,925 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:39:32,925 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:32,925 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:32,925 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:32,925 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:39:32,925 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:39:32,929 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:32,935 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 18:39:32,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:32,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:32,937 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 18:39:32,938 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 18:39:32,941 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:32,950 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:32,950 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:32,951 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:32,951 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:32,952 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:32,952 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:32,957 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:32,965 INFO L436 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-04-26 18:39:32,966 INFO L437 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 18:39:32,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:32,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:32,967 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 18:39:32,969 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 18:39:32,970 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:32,986 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 18:39:32,986 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:39:32,986 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:32,986 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, thread3Thread1of1ForFork5_k) = 1*N - 1*thread3Thread1of1ForFork5_k Supporting invariants [] [2025-04-26 18:39:32,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-04-26 18:39:32,992 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:39:33,001 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:33,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:39:33,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:39:33,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:33,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:33,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:33,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:33,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:33,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:33,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:33,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:33,028 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:33,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:33,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:39:33,053 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:39:33,053 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 65792 states and 163696 transitions. cyclomatic complexity: 99678 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 18:39:33,940 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 65792 states and 163696 transitions. cyclomatic complexity: 99678. 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 141399 states and 342568 transitions. Complement of second has 6 states. [2025-04-26 18:39:33,941 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:39:33,941 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 18:39:33,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2025-04-26 18:39:33,941 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 136 transitions. Stem has 15 letters. Loop has 3 letters. [2025-04-26 18:39:33,941 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:33,942 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 136 transitions. Stem has 18 letters. Loop has 3 letters. [2025-04-26 18:39:33,942 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:33,942 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 136 transitions. Stem has 15 letters. Loop has 6 letters. [2025-04-26 18:39:33,942 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:33,942 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 141399 states and 342568 transitions. [2025-04-26 18:39:35,393 INFO L131 ngComponentsAnalysis]: Automaton has 556 accepting balls. 2204 [2025-04-26 18:39:36,351 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 141399 states to 105733 states and 253572 transitions. [2025-04-26 18:39:36,352 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27449 [2025-04-26 18:39:36,420 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28703 [2025-04-26 18:39:36,421 INFO L74 IsDeterministic]: Start isDeterministic. Operand 105733 states and 253572 transitions. [2025-04-26 18:39:36,421 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:36,421 INFO L218 hiAutomatonCegarLoop]: Abstraction has 105733 states and 253572 transitions. [2025-04-26 18:39:36,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105733 states and 253572 transitions. [2025-04-26 18:39:37,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105733 to 103647. [2025-04-26 18:39:38,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103647 states, 103647 states have (on average 2.415458238058024) internal successors, (in total 250355), 103646 states have internal predecessors, (250355), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:38,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103647 states to 103647 states and 250355 transitions. [2025-04-26 18:39:38,653 INFO L240 hiAutomatonCegarLoop]: Abstraction has 103647 states and 250355 transitions. [2025-04-26 18:39:38,653 INFO L438 stractBuchiCegarLoop]: Abstraction has 103647 states and 250355 transitions. [2025-04-26 18:39:38,653 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 18:39:38,653 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 103647 states and 250355 transitions. [2025-04-26 18:39:39,165 INFO L131 ngComponentsAnalysis]: Automaton has 556 accepting balls. 2204 [2025-04-26 18:39:39,165 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:39,165 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:39,166 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 18:39:39,166 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:39:39,166 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 18:39:39,166 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 18:39:39,167 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:39,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1670607250, now seen corresponding path program 1 times [2025-04-26 18:39:39,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:39,167 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746170747] [2025-04-26 18:39:39,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:39,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:39,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 18:39:39,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 18:39:39,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:39,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:39,178 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:39,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 18:39:39,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 18:39:39,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:39,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:39,183 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:39,184 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:39,184 INFO L85 PathProgramCache]: Analyzing trace with hash 154974, now seen corresponding path program 1 times [2025-04-26 18:39:39,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:39,184 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031864482] [2025-04-26 18:39:39,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:39,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:39,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:39,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:39,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:39,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:39,193 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:39,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:39,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:39,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:39,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:39,195 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:39,199 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:39,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1020566481, now seen corresponding path program 1 times [2025-04-26 18:39:39,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:39,199 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481161253] [2025-04-26 18:39:39,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:39,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:39,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 18:39:39,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 18:39:39,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:39,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:39,212 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:39,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 18:39:39,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 18:39:39,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:39,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:39,219 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:39,397 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:39,397 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:39,397 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:39,397 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:39,397 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:39,397 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:39,397 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:39,397 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:39,397 INFO L132 ssoRankerPreferences]: Filename of dumped script: map-aggr-update1-4modifiers.bpl_petrified1_Iteration7_Lasso [2025-04-26 18:39:39,397 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:39,397 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:39,398 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:39,400 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:39,402 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:39,403 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:39,404 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:39,407 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:39,409 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:39,411 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:39,427 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:39,428 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:39,430 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:39,432 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:39,441 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:39,442 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:39,444 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:39,446 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:39,740 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:39,740 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:39,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:39,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:39,741 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 18:39:39,742 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 18:39:39,743 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:39,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:39,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:39,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:39,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:39,755 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:39,755 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:39,757 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:39,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-04-26 18:39:39,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:39,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:39,764 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 18:39:39,765 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 18:39:39,765 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:39,775 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:39,776 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:39,776 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:39,776 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:39,776 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:39,776 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:39,779 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:39,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-04-26 18:39:39,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:39,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:39,786 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 18:39:39,788 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 18:39:39,791 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:39,801 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:39,801 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:39,801 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:39,801 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:39,802 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:39,802 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:39,804 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:39,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:39,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:39,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:39,811 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 18:39:39,812 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 18:39:39,813 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:39,822 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:39,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:39,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:39,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:39,823 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:39,823 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:39,825 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:39,830 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 18:39:39,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:39,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:39,832 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 18:39:39,833 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 18:39:39,833 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:39,843 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:39,843 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:39,843 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:39,843 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:39,844 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:39,844 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:39,846 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:39,852 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 18:39:39,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:39,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:39,854 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 18:39:39,854 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 18:39:39,855 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:39,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:39,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:39,865 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:39,865 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:39,866 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:39,866 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:39,868 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:39,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-04-26 18:39:39,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:39,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:39,875 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 18:39:39,876 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 18:39:39,876 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:39,887 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:39,887 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:39,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:39,887 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:39,889 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:39,889 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:39,891 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:39,895 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 18:39:39,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:39,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:39,897 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 18:39:39,898 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 18:39:39,898 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:39,908 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:39,908 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:39,908 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:39,908 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:39,909 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:39,909 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:39,911 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:39,917 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 18:39:39,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:39,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:39,919 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 18:39:39,919 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 18:39:39,920 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:39,930 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:39,930 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:39,930 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:39,930 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:39,931 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:39,931 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:39,933 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:39,938 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 18:39:39,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:39,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:39,940 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 18:39:39,941 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 18:39:39,942 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:39,952 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:39,952 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:39,952 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:39,952 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:39,953 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:39,953 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:39,955 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:39,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-04-26 18:39:39,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:39,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:39,963 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 18:39:39,963 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 18:39:39,964 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:39,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:39,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:39,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:39,974 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:39,975 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:39,975 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:39,978 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:39,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:39,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:39,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:39,985 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 18:39:39,985 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 18:39:39,986 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:39,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:39,996 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:39:39,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:39,996 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:39,996 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:39,996 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:39:39,996 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:39:39,997 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:40,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-04-26 18:39:40,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:40,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:40,004 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 18:39:40,005 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 18:39:40,006 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:40,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:40,017 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:40,017 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:40,017 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:40,019 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:40,019 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:40,024 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:40,034 INFO L436 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2025-04-26 18:39:40,034 INFO L437 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 18:39:40,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:40,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:40,036 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 18:39:40,037 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 18:39:40,038 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:40,054 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 18:39:40,055 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:39:40,055 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:40,055 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread3Thread1of1ForFork0_k, N) = -1*thread3Thread1of1ForFork0_k + 1*N Supporting invariants [] [2025-04-26 18:39:40,060 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 18:39:40,061 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:39:40,071 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:40,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 18:39:40,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 18:39:40,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:40,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:40,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:40,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:40,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:40,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:40,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:40,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:40,098 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:40,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:40,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:39:40,108 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:39:40,108 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 103647 states and 250355 transitions. cyclomatic complexity: 149412 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 18:39:41,633 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 103647 states and 250355 transitions. cyclomatic complexity: 149412. 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 220024 states and 519775 transitions. Complement of second has 6 states. [2025-04-26 18:39:41,634 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:39:41,634 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 18:39:41,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 140 transitions. [2025-04-26 18:39:41,634 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 140 transitions. Stem has 18 letters. Loop has 3 letters. [2025-04-26 18:39:41,635 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:41,635 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 140 transitions. Stem has 21 letters. Loop has 3 letters. [2025-04-26 18:39:41,635 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:41,635 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 140 transitions. Stem has 18 letters. Loop has 6 letters. [2025-04-26 18:39:41,635 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:41,635 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 220024 states and 519775 transitions. [2025-04-26 18:39:44,114 INFO L131 ngComponentsAnalysis]: Automaton has 399 accepting balls. 1370 [2025-04-26 18:39:45,360 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 220024 states to 156991 states and 366556 transitions. [2025-04-26 18:39:45,361 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36907 [2025-04-26 18:39:45,431 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37890 [2025-04-26 18:39:45,431 INFO L74 IsDeterministic]: Start isDeterministic. Operand 156991 states and 366556 transitions. [2025-04-26 18:39:45,432 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:45,432 INFO L218 hiAutomatonCegarLoop]: Abstraction has 156991 states and 366556 transitions. [2025-04-26 18:39:45,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156991 states and 366556 transitions. [2025-04-26 18:39:47,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156991 to 153909. [2025-04-26 18:39:47,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153909 states, 153909 states have (on average 2.352201625635928) internal successors, (in total 362025), 153908 states have internal predecessors, (362025), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:48,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153909 states to 153909 states and 362025 transitions. [2025-04-26 18:39:48,557 INFO L240 hiAutomatonCegarLoop]: Abstraction has 153909 states and 362025 transitions. [2025-04-26 18:39:48,557 INFO L438 stractBuchiCegarLoop]: Abstraction has 153909 states and 362025 transitions. [2025-04-26 18:39:48,558 INFO L340 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-04-26 18:39:48,558 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 153909 states and 362025 transitions. [2025-04-26 18:39:49,353 INFO L131 ngComponentsAnalysis]: Automaton has 399 accepting balls. 1370 [2025-04-26 18:39:49,353 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:49,353 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:49,354 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 18:39:49,354 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:39:49,354 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 18:39:49,355 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 18:39:49,355 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:49,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1020567077, now seen corresponding path program 1 times [2025-04-26 18:39:49,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:49,355 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387780447] [2025-04-26 18:39:49,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:49,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:49,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 18:39:49,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 18:39:49,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:49,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:49,362 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:49,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 18:39:49,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 18:39:49,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:49,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:49,371 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:49,372 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:49,372 INFO L85 PathProgramCache]: Analyzing trace with hash 166890, now seen corresponding path program 1 times [2025-04-26 18:39:49,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:49,372 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807530546] [2025-04-26 18:39:49,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:49,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:49,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:49,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:49,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:49,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:49,376 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:49,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:49,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:49,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:49,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:49,378 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:49,379 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:49,379 INFO L85 PathProgramCache]: Analyzing trace with hash -359560378, now seen corresponding path program 1 times [2025-04-26 18:39:49,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:49,379 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142958558] [2025-04-26 18:39:49,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:49,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:49,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-26 18:39:49,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 18:39:49,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:49,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:49,387 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:49,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-26 18:39:49,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 18:39:49,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:49,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:49,393 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:49,610 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:49,610 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:49,610 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:49,610 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:49,610 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:49,610 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:49,610 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:49,610 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:49,611 INFO L132 ssoRankerPreferences]: Filename of dumped script: map-aggr-update1-4modifiers.bpl_petrified1_Iteration8_Lasso [2025-04-26 18:39:49,611 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:49,611 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:49,612 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:49,614 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:49,616 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:49,618 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:49,620 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:49,637 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:49,639 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:49,640 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:49,642 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:49,644 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:49,646 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:49,647 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:49,649 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:49,650 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:49,652 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:49,654 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:49,655 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:49,657 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:49,664 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:49,669 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:49,671 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:49,672 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:49,790 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:49,790 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:49,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:49,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:49,792 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 18:39:49,794 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 18:39:49,795 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:49,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:49,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:49,805 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:49,805 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:49,807 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:49,807 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:49,809 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:49,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:49,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:49,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:49,823 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 18:39:49,828 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 18:39:49,832 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:49,845 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:49,845 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:49,845 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:49,845 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:49,846 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:49,846 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:49,848 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:49,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:49,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:49,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:49,863 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 18:39:49,865 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 18:39:49,865 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:49,874 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:49,875 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:49,875 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:49,875 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:49,879 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:49,880 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:49,882 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:49,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:49,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:49,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:49,890 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 18:39:49,891 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 18:39:49,893 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:49,902 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:49,903 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:49,903 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:49,903 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:49,904 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:49,904 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:49,906 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:49,912 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 18:39:49,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:49,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:49,915 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 18:39:49,916 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 18:39:49,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 18:39:49,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:49,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:49,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:49,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:49,927 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:49,927 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:49,930 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:49,935 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 18:39:49,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:49,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:49,936 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 18:39:49,937 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 18:39:49,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 18:39:49,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:49,948 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:49,948 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:49,948 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:49,948 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:49,948 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:49,950 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:49,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2025-04-26 18:39:49,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:49,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:49,960 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 18:39:49,961 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 18:39:49,963 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:49,973 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:49,973 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:49,973 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:49,973 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:49,974 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:49,974 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:49,976 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:49,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:49,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:49,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:49,983 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 18:39:49,984 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 18:39:49,985 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:49,995 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:49,995 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:49,995 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:49,996 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:49,998 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:49,998 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:50,000 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:50,006 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 18:39:50,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:50,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:50,008 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 18:39:50,010 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 18:39:50,011 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:50,021 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:50,021 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:50,021 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:50,021 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:50,023 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:50,023 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:50,025 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:50,031 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 18:39:50,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:50,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:50,032 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 18:39:50,033 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 18:39:50,034 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:50,043 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:50,044 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:50,044 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:50,044 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:50,044 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:50,044 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:50,046 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:50,052 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 18:39:50,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:50,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:50,054 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 18:39:50,055 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 18:39:50,056 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:50,065 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:50,065 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:50,065 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:50,065 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:50,066 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:50,066 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:50,069 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:50,075 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 18:39:50,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:50,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:50,077 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 18:39:50,078 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 18:39:50,079 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:50,088 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:50,088 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:50,088 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:50,088 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:50,089 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:50,089 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:50,092 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:50,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2025-04-26 18:39:50,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:50,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:50,100 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 18:39:50,101 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 18:39:50,102 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:50,111 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:50,111 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:50,111 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:50,111 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:50,112 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:50,112 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:50,117 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:50,123 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 18:39:50,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:50,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:50,125 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 18:39:50,127 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 18:39:50,127 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:50,137 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:50,137 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:50,137 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:50,137 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:50,138 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:50,138 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:50,140 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:50,146 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 18:39:50,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:50,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:50,148 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 18:39:50,150 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 18:39:50,150 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:50,160 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:50,160 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:50,160 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:50,160 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:50,160 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:50,161 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:50,163 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:50,168 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 18:39:50,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:50,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:50,169 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 18:39:50,170 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 18:39:50,171 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:50,181 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:50,181 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:50,181 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:50,181 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:50,182 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:50,182 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:50,185 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:50,190 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 18:39:50,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:50,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:50,192 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 18:39:50,194 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 18:39:50,194 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:50,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:50,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:50,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:50,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:50,208 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:50,208 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:50,210 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:50,216 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 18:39:50,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:50,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:50,218 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 18:39:50,219 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 18:39:50,220 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:50,229 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:50,229 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:39:50,229 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:50,229 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:50,229 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:50,229 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:39:50,230 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:39:50,231 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:50,236 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 18:39:50,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:50,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:50,239 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 18:39:50,240 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 18:39:50,240 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:39:50,250 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:50,250 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:50,250 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:50,250 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:50,251 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:50,251 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:50,255 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:50,341 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 18:39:50,341 INFO L437 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 18:39:50,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:50,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:50,343 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 18:39:50,345 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 18:39:50,346 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:50,362 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 18:39:50,362 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:39:50,362 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:50,363 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread3Thread1of1ForFork1_k, N) = -1*thread3Thread1of1ForFork1_k + 1*N Supporting invariants [] [2025-04-26 18:39:50,368 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 18:39:50,369 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:39:50,376 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:50,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 18:39:50,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 18:39:50,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:50,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:50,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:50,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:50,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:50,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:50,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:50,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:50,407 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:50,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:50,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:39:50,419 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:39:50,419 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 153909 states and 362025 transitions. cyclomatic complexity: 212228 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 18:39:52,311 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 153909 states and 362025 transitions. cyclomatic complexity: 212228. 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 319480 states and 738099 transitions. Complement of second has 6 states. [2025-04-26 18:39:52,312 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:39:52,312 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 18:39:52,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2025-04-26 18:39:52,313 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 144 transitions. Stem has 21 letters. Loop has 3 letters. [2025-04-26 18:39:52,313 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:52,313 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 144 transitions. Stem has 24 letters. Loop has 3 letters. [2025-04-26 18:39:52,313 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:52,313 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 144 transitions. Stem has 21 letters. Loop has 6 letters. [2025-04-26 18:39:52,313 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:52,313 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 319480 states and 738099 transitions. [2025-04-26 18:39:55,322 INFO L131 ngComponentsAnalysis]: Automaton has 205 accepting balls. 615 [2025-04-26 18:39:56,822 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 319480 states to 193904 states and 440840 transitions. [2025-04-26 18:39:56,822 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42973 [2025-04-26 18:39:57,077 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43662 [2025-04-26 18:39:57,077 INFO L74 IsDeterministic]: Start isDeterministic. Operand 193904 states and 440840 transitions. [2025-04-26 18:39:57,077 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:57,077 INFO L218 hiAutomatonCegarLoop]: Abstraction has 193904 states and 440840 transitions. [2025-04-26 18:39:57,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193904 states and 440840 transitions. [2025-04-26 18:39:59,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193904 to 190924. [2025-04-26 18:40:00,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190924 states, 190924 states have (on average 2.286307640736628) internal successors, (in total 436511), 190923 states have internal predecessors, (436511), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:01,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190924 states to 190924 states and 436511 transitions. [2025-04-26 18:40:01,001 INFO L240 hiAutomatonCegarLoop]: Abstraction has 190924 states and 436511 transitions. [2025-04-26 18:40:01,001 INFO L438 stractBuchiCegarLoop]: Abstraction has 190924 states and 436511 transitions. [2025-04-26 18:40:01,001 INFO L340 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-04-26 18:40:01,001 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 190924 states and 436511 transitions. [2025-04-26 18:40:02,010 INFO L131 ngComponentsAnalysis]: Automaton has 205 accepting balls. 615 [2025-04-26 18:40:02,010 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:02,010 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:02,011 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 18:40:02,011 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:40:02,012 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 18:40:02,012 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 18:40:02,012 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:02,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1939847987, now seen corresponding path program 1 times [2025-04-26 18:40:02,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:02,012 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085644011] [2025-04-26 18:40:02,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:02,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:02,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 18:40:02,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 18:40:02,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:02,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:02,017 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:02,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 18:40:02,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 18:40:02,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:02,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:02,023 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:02,023 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:02,023 INFO L85 PathProgramCache]: Analyzing trace with hash 162882, now seen corresponding path program 1 times [2025-04-26 18:40:02,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:02,024 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759552397] [2025-04-26 18:40:02,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:02,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:02,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:02,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:02,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:02,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:02,029 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:02,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:02,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:02,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:02,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:02,031 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:02,031 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:02,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1226279946, now seen corresponding path program 1 times [2025-04-26 18:40:02,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:02,031 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670525752] [2025-04-26 18:40:02,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:02,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:02,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-26 18:40:02,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-26 18:40:02,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:02,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:02,096 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 18:40:02,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:40:02,097 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670525752] [2025-04-26 18:40:02,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670525752] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 18:40:02,097 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745798321] [2025-04-26 18:40:02,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:02,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 18:40:02,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:02,099 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 18:40:02,100 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 18:40:02,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-26 18:40:02,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-26 18:40:02,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:02,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:02,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-26 18:40:02,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:02,170 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 18:40:02,170 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-26 18:40:02,223 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 18:40:02,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1745798321] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-26 18:40:02,224 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-26 18:40:02,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-04-26 18:40:02,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511624084] [2025-04-26 18:40:02,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-26 18:40:02,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:40:02,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-26 18:40:02,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-04-26 18:40:02,251 INFO L87 Difference]: Start difference. First operand 190924 states and 436511 transitions. cyclomatic complexity: 250878 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 18:40:03,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:40:03,492 INFO L93 Difference]: Finished difference Result 195677 states and 444038 transitions. [2025-04-26 18:40:03,492 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 195677 states and 444038 transitions. [2025-04-26 18:40:05,502 INFO L131 ngComponentsAnalysis]: Automaton has 205 accepting balls. 615 [2025-04-26 18:40:06,816 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 195677 states to 190942 states and 436535 transitions. [2025-04-26 18:40:06,817 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42848 [2025-04-26 18:40:06,897 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42848 [2025-04-26 18:40:06,897 INFO L74 IsDeterministic]: Start isDeterministic. Operand 190942 states and 436535 transitions. [2025-04-26 18:40:06,897 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:06,897 INFO L218 hiAutomatonCegarLoop]: Abstraction has 190942 states and 436535 transitions. [2025-04-26 18:40:07,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190942 states and 436535 transitions. [2025-04-26 18:40:09,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190942 to 190930. [2025-04-26 18:40:10,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190930 states, 190930 states have (on average 2.2862724558738803) internal successors, (in total 436518), 190929 states have internal predecessors, (436518), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:10,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190930 states to 190930 states and 436518 transitions. [2025-04-26 18:40:10,984 INFO L240 hiAutomatonCegarLoop]: Abstraction has 190930 states and 436518 transitions. [2025-04-26 18:40:10,984 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-26 18:40:10,985 INFO L438 stractBuchiCegarLoop]: Abstraction has 190930 states and 436518 transitions. [2025-04-26 18:40:10,986 INFO L340 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-04-26 18:40:10,986 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 190930 states and 436518 transitions. [2025-04-26 18:40:12,096 INFO L131 ngComponentsAnalysis]: Automaton has 205 accepting balls. 615 [2025-04-26 18:40:12,096 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:12,096 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:12,097 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 18:40:12,097 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:40:12,097 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 18:40:12,097 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 18:40:12,098 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:12,098 INFO L85 PathProgramCache]: Analyzing trace with hash 2101174358, now seen corresponding path program 2 times [2025-04-26 18:40:12,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:12,098 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072018887] [2025-04-26 18:40:12,098 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:40:12,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:12,100 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-26 18:40:12,104 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-26 18:40:12,104 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 18:40:12,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:12,104 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:12,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-26 18:40:12,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-26 18:40:12,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:12,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:12,114 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:12,115 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:12,115 INFO L85 PathProgramCache]: Analyzing trace with hash 162882, now seen corresponding path program 2 times [2025-04-26 18:40:12,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:12,115 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709916433] [2025-04-26 18:40:12,115 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:40:12,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:12,118 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:12,119 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:12,119 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:40:12,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:12,119 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:12,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:12,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:12,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:12,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:12,120 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:12,121 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:12,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1232060365, now seen corresponding path program 2 times [2025-04-26 18:40:12,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:12,121 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979124839] [2025-04-26 18:40:12,121 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:40:12,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:12,125 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-04-26 18:40:12,133 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-26 18:40:12,133 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 18:40:12,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:12,133 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:12,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-26 18:40:12,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-26 18:40:12,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:12,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:12,140 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:12,700 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:12,700 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:12,701 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:12,701 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:12,701 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:40:12,701 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:12,701 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:12,701 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:12,701 INFO L132 ssoRankerPreferences]: Filename of dumped script: map-aggr-update1-4modifiers.bpl_petrified1_Iteration10_Lasso [2025-04-26 18:40:12,701 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:12,701 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:12,703 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:12,705 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:12,711 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:12,713 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:12,714 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:12,715 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:12,717 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:12,718 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:12,720 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:12,721 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:12,723 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:12,724 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:12,726 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:12,728 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:12,730 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:12,731 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:12,733 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:12,734 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:12,735 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:12,737 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:12,738 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:12,741 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:12,744 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:12,745 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:12,747 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:12,748 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:12,750 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:12,812 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:12,814 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:12,815 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:13,034 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:13,035 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:40:13,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:13,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:13,036 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 18:40:13,038 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 18:40:13,039 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:13,049 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:13,049 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:13,050 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:13,050 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:13,051 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:13,051 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:13,053 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:13,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2025-04-26 18:40:13,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:13,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:13,062 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 18:40:13,063 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 18:40:13,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 18:40:13,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:13,074 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:13,074 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:13,074 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:13,076 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:13,076 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:13,080 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:40:13,090 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 18:40:13,090 INFO L437 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 18:40:13,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:13,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:13,092 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 18:40:13,094 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 18:40:13,095 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:40:13,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2025-04-26 18:40:13,112 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:40:13,112 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:40:13,112 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, thread3Thread1of1ForFork2_k) = 1*N - 1*thread3Thread1of1ForFork2_k Supporting invariants [] [2025-04-26 18:40:13,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2025-04-26 18:40:13,121 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:40:13,129 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:13,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-26 18:40:13,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-26 18:40:13,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:13,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:13,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:40:13,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:13,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:13,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:13,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:13,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:13,178 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:40:13,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:13,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:40:13,187 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:40:13,187 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 190930 states and 436518 transitions. cyclomatic complexity: 250879 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 18:40:14,439 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 190930 states and 436518 transitions. cyclomatic complexity: 250879. 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 195628 states and 445286 transitions. Complement of second has 6 states. [2025-04-26 18:40:14,440 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:40:14,440 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 18:40:14,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2025-04-26 18:40:14,440 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 120 transitions. Stem has 29 letters. Loop has 3 letters. [2025-04-26 18:40:14,440 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:14,440 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 120 transitions. Stem has 32 letters. Loop has 3 letters. [2025-04-26 18:40:14,440 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:14,440 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 120 transitions. Stem has 29 letters. Loop has 6 letters. [2025-04-26 18:40:14,441 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:14,441 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 195628 states and 445286 transitions. [2025-04-26 18:40:16,266 INFO L131 ngComponentsAnalysis]: Automaton has 124 accepting balls. 372 [2025-04-26 18:40:17,598 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 195628 states to 177978 states and 405014 transitions. [2025-04-26 18:40:17,599 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37426 [2025-04-26 18:40:17,677 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37587 [2025-04-26 18:40:17,678 INFO L74 IsDeterministic]: Start isDeterministic. Operand 177978 states and 405014 transitions. [2025-04-26 18:40:17,678 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:17,678 INFO L218 hiAutomatonCegarLoop]: Abstraction has 177978 states and 405014 transitions. [2025-04-26 18:40:17,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177978 states and 405014 transitions. [2025-04-26 18:40:20,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177978 to 176162. [2025-04-26 18:40:20,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176162 states, 176162 states have (on average 2.288779646007652) internal successors, (in total 403196), 176161 states have internal predecessors, (403196), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:21,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176162 states to 176162 states and 403196 transitions. [2025-04-26 18:40:21,453 INFO L240 hiAutomatonCegarLoop]: Abstraction has 176162 states and 403196 transitions. [2025-04-26 18:40:21,453 INFO L438 stractBuchiCegarLoop]: Abstraction has 176162 states and 403196 transitions. [2025-04-26 18:40:21,453 INFO L340 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-04-26 18:40:21,453 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 176162 states and 403196 transitions. [2025-04-26 18:40:22,188 INFO L131 ngComponentsAnalysis]: Automaton has 124 accepting balls. 372 [2025-04-26 18:40:22,188 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:22,188 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:22,189 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 18:40:22,189 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:40:22,189 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[]" "[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[]" "[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[]" "[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[]" "[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 18:40:22,189 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 18:40:22,190 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:22,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1966492604, now seen corresponding path program 1 times [2025-04-26 18:40:22,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:22,190 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106377244] [2025-04-26 18:40:22,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:22,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:22,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-26 18:40:22,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-26 18:40:22,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:22,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:22,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:40:22,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:40:22,244 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106377244] [2025-04-26 18:40:22,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106377244] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:40:22,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:40:22,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:40:22,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369795814] [2025-04-26 18:40:22,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:40:22,244 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:40:22,245 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:22,245 INFO L85 PathProgramCache]: Analyzing trace with hash 162882, now seen corresponding path program 3 times [2025-04-26 18:40:22,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:22,245 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876380125] [2025-04-26 18:40:22,245 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 18:40:22,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:22,247 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:22,248 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:22,248 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 18:40:22,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:22,248 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:22,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:22,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:22,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:22,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:22,250 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:22,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:40:22,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 18:40:22,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-26 18:40:22,265 INFO L87 Difference]: Start difference. First operand 176162 states and 403196 transitions. cyclomatic complexity: 231790 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 18:40:24,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:40:24,212 INFO L93 Difference]: Finished difference Result 301624 states and 691211 transitions. [2025-04-26 18:40:24,212 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 301624 states and 691211 transitions.