/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 /storage/cav23-termute-examples/2_thr/interleaved2.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:42:16,356 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:42:16,409 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:42:16,412 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:42:16,412 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:42:16,412 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:42:16,412 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:42:16,437 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:42:16,438 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:42:16,438 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:42:16,438 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:42:16,439 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:42:16,439 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:42:16,439 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:42:16,439 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:42:16,439 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:42:16,439 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:42:16,439 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:42:16,439 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:42:16,439 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:42:16,441 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:42:16,441 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:42:16,441 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:42:16,441 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:42:16,441 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:42:16,441 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:42:16,441 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:42:16,441 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:42:16,441 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:42:16,441 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:42:16,441 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:42:16,441 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:42:16,442 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:42:16,442 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:42:16,442 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:42:16,442 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:42:16,442 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:42:16,442 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:42:16,442 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:42:16,442 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:42:16,442 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:42:16,442 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:42:16,442 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:42:16,681 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:42:16,693 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:42:16,697 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:42:16,697 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:42:16,698 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:42:16,701 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/2_thr/interleaved2.c.bpl [2025-04-26 18:42:16,702 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/2_thr/interleaved2.c.bpl' [2025-04-26 18:42:16,716 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:42:16,719 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:42:16,719 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:42:16,719 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:42:16,719 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:42:16,726 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "interleaved2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:16" (1/1) ... [2025-04-26 18:42:16,747 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "interleaved2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:16" (1/1) ... [2025-04-26 18:42:16,753 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:42:16,754 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:42:16,756 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:42:16,756 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:42:16,756 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:42:16,760 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "interleaved2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:16" (1/1) ... [2025-04-26 18:42:16,760 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "interleaved2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:16" (1/1) ... [2025-04-26 18:42:16,762 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "interleaved2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:16" (1/1) ... [2025-04-26 18:42:16,763 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "interleaved2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:16" (1/1) ... [2025-04-26 18:42:16,764 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "interleaved2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:16" (1/1) ... [2025-04-26 18:42:16,765 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "interleaved2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:16" (1/1) ... [2025-04-26 18:42:16,770 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "interleaved2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:16" (1/1) ... [2025-04-26 18:42:16,771 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "interleaved2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:16" (1/1) ... [2025-04-26 18:42:16,771 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "interleaved2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:16" (1/1) ... [2025-04-26 18:42:16,780 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:42:16,783 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:42:16,783 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:42:16,783 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:42:16,784 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "interleaved2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:16" (1/1) ... [2025-04-26 18:42:16,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:42:16,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:16,812 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:42:16,815 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:42:16,839 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:42:16,839 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:42:16,839 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:42:16,839 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:42:16,839 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:42:16,839 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:42:16,839 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:42:16,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:42:16,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:42:16,840 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:42:16,888 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:42:16,890 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:42:16,966 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:42:16,966 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:42:16,979 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:42:16,980 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:42:16,980 INFO L201 PluginConnector]: Adding new model interleaved2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:42:16 BoogieIcfgContainer [2025-04-26 18:42:16,980 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:42:16,981 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:42:16,981 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:42:16,987 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:42:16,987 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:42:16,987 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "interleaved2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:16" (1/2) ... [2025-04-26 18:42:16,989 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3c6f53b2 and model type interleaved2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:42:16, skipping insertion in model container [2025-04-26 18:42:16,989 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:42:16,989 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "interleaved2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:42:16" (2/2) ... [2025-04-26 18:42:16,990 INFO L376 chiAutomizerObserver]: Analyzing ICFG interleaved2.c.bpl [2025-04-26 18:42:17,033 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 18:42:17,072 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:42:17,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:42:17,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:17,075 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:42:17,077 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:42:17,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 22 transitions, 58 flow [2025-04-26 18:42:17,144 INFO L116 PetriNetUnfolderBase]: 2/18 cut-off events. [2025-04-26 18:42:17,145 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 18:42:17,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 18 events. 2/18 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 30 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 15. Up to 2 conditions per place. [2025-04-26 18:42:17,151 INFO L82 GeneralOperation]: Start removeDead. Operand has 25 places, 22 transitions, 58 flow [2025-04-26 18:42:17,154 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 23 places, 18 transitions, 48 flow [2025-04-26 18:42:17,154 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 23 places, 18 transitions, 48 flow [2025-04-26 18:42:17,155 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 23 places, 18 transitions, 48 flow [2025-04-26 18:42:17,167 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 52 states, 51 states have (on average 1.9607843137254901) internal successors, (in total 100), 51 states have internal predecessors, (100), 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:42:17,169 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 52 states, 51 states have (on average 1.9607843137254901) internal successors, (in total 100), 51 states have internal predecessors, (100), 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:42:17,171 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:42:17,218 WARN L140 AmpleReduction]: Number of pruned transitions: 22 [2025-04-26 18:42:17,219 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:42:17,219 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 3 [2025-04-26 18:42:17,219 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:22 [2025-04-26 18:42:17,219 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:22 [2025-04-26 18:42:17,219 WARN L145 AmpleReduction]: Times succ was already a loop node:6 [2025-04-26 18:42:17,219 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:7 [2025-04-26 18:42:17,219 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:42:17,219 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 48 states, 47 states have (on average 1.4042553191489362) internal successors, (in total 66), 47 states have internal predecessors, (66), 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:42:17,225 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:42:17,225 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:42:17,225 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:42:17,225 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:42:17,225 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:42:17,225 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:42:17,225 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:42:17,225 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:42:17,226 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 48 states, 47 states have (on average 1.4042553191489362) internal successors, (in total 66), 47 states have internal predecessors, (66), 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:42:17,234 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 36 [2025-04-26 18:42:17,234 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:17,234 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:17,237 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:42:17,237 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:42:17,237 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:42:17,237 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 48 states, 47 states have (on average 1.4042553191489362) internal successors, (in total 66), 47 states have internal predecessors, (66), 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:42:17,239 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 36 [2025-04-26 18:42:17,239 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:17,239 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:17,239 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:42:17,239 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:42:17,242 INFO L752 eck$LassoCheckResult]: Stem: "[40] $Ultimate##0-->L12: Formula: (and (= v_f2_4 0) (= v_x1_5 0) (= v_x2_5 0) (= v_f1_4 0)) InVars {x1=v_x1_5, f2=v_f2_4, x2=v_x2_5, f1=v_f1_4} OutVars{x1=v_x1_5, f2=v_f2_4, x2=v_x2_5, f1=v_f1_4} AuxVars[] AssignedVars[]" "[60] L12-->L25-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 18:42:17,242 INFO L754 eck$LassoCheckResult]: Loop: "[47] L25-1-->L23: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[49] L23-->L24: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[50] L24-->L25: Formula: (= v_f2_1 1) InVars {} OutVars{f2=v_f2_1} AuxVars[] AssignedVars[f2]" "[51] L25-->L25-1: Formula: (and (< 0 v_f1_6) (= v_f1_5 0)) InVars {f1=v_f1_6} OutVars{f1=v_f1_5} AuxVars[] AssignedVars[f1]" [2025-04-26 18:42:17,245 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:17,246 INFO L85 PathProgramCache]: Analyzing trace with hash 2261, now seen corresponding path program 1 times [2025-04-26 18:42:17,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:17,250 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992106000] [2025-04-26 18:42:17,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:17,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:17,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:17,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:17,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:17,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:17,293 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:17,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:17,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:17,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:17,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:17,308 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:17,313 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:17,313 INFO L85 PathProgramCache]: Analyzing trace with hash 2372388, now seen corresponding path program 1 times [2025-04-26 18:42:17,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:17,313 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783401862] [2025-04-26 18:42:17,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:17,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:17,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:17,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:17,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:17,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:17,324 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:17,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:17,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:17,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:17,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:17,330 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:17,333 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:17,333 INFO L85 PathProgramCache]: Analyzing trace with hash 2089529848, now seen corresponding path program 1 times [2025-04-26 18:42:17,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:17,334 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236242382] [2025-04-26 18:42:17,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:17,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:17,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:42:17,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:42:17,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:17,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:17,402 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:42:17,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:42:17,405 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236242382] [2025-04-26 18:42:17,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236242382] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:42:17,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:42:17,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-26 18:42:17,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603387926] [2025-04-26 18:42:17,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:42:17,513 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:17,513 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:17,513 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:17,513 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:17,513 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:17,513 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:17,513 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:17,513 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:17,514 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved2.c.bpl_petrified1_Iteration1_Loop [2025-04-26 18:42:17,514 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:17,514 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:17,538 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:17,545 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:17,555 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:17,605 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:17,605 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:17,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:17,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:17,609 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:42:17,611 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:42:17,612 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:17,613 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:17,628 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:42:17,629 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f2=1} Honda state: {f2=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:42:17,635 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:42:17,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:17,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:17,636 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:42:17,637 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:42:17,638 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:17,638 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:17,668 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:42:17,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:17,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:17,671 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:42:17,676 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:42:17,676 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:17,676 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:17,712 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:17,715 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:42:17,715 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:17,716 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:17,716 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:17,716 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:17,716 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:17,716 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:17,716 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:17,716 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:17,716 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved2.c.bpl_petrified1_Iteration1_Loop [2025-04-26 18:42:17,716 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:17,716 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:17,718 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:17,723 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:17,728 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:17,765 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:17,768 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:17,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:17,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:17,771 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:42:17,772 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:42:17,776 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:42:17,788 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:17,788 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:17,788 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:17,788 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:17,788 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:17,794 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:17,794 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:17,796 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:17,799 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:42:17,799 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:17,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:17,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:17,824 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:42:17,825 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:42:17,825 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:17,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 18:42:17,828 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:17,829 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:17,829 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(f1) = 1*f1 Supporting invariants [] [2025-04-26 18:42:17,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 18:42:17,837 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:17,854 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:17,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:17,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:17,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:17,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:17,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:17,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:17,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:17,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:17,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:17,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:17,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:17,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:17,877 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:42:17,890 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 18:42:17,891 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 48 states, 47 states have (on average 1.4042553191489362) internal successors, (in total 66), 47 states have internal predecessors, (66), 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:42:17,930 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 48 states, 47 states have (on average 1.4042553191489362) internal successors, (in total 66), 47 states have internal predecessors, (66), 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 123 states and 166 transitions. Complement of second has 5 states. [2025-04-26 18:42:17,931 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 18:42:17,934 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:42:17,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2025-04-26 18:42:17,937 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 18:42:17,938 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:17,938 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 6 letters. Loop has 4 letters. [2025-04-26 18:42:17,938 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:17,938 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 2 letters. Loop has 8 letters. [2025-04-26 18:42:17,938 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:17,939 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 166 transitions. [2025-04-26 18:42:17,942 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 32 [2025-04-26 18:42:17,944 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 75 states and 102 transitions. [2025-04-26 18:42:17,945 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2025-04-26 18:42:17,945 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2025-04-26 18:42:17,945 INFO L74 IsDeterministic]: Start isDeterministic. Operand 75 states and 102 transitions. [2025-04-26 18:42:17,945 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:17,945 INFO L218 hiAutomatonCegarLoop]: Abstraction has 75 states and 102 transitions. [2025-04-26 18:42:17,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 102 transitions. [2025-04-26 18:42:17,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 66. [2025-04-26 18:42:17,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 66 states have (on average 1.393939393939394) internal successors, (in total 92), 65 states have internal predecessors, (92), 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:42:17,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 92 transitions. [2025-04-26 18:42:17,961 INFO L240 hiAutomatonCegarLoop]: Abstraction has 66 states and 92 transitions. [2025-04-26 18:42:17,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:42:17,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:42:17,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:42:17,963 INFO L87 Difference]: Start difference. First operand 66 states and 92 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (in total 6), 2 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:42:17,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:42:17,974 INFO L93 Difference]: Finished difference Result 77 states and 96 transitions. [2025-04-26 18:42:17,975 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 96 transitions. [2025-04-26 18:42:17,976 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 30 [2025-04-26 18:42:17,976 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 54 states and 69 transitions. [2025-04-26 18:42:17,976 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2025-04-26 18:42:17,976 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2025-04-26 18:42:17,976 INFO L74 IsDeterministic]: Start isDeterministic. Operand 54 states and 69 transitions. [2025-04-26 18:42:17,977 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:42:17,977 INFO L218 hiAutomatonCegarLoop]: Abstraction has 54 states and 69 transitions. [2025-04-26 18:42:17,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 69 transitions. [2025-04-26 18:42:17,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 40. [2025-04-26 18:42:17,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.3) internal successors, (in total 52), 39 states have internal predecessors, (52), 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:42:17,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2025-04-26 18:42:17,979 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 52 transitions. [2025-04-26 18:42:17,979 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:42:17,980 INFO L438 stractBuchiCegarLoop]: Abstraction has 40 states and 52 transitions. [2025-04-26 18:42:17,980 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:42:17,980 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 52 transitions. [2025-04-26 18:42:17,980 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 30 [2025-04-26 18:42:17,980 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:17,980 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:17,980 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 18:42:17,980 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:42:17,981 INFO L752 eck$LassoCheckResult]: Stem: "[40] $Ultimate##0-->L12: Formula: (and (= v_f2_4 0) (= v_x1_5 0) (= v_x2_5 0) (= v_f1_4 0)) InVars {x1=v_x1_5, f2=v_f2_4, x2=v_x2_5, f1=v_f1_4} OutVars{x1=v_x1_5, f2=v_f2_4, x2=v_x2_5, f1=v_f1_4} AuxVars[] AssignedVars[]" "[60] L12-->L25-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[46] L25-1-->thread1FINAL: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" "[48] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[63] L12-1-->L36: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-04-26 18:42:17,981 INFO L754 eck$LassoCheckResult]: Loop: "[53] L36-->L38: Formula: (< v_x2_2 v_z_4) InVars {x2=v_x2_2, z=v_z_4} OutVars{x2=v_x2_2, z=v_z_4} AuxVars[] AssignedVars[]" "[55] L38-->L38-1: Formula: (and (< 0 v_f2_6) (= v_f2_5 0)) InVars {f2=v_f2_6} OutVars{f2=v_f2_5} AuxVars[] AssignedVars[f2]" "[56] L38-1-->L44: Formula: (= v_x2_3 (+ v_x2_4 1)) InVars {x2=v_x2_4} OutVars{x2=v_x2_3} AuxVars[] AssignedVars[x2]" "[57] L44-->L36: Formula: (= v_f1_3 1) InVars {} OutVars{f1=v_f1_3} AuxVars[] AssignedVars[f1]" [2025-04-26 18:42:17,981 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:17,981 INFO L85 PathProgramCache]: Analyzing trace with hash 67403208, now seen corresponding path program 1 times [2025-04-26 18:42:17,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:17,981 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655066408] [2025-04-26 18:42:17,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:17,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:17,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:17,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:17,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:17,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:17,987 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:17,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:17,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:17,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:17,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:17,990 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:17,990 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:17,990 INFO L85 PathProgramCache]: Analyzing trace with hash 2557092, now seen corresponding path program 1 times [2025-04-26 18:42:17,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:17,990 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208305151] [2025-04-26 18:42:17,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:17,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:17,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:17,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:17,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:17,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:17,994 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:17,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:17,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:17,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:17,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:17,997 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:17,998 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:17,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1318668011, now seen corresponding path program 1 times [2025-04-26 18:42:17,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:17,998 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265101881] [2025-04-26 18:42:17,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:17,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:18,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:42:18,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:42:18,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:18,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:18,019 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:42:18,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:42:18,019 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265101881] [2025-04-26 18:42:18,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265101881] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:42:18,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:42:18,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 18:42:18,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257462733] [2025-04-26 18:42:18,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:42:18,059 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:18,060 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:18,060 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:18,060 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:18,060 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:18,060 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:18,060 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:18,060 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:18,060 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved2.c.bpl_petrified1_Iteration2_Loop [2025-04-26 18:42:18,060 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:18,060 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:18,060 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:18,065 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:18,067 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:18,098 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:18,098 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:18,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:18,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:18,100 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:42:18,101 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:42:18,103 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:18,103 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:18,118 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:42:18,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:18,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:18,120 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:42:18,121 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:42:18,122 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:18,122 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:18,145 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:18,149 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:42:18,149 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:18,149 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:18,149 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:18,149 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:18,149 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:18,149 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:18,149 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:18,149 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:18,149 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved2.c.bpl_petrified1_Iteration2_Loop [2025-04-26 18:42:18,149 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:18,149 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:18,150 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:18,155 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:18,158 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:18,193 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:18,193 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:18,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:18,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:18,195 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:42:18,196 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:42:18,197 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:42:18,206 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:18,206 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:18,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:18,206 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:18,206 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:18,207 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:18,207 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:18,209 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:18,211 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:42:18,211 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:18,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:18,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:18,213 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:42:18,213 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:42:18,214 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:18,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 18:42:18,217 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:18,217 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:18,217 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(f2) = 1*f2 Supporting invariants [] [2025-04-26 18:42:18,222 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:42:18,223 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:18,238 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:18,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:18,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:18,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:18,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:18,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:18,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:18,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:18,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:18,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:18,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:18,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:18,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:18,288 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:42:18,289 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:42:18,289 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 52 transitions. cyclomatic complexity: 16 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (in total 9), 4 states have internal predecessors, (9), 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:42:18,304 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 52 transitions. cyclomatic complexity: 16. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (in total 9), 4 states have internal predecessors, (9), 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 99 states and 130 transitions. Complement of second has 5 states. [2025-04-26 18:42:18,304 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 18:42:18,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (in total 9), 4 states have internal predecessors, (9), 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:42:18,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2025-04-26 18:42:18,305 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 18:42:18,305 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:18,305 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 9 letters. Loop has 4 letters. [2025-04-26 18:42:18,305 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:18,305 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 5 letters. Loop has 8 letters. [2025-04-26 18:42:18,305 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:18,305 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 130 transitions. [2025-04-26 18:42:18,307 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 30 [2025-04-26 18:42:18,308 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 71 states and 93 transitions. [2025-04-26 18:42:18,308 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2025-04-26 18:42:18,308 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2025-04-26 18:42:18,308 INFO L74 IsDeterministic]: Start isDeterministic. Operand 71 states and 93 transitions. [2025-04-26 18:42:18,308 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:18,308 INFO L218 hiAutomatonCegarLoop]: Abstraction has 71 states and 93 transitions. [2025-04-26 18:42:18,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 93 transitions. [2025-04-26 18:42:18,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2025-04-26 18:42:18,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 68 states have (on average 1.3088235294117647) internal successors, (in total 89), 67 states have internal predecessors, (89), 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:42:18,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 89 transitions. [2025-04-26 18:42:18,311 INFO L240 hiAutomatonCegarLoop]: Abstraction has 68 states and 89 transitions. [2025-04-26 18:42:18,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:42:18,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:42:18,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:42:18,312 INFO L87 Difference]: Start difference. First operand 68 states and 89 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 2 states have internal predecessors, (9), 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:42:18,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:42:18,318 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2025-04-26 18:42:18,318 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 33 transitions. [2025-04-26 18:42:18,319 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-04-26 18:42:18,321 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 24 states and 25 transitions. [2025-04-26 18:42:18,321 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2025-04-26 18:42:18,321 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2025-04-26 18:42:18,321 INFO L74 IsDeterministic]: Start isDeterministic. Operand 24 states and 25 transitions. [2025-04-26 18:42:18,321 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:42:18,321 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 25 transitions. [2025-04-26 18:42:18,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 25 transitions. [2025-04-26 18:42:18,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 16. [2025-04-26 18:42:18,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.0625) internal successors, (in total 17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:18,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2025-04-26 18:42:18,322 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 17 transitions. [2025-04-26 18:42:18,324 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:42:18,324 INFO L438 stractBuchiCegarLoop]: Abstraction has 16 states and 17 transitions. [2025-04-26 18:42:18,324 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:42:18,324 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 17 transitions. [2025-04-26 18:42:18,325 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-04-26 18:42:18,325 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:18,325 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:18,325 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 18:42:18,325 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:42:18,325 INFO L752 eck$LassoCheckResult]: Stem: "[40] $Ultimate##0-->L12: Formula: (and (= v_f2_4 0) (= v_x1_5 0) (= v_x2_5 0) (= v_f1_4 0)) InVars {x1=v_x1_5, f2=v_f2_4, x2=v_x2_5, f1=v_f1_4} OutVars{x1=v_x1_5, f2=v_f2_4, x2=v_x2_5, f1=v_f1_4} AuxVars[] AssignedVars[]" "[60] L12-->L25-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[47] L25-1-->L23: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[49] L23-->L24: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[63] L12-1-->L36: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[53] L36-->L38: Formula: (< v_x2_2 v_z_4) InVars {x2=v_x2_2, z=v_z_4} OutVars{x2=v_x2_2, z=v_z_4} AuxVars[] AssignedVars[]" [2025-04-26 18:42:18,325 INFO L754 eck$LassoCheckResult]: Loop: "[50] L24-->L25: Formula: (= v_f2_1 1) InVars {} OutVars{f2=v_f2_1} AuxVars[] AssignedVars[f2]" "[55] L38-->L38-1: Formula: (and (< 0 v_f2_6) (= v_f2_5 0)) InVars {f2=v_f2_6} OutVars{f2=v_f2_5} AuxVars[] AssignedVars[f2]" "[56] L38-1-->L44: Formula: (= v_x2_3 (+ v_x2_4 1)) InVars {x2=v_x2_4} OutVars{x2=v_x2_3} AuxVars[] AssignedVars[x2]" "[57] L44-->L36: Formula: (= v_f1_3 1) InVars {} OutVars{f1=v_f1_3} AuxVars[] AssignedVars[f1]" "[53] L36-->L38: Formula: (< v_x2_2 v_z_4) InVars {x2=v_x2_2, z=v_z_4} OutVars{x2=v_x2_2, z=v_z_4} AuxVars[] AssignedVars[]" "[51] L25-->L25-1: Formula: (and (< 0 v_f1_6) (= v_f1_5 0)) InVars {f1=v_f1_6} OutVars{f1=v_f1_5} AuxVars[] AssignedVars[f1]" "[47] L25-1-->L23: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[49] L23-->L24: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" [2025-04-26 18:42:18,326 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:18,326 INFO L85 PathProgramCache]: Analyzing trace with hash 2089530253, now seen corresponding path program 1 times [2025-04-26 18:42:18,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:18,326 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974282270] [2025-04-26 18:42:18,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:18,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:18,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:42:18,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:42:18,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:18,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:18,330 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:18,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:42:18,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:42:18,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:18,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:18,334 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:18,335 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:18,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1635686137, now seen corresponding path program 1 times [2025-04-26 18:42:18,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:18,335 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166801725] [2025-04-26 18:42:18,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:18,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:18,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:42:18,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:42:18,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:18,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:18,343 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:18,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:42:18,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:42:18,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:18,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:18,350 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:18,350 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:18,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1326895251, now seen corresponding path program 1 times [2025-04-26 18:42:18,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:18,350 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730795591] [2025-04-26 18:42:18,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:18,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:18,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:42:18,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:42:18,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:18,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:18,360 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:18,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:42:18,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:42:18,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:18,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:18,370 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:18,436 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:18,436 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:18,436 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:18,436 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:18,436 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:18,436 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:18,436 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:18,436 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:18,436 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved2.c.bpl_petrified1_Iteration3_Loop [2025-04-26 18:42:18,436 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:18,436 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:18,437 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:18,444 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:18,446 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:18,483 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:18,483 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:18,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:18,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:18,485 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:42:18,486 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:42:18,487 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:18,487 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:18,505 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:42:18,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:18,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:18,507 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:42:18,507 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:42:18,510 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:18,510 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:18,651 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:18,656 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:42:18,657 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:18,657 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:18,657 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:18,657 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:18,657 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:18,657 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:18,657 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:18,657 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:18,657 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved2.c.bpl_petrified1_Iteration3_Loop [2025-04-26 18:42:18,657 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:18,657 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:18,658 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:18,665 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:18,670 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:18,713 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:18,714 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:18,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:18,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:18,716 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:42:18,717 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:42:18,719 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:42:18,729 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:18,729 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:18,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:18,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:18,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:18,731 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:18,731 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:18,735 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:18,740 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:42:18,740 INFO L437 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:18,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:18,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:18,742 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:42:18,745 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:42:18,745 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:18,749 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:42:18,749 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:18,749 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:18,749 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, z) = -1*x1 + 1*z Supporting invariants [] [2025-04-26 18:42:18,757 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:42:18,759 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:18,769 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:18,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:42:18,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:42:18,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:18,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:18,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:18,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:18,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:42:18,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:42:18,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:18,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:18,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:18,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:18,832 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:42:18,832 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:42:18,832 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 17 transitions. cyclomatic complexity: 2 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (in total 14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:18,854 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 17 transitions. cyclomatic complexity: 2. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (in total 14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 26 states and 29 transitions. Complement of second has 6 states. [2025-04-26 18:42:18,855 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:42:18,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (in total 14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:18,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2025-04-26 18:42:18,855 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 6 letters. Loop has 8 letters. [2025-04-26 18:42:18,855 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:18,855 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 14 letters. Loop has 8 letters. [2025-04-26 18:42:18,856 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:18,856 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 6 letters. Loop has 16 letters. [2025-04-26 18:42:18,856 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:18,856 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 29 transitions. [2025-04-26 18:42:18,856 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:42:18,856 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 0 states and 0 transitions. [2025-04-26 18:42:18,857 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:42:18,857 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:42:18,857 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:42:18,857 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:42:18,857 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:18,857 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:18,857 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:18,857 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:42:18,857 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:42:18,857 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:42:18,857 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:42:18,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:18,868 INFO L201 PluginConnector]: Adding new model interleaved2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:42:18 BoogieIcfgContainer [2025-04-26 18:42:18,868 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:42:18,869 INFO L158 Benchmark]: Toolchain (without parser) took 2151.08ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 87.6MB in the beginning and 43.5MB in the end (delta: 44.1MB). Peak memory consumption was 41.7MB. Max. memory is 8.0GB. [2025-04-26 18:42:18,869 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.84ms. Allocated memory is still 159.4MB. Free memory is still 88.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:18,869 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.33ms. Allocated memory is still 159.4MB. Free memory was 87.6MB in the beginning and 85.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:18,870 INFO L158 Benchmark]: Boogie Preprocessor took 27.19ms. Allocated memory is still 159.4MB. Free memory was 85.6MB in the beginning and 84.7MB in the end (delta: 957.6kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:18,870 INFO L158 Benchmark]: RCFGBuilder took 197.14ms. Allocated memory is still 159.4MB. Free memory was 84.7MB in the beginning and 75.5MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:42:18,870 INFO L158 Benchmark]: BuchiAutomizer took 1887.23ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 75.5MB in the beginning and 43.5MB in the end (delta: 32.0MB). Peak memory consumption was 33.3MB. Max. memory is 8.0GB. [2025-04-26 18:42:18,871 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.84ms. Allocated memory is still 159.4MB. Free memory is still 88.4MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.33ms. Allocated memory is still 159.4MB. Free memory was 87.6MB in the beginning and 85.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 27.19ms. Allocated memory is still 159.4MB. Free memory was 85.6MB in the beginning and 84.7MB in the end (delta: 957.6kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 197.14ms. Allocated memory is still 159.4MB. Free memory was 84.7MB in the beginning and 75.5MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1887.23ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 75.5MB in the beginning and 43.5MB in the end (delta: 32.0MB). Peak memory consumption was 33.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.7s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 34 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 59 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 56 mSDsluCounter, 84 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 49 IncrementalHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 54 mSDtfsCounter, 49 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT2 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital23 mio100 ax100 hnf100 lsp64 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq151 hnf94 smp100 dnf100 smp100 tf109 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 60ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 151, Number of transitions in reduction automaton: 66, Number of states in reduction automaton: 48, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function f1 and consists of 3 locations. One deterministic module has affine ranking function f2 and consists of 3 locations. One deterministic module has affine ranking function -1 * x1 + z and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 3 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:42:18,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...