/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/4_plus_thr/interleaved4.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:58:33,517 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:58:33,573 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:58:33,579 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:58:33,579 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:58:33,579 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:58:33,579 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:58:33,599 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:58:33,600 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:58:33,600 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:58:33,600 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:58:33,600 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:58:33,600 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:58:33,600 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:58:33,600 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:58:33,601 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:58:33,601 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:58:33,601 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:58:33,601 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:58:33,601 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:58:33,601 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:58:33,601 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:58:33,601 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:58:33,601 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:58:33,601 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:58:33,601 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:58:33,601 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:58:33,601 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:58:33,603 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:58:33,603 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:58:33,603 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:58:33,603 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:58:33,603 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:58:33,603 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:58:33,603 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:58:33,603 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:58:33,604 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:58:33,604 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:58:33,604 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:58:33,604 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:58:33,604 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:58:33,604 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:58:33,604 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:58:33,832 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:58:33,838 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:58:33,840 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:58:33,840 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:58:33,841 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:58:33,842 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/4_plus_thr/interleaved4.c.bpl [2025-04-26 16:58:33,842 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/4_plus_thr/interleaved4.c.bpl' [2025-04-26 16:58:33,862 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:58:33,863 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:58:33,864 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:58:33,864 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:58:33,864 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:58:33,871 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "interleaved4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:33" (1/1) ... [2025-04-26 16:58:33,897 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "interleaved4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:33" (1/1) ... [2025-04-26 16:58:33,902 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:58:33,902 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:58:33,904 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:58:33,904 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:58:33,904 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:58:33,908 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "interleaved4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:33" (1/1) ... [2025-04-26 16:58:33,908 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "interleaved4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:33" (1/1) ... [2025-04-26 16:58:33,911 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "interleaved4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:33" (1/1) ... [2025-04-26 16:58:33,911 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "interleaved4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:33" (1/1) ... [2025-04-26 16:58:33,912 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "interleaved4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:33" (1/1) ... [2025-04-26 16:58:33,913 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "interleaved4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:33" (1/1) ... [2025-04-26 16:58:33,916 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "interleaved4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:33" (1/1) ... [2025-04-26 16:58:33,918 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "interleaved4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:33" (1/1) ... [2025-04-26 16:58:33,919 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "interleaved4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:33" (1/1) ... [2025-04-26 16:58:33,929 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:58:33,930 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:58:33,930 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:58:33,930 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:58:33,931 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "interleaved4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:33" (1/1) ... [2025-04-26 16:58:33,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:58:33,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:33,960 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:33,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 16:58:33,983 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:58:33,983 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:58:33,983 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:58:33,983 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:58:33,983 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:58:33,983 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:58:33,983 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:58:33,984 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:58:33,984 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:58:33,984 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:58:33,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:58:33,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:58:33,984 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 16:58:33,984 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 16:58:33,984 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 16:58:33,985 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:58:34,024 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:58:34,026 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:58:34,124 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:58:34,124 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:58:34,141 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:58:34,141 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:58:34,141 INFO L201 PluginConnector]: Adding new model interleaved4.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:58:34 BoogieIcfgContainer [2025-04-26 16:58:34,141 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:58:34,143 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:58:34,143 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:58:34,147 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:58:34,148 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:58:34,148 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "interleaved4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:33" (1/2) ... [2025-04-26 16:58:34,149 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@623c5457 and model type interleaved4.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:58:34, skipping insertion in model container [2025-04-26 16:58:34,150 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:58:34,150 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "interleaved4.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:58:34" (2/2) ... [2025-04-26 16:58:34,150 INFO L376 chiAutomizerObserver]: Analyzing ICFG interleaved4.c.bpl [2025-04-26 16:58:34,206 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-26 16:58:34,246 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:58:34,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:58:34,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:34,248 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:34,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 16:58:34,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 42 transitions, 112 flow [2025-04-26 16:58:34,330 INFO L116 PetriNetUnfolderBase]: 4/34 cut-off events. [2025-04-26 16:58:34,332 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-26 16:58:34,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 34 events. 4/34 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 86 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2025-04-26 16:58:34,337 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 42 transitions, 112 flow [2025-04-26 16:58:34,341 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 34 transitions, 92 flow [2025-04-26 16:58:34,342 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 43 places, 34 transitions, 92 flow [2025-04-26 16:58:34,347 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:58:34,553 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 688#[L52, L76, L20, L61-1]true [2025-04-26 16:58:34,637 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1842#[L61, L46-1, thread4EXIT, L32, L19]true [2025-04-26 16:58:34,673 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 2020#[L76, L52, L32, L61-1, L19]true [2025-04-26 16:58:34,678 WARN L140 AmpleReduction]: Number of pruned transitions: 1462 [2025-04-26 16:58:34,678 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 3 [2025-04-26 16:58:34,679 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 111 [2025-04-26 16:58:34,680 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:48 [2025-04-26 16:58:34,680 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:665 [2025-04-26 16:58:34,680 WARN L145 AmpleReduction]: Times succ was already a loop node:62 [2025-04-26 16:58:34,680 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:197 [2025-04-26 16:58:34,680 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:58:34,684 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 822 states, 821 states have (on average 1.594397076735688) internal successors, (in total 1309), 821 states have internal predecessors, (1309), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:34,692 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:58:34,692 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:58:34,692 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:58:34,692 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:58:34,693 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:58:34,693 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:58:34,693 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:58:34,693 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:58:34,696 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 822 states, 821 states have (on average 1.594397076735688) internal successors, (in total 1309), 821 states have internal predecessors, (1309), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:34,734 INFO L131 ngComponentsAnalysis]: Automaton has 82 accepting balls. 634 [2025-04-26 16:58:34,735 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:34,735 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:34,739 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:58:34,739 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:58:34,739 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:58:34,741 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 822 states, 821 states have (on average 1.594397076735688) internal successors, (in total 1309), 821 states have internal predecessors, (1309), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:34,751 INFO L131 ngComponentsAnalysis]: Automaton has 82 accepting balls. 634 [2025-04-26 16:58:34,752 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:34,752 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:34,752 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:58:34,752 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:58:34,758 INFO L752 eck$LassoCheckResult]: Stem: "[83] $Ultimate##0-->L16: Formula: (and (= v_f3_4 0) (= v_f2_4 0) (= v_f1_3 0) (= v_x3_5 0) (= v_x1_5 0) (= v_x4_1 0) (= v_f4_2 0) (= v_x2_5 0)) InVars {f4=v_f4_2, f2=v_f2_4, x4=v_x4_1, f3=v_f3_4, x2=v_x2_5, f1=v_f1_3, x3=v_x3_5, x1=v_x1_5} OutVars{f4=v_f4_2, f2=v_f2_4, x4=v_x4_1, f3=v_f3_4, x2=v_x2_5, f1=v_f1_3, x3=v_x3_5, x1=v_x1_5} AuxVars[] AssignedVars[]" "[123] L16-->L33-1: Formula: (= v_thread1Thread1of1ForFork3_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork3_thidvar0=v_thread1Thread1of1ForFork3_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_thidvar0]" [2025-04-26 16:58:34,758 INFO L754 eck$LassoCheckResult]: Loop: "[89] L33-1-->L31: 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[]" "[91] L31-->L32: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[92] L32-->L33: Formula: (= v_f2_1 1) InVars {} OutVars{f2=v_f2_1} AuxVars[] AssignedVars[f2]" "[93] L33-->L33-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 16:58:34,761 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:34,762 INFO L85 PathProgramCache]: Analyzing trace with hash 3657, now seen corresponding path program 1 times [2025-04-26 16:58:34,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:34,767 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138715470] [2025-04-26 16:58:34,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:34,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:34,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:34,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:34,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:34,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:34,814 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:34,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:34,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:34,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:34,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:34,839 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:34,843 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:34,843 INFO L85 PathProgramCache]: Analyzing trace with hash 3665316, now seen corresponding path program 1 times [2025-04-26 16:58:34,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:34,844 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643235866] [2025-04-26 16:58:34,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:34,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:34,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:58:34,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:58:34,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:34,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:34,862 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:34,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:58:34,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:58:34,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:34,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:34,868 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:34,871 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:34,871 INFO L85 PathProgramCache]: Analyzing trace with hash -914909204, now seen corresponding path program 1 times [2025-04-26 16:58:34,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:34,871 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620460599] [2025-04-26 16:58:34,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:34,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:34,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:58:34,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:58:34,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:34,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:34,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:58:34,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:58:34,988 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620460599] [2025-04-26 16:58:34,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620460599] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:58:34,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:58:34,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-26 16:58:34,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962128391] [2025-04-26 16:58:34,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:58:35,055 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:35,056 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:35,056 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:35,056 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:35,056 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:58:35,056 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:35,056 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:35,056 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:35,056 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved4.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:58:35,056 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:35,057 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:35,069 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:35,078 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:35,087 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:35,146 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:35,146 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:58:35,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:35,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:35,151 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:35,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:58:35,154 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:35,154 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:35,172 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:58:35,173 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f2=1} Honda state: {f2=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:58:35,180 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 16:58:35,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:35,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:35,182 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:35,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:58:35,186 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:35,186 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:35,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:35,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:35,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:35,206 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:35,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:58:35,210 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:35,210 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:35,239 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:58:35,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:35,243 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:35,243 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:35,243 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:35,243 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:35,244 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:58:35,244 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:35,244 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:35,244 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:35,244 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved4.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:58:35,244 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:35,244 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:35,245 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:35,255 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:35,258 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:35,301 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:35,304 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:58:35,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:35,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:35,308 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:35,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:58:35,314 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:58:35,325 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:35,326 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:35,326 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:35,326 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:35,326 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:35,332 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:35,332 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:35,336 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:58:35,340 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:58:35,341 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:58:35,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:35,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:35,344 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:35,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:58:35,347 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:58:35,349 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:58:35,350 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 16:58:35,350 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:58:35,351 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:58:35,351 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(f1) = 1*f1 Supporting invariants [] [2025-04-26 16:58:35,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 16:58:35,363 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:58:35,380 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:35,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:35,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:35,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:35,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:35,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:58:35,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:35,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:58:35,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:58:35,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:35,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:35,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:58:35,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:35,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:58:35,436 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 16:58:35,439 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 822 states, 821 states have (on average 1.594397076735688) internal successors, (in total 1309), 821 states have internal predecessors, (1309), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:35,551 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 822 states, 821 states have (on average 1.594397076735688) internal successors, (in total 1309), 821 states have internal predecessors, (1309), 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 2215 states and 3500 transitions. Complement of second has 5 states. [2025-04-26 16:58:35,552 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 16:58:35,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:35,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2025-04-26 16:58:35,562 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 16:58:35,563 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:35,564 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 6 letters. Loop has 4 letters. [2025-04-26 16:58:35,564 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:35,564 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 2 letters. Loop has 8 letters. [2025-04-26 16:58:35,564 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:35,565 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2215 states and 3500 transitions. [2025-04-26 16:58:35,587 INFO L131 ngComponentsAnalysis]: Automaton has 139 accepting balls. 853 [2025-04-26 16:58:35,611 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2215 states to 1620 states and 2486 transitions. [2025-04-26 16:58:35,612 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1178 [2025-04-26 16:58:35,615 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1257 [2025-04-26 16:58:35,616 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1620 states and 2486 transitions. [2025-04-26 16:58:35,617 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:58:35,617 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1620 states and 2486 transitions. [2025-04-26 16:58:35,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1620 states and 2486 transitions. [2025-04-26 16:58:35,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1620 to 1305. [2025-04-26 16:58:35,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1305 states, 1305 states have (on average 1.546360153256705) internal successors, (in total 2018), 1304 states have internal predecessors, (2018), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:35,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1305 states to 1305 states and 2018 transitions. [2025-04-26 16:58:35,700 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1305 states and 2018 transitions. [2025-04-26 16:58:35,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:58:35,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:58:35,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:58:35,703 INFO L87 Difference]: Start difference. First operand 1305 states and 2018 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 16:58:35,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:58:35,744 INFO L93 Difference]: Finished difference Result 1453 states and 2140 transitions. [2025-04-26 16:58:35,744 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1453 states and 2140 transitions. [2025-04-26 16:58:35,758 INFO L131 ngComponentsAnalysis]: Automaton has 123 accepting balls. 804 [2025-04-26 16:58:35,766 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1453 states to 1163 states and 1741 transitions. [2025-04-26 16:58:35,768 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1163 [2025-04-26 16:58:35,770 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1163 [2025-04-26 16:58:35,770 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1163 states and 1741 transitions. [2025-04-26 16:58:35,777 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:58:35,777 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1163 states and 1741 transitions. [2025-04-26 16:58:35,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states and 1741 transitions. [2025-04-26 16:58:35,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 798. [2025-04-26 16:58:35,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 798 states have (on average 1.5012531328320802) internal successors, (in total 1198), 797 states have internal predecessors, (1198), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:35,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1198 transitions. [2025-04-26 16:58:35,801 INFO L240 hiAutomatonCegarLoop]: Abstraction has 798 states and 1198 transitions. [2025-04-26 16:58:35,804 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:58:35,804 INFO L438 stractBuchiCegarLoop]: Abstraction has 798 states and 1198 transitions. [2025-04-26 16:58:35,804 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:58:35,805 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 798 states and 1198 transitions. [2025-04-26 16:58:35,821 INFO L131 ngComponentsAnalysis]: Automaton has 70 accepting balls. 562 [2025-04-26 16:58:35,821 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:35,821 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:35,821 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:58:35,821 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:58:35,822 INFO L752 eck$LassoCheckResult]: Stem: "[83] $Ultimate##0-->L16: Formula: (and (= v_f3_4 0) (= v_f2_4 0) (= v_f1_3 0) (= v_x3_5 0) (= v_x1_5 0) (= v_x4_1 0) (= v_f4_2 0) (= v_x2_5 0)) InVars {f4=v_f4_2, f2=v_f2_4, x4=v_x4_1, f3=v_f3_4, x2=v_x2_5, f1=v_f1_3, x3=v_x3_5, x1=v_x1_5} OutVars{f4=v_f4_2, f2=v_f2_4, x4=v_x4_1, f3=v_f3_4, x2=v_x2_5, f1=v_f1_3, x3=v_x3_5, x1=v_x1_5} AuxVars[] AssignedVars[]" "[123] L16-->L33-1: Formula: (= v_thread1Thread1of1ForFork3_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork3_thidvar0=v_thread1Thread1of1ForFork3_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_thidvar0]" "[88] L33-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[]" "[90] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[114] L16-1-->L44: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" [2025-04-26 16:58:35,822 INFO L754 eck$LassoCheckResult]: Loop: "[95] L44-->L46: 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[]" "[97] L46-->L46-1: Formula: (and (< 0 v_f2_6) (= v_f2_5 0)) InVars {f2=v_f2_6} OutVars{f2=v_f2_5} AuxVars[] AssignedVars[f2]" "[98] L46-1-->L52: Formula: (= v_x2_3 (+ v_x2_4 1)) InVars {x2=v_x2_4} OutVars{x2=v_x2_3} AuxVars[] AssignedVars[x2]" "[99] L52-->L44: Formula: (= v_f3_1 1) InVars {} OutVars{f3=v_f3_1} AuxVars[] AssignedVars[f3]" [2025-04-26 16:58:35,823 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:35,823 INFO L85 PathProgramCache]: Analyzing trace with hash 109033159, now seen corresponding path program 1 times [2025-04-26 16:58:35,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:35,823 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567474367] [2025-04-26 16:58:35,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:35,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:35,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:58:35,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:58:35,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:35,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:35,829 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:35,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:58:35,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:58:35,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:35,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:35,834 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:35,834 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:35,834 INFO L85 PathProgramCache]: Analyzing trace with hash 3850020, now seen corresponding path program 1 times [2025-04-26 16:58:35,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:35,834 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264140069] [2025-04-26 16:58:35,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:35,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:35,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:58:35,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:58:35,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:35,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:35,839 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:35,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:58:35,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:58:35,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:35,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:35,847 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:35,847 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:35,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1093295382, now seen corresponding path program 1 times [2025-04-26 16:58:35,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:35,848 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084042981] [2025-04-26 16:58:35,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:35,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:35,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:58:35,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:58:35,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:35,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:35,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:58:35,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:58:35,872 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084042981] [2025-04-26 16:58:35,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084042981] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:58:35,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:58:35,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:58:35,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850260801] [2025-04-26 16:58:35,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:58:35,914 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:35,915 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:35,915 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:35,915 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:35,915 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:58:35,915 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:35,915 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:35,915 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:35,915 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved4.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:58:35,915 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:35,915 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:35,916 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:35,921 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:35,924 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:35,956 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:35,957 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:58:35,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:35,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:35,959 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:35,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:58:35,962 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:35,962 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:35,982 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 16:58:35,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:35,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:35,984 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:35,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:58:35,985 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:35,986 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:36,048 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:58:36,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 16:58:36,053 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:36,053 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:36,053 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:36,053 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:36,053 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:58:36,053 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:36,053 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:36,053 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:36,053 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved4.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:58:36,053 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:36,053 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:36,054 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:36,070 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:36,074 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:36,100 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:36,100 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:58:36,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:36,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:36,102 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:36,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:58:36,104 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:58:36,114 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:36,114 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:36,114 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:36,115 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:36,115 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:36,115 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:36,115 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:36,117 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:58:36,121 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:58:36,121 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:58:36,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:36,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:36,123 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:36,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:58:36,126 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:58:36,129 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 16:58:36,129 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:58:36,129 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:58:36,129 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x2, z) = -1*x2 + 1*z Supporting invariants [] [2025-04-26 16:58:36,135 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 16:58:36,136 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:58:36,154 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:36,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:58:36,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:58:36,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:36,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:36,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:58:36,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:36,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:58:36,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:58:36,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:36,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:36,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:58:36,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:36,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:58:36,229 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:58:36,230 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 798 states and 1198 transitions. cyclomatic complexity: 470 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 16:58:36,312 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 798 states and 1198 transitions. cyclomatic complexity: 470. 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 1712 states and 2671 transitions. Complement of second has 6 states. [2025-04-26 16:58:36,312 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:58:36,313 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 16:58:36,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2025-04-26 16:58:36,313 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 76 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 16:58:36,313 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:36,313 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 76 transitions. Stem has 9 letters. Loop has 4 letters. [2025-04-26 16:58:36,314 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:36,314 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 76 transitions. Stem has 5 letters. Loop has 8 letters. [2025-04-26 16:58:36,314 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:36,314 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1712 states and 2671 transitions. [2025-04-26 16:58:36,325 INFO L131 ngComponentsAnalysis]: Automaton has 45 accepting balls. 291 [2025-04-26 16:58:36,332 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1712 states to 1148 states and 1783 transitions. [2025-04-26 16:58:36,332 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 543 [2025-04-26 16:58:36,334 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 653 [2025-04-26 16:58:36,334 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1148 states and 1783 transitions. [2025-04-26 16:58:36,334 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:58:36,335 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1148 states and 1783 transitions. [2025-04-26 16:58:36,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states and 1783 transitions. [2025-04-26 16:58:36,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 1060. [2025-04-26 16:58:36,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1060 states, 1060 states have (on average 1.5575471698113208) internal successors, (in total 1651), 1059 states have internal predecessors, (1651), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:36,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1651 transitions. [2025-04-26 16:58:36,354 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1060 states and 1651 transitions. [2025-04-26 16:58:36,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:58:36,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:58:36,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:58:36,355 INFO L87 Difference]: Start difference. First operand 1060 states and 1651 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 16:58:36,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:58:36,382 INFO L93 Difference]: Finished difference Result 1572 states and 2265 transitions. [2025-04-26 16:58:36,382 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1572 states and 2265 transitions. [2025-04-26 16:58:36,389 INFO L131 ngComponentsAnalysis]: Automaton has 88 accepting balls. 494 [2025-04-26 16:58:36,395 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1572 states to 1462 states and 2100 transitions. [2025-04-26 16:58:36,396 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 920 [2025-04-26 16:58:36,397 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1035 [2025-04-26 16:58:36,397 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1462 states and 2100 transitions. [2025-04-26 16:58:36,397 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:58:36,397 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1462 states and 2100 transitions. [2025-04-26 16:58:36,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states and 2100 transitions. [2025-04-26 16:58:36,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 1027. [2025-04-26 16:58:36,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1027 states, 1027 states have (on average 1.453748782862707) internal successors, (in total 1493), 1026 states have internal predecessors, (1493), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:36,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 1493 transitions. [2025-04-26 16:58:36,435 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1027 states and 1493 transitions. [2025-04-26 16:58:36,435 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:58:36,436 INFO L438 stractBuchiCegarLoop]: Abstraction has 1027 states and 1493 transitions. [2025-04-26 16:58:36,436 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:58:36,436 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1027 states and 1493 transitions. [2025-04-26 16:58:36,439 INFO L131 ngComponentsAnalysis]: Automaton has 43 accepting balls. 283 [2025-04-26 16:58:36,439 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:36,439 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:36,439 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:58:36,439 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:58:36,440 INFO L752 eck$LassoCheckResult]: Stem: "[83] $Ultimate##0-->L16: Formula: (and (= v_f3_4 0) (= v_f2_4 0) (= v_f1_3 0) (= v_x3_5 0) (= v_x1_5 0) (= v_x4_1 0) (= v_f4_2 0) (= v_x2_5 0)) InVars {f4=v_f4_2, f2=v_f2_4, x4=v_x4_1, f3=v_f3_4, x2=v_x2_5, f1=v_f1_3, x3=v_x3_5, x1=v_x1_5} OutVars{f4=v_f4_2, f2=v_f2_4, x4=v_x4_1, f3=v_f3_4, x2=v_x2_5, f1=v_f1_3, x3=v_x3_5, x1=v_x1_5} AuxVars[] AssignedVars[]" "[123] L16-->L33-1: Formula: (= v_thread1Thread1of1ForFork3_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork3_thidvar0=v_thread1Thread1of1ForFork3_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_thidvar0]" "[88] L33-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[]" "[90] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[114] L16-1-->L44: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" "[94] L44-->thread2FINAL: Formula: (<= v_z_3 v_x2_1) InVars {x2=v_x2_1, z=v_z_3} OutVars{x2=v_x2_1, z=v_z_3} AuxVars[] AssignedVars[]" "[96] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[117] L17-->L59: Formula: (and (= 3 v_thread3Thread1of1ForFork1_thidvar2_2) (= 3 v_thread3Thread1of1ForFork1_thidvar0_2) (= 3 v_thread3Thread1of1ForFork1_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_2, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_2, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2]" [2025-04-26 16:58:36,440 INFO L754 eck$LassoCheckResult]: Loop: "[101] L59-->L61: Formula: (< v_x3_1 v_z_5) InVars {x3=v_x3_1, z=v_z_5} OutVars{x3=v_x3_1, z=v_z_5} AuxVars[] AssignedVars[]" "[103] L61-->L61-1: Formula: (and (< 0 v_f3_6) (= v_f3_5 0)) InVars {f3=v_f3_6} OutVars{f3=v_f3_5} AuxVars[] AssignedVars[f3]" "[104] L61-1-->L67: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" "[105] L67-->L59: Formula: (= v_f4_1 1) InVars {} OutVars{f4=v_f4_1} AuxVars[] AssignedVars[f4]" [2025-04-26 16:58:36,440 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:36,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1211657420, now seen corresponding path program 1 times [2025-04-26 16:58:36,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:36,441 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420236161] [2025-04-26 16:58:36,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:36,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:36,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:58:36,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:58:36,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:36,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:36,445 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:36,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:58:36,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:58:36,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:36,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:36,455 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:36,456 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:36,456 INFO L85 PathProgramCache]: Analyzing trace with hash 4034724, now seen corresponding path program 1 times [2025-04-26 16:58:36,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:36,456 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731673442] [2025-04-26 16:58:36,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:36,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:36,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:58:36,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:58:36,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:36,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:36,463 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:36,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:58:36,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:58:36,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:36,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:36,465 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:36,465 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:36,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1770823663, now seen corresponding path program 1 times [2025-04-26 16:58:36,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:36,467 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61811069] [2025-04-26 16:58:36,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:36,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:36,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:58:36,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:58:36,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:36,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:36,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:58:36,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:58:36,493 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61811069] [2025-04-26 16:58:36,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61811069] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:58:36,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:58:36,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:58:36,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260141797] [2025-04-26 16:58:36,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:58:36,515 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:36,515 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:36,516 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:36,516 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:36,516 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:58:36,516 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:36,516 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:36,516 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:36,516 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved4.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:58:36,516 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:36,516 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:36,517 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:36,522 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:36,527 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:36,561 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:36,561 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:58:36,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:36,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:36,564 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:36,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:58:36,565 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:36,565 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:36,576 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:58:36,576 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f4=1} Honda state: {f4=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:58:36,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 16:58:36,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:36,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:36,584 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:36,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:58:36,586 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:36,586 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:36,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 16:58:36,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:36,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:36,610 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:36,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 16:58:36,615 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:36,615 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:36,638 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:58:36,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 16:58:36,642 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:36,642 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:36,642 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:36,642 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:36,642 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:58:36,642 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:36,642 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:36,642 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:36,642 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved4.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:58:36,642 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:36,642 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:36,643 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:36,645 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:36,649 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:36,683 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:36,683 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:58:36,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:36,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:36,685 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:36,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 16:58:36,688 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:58:36,698 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:36,698 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:36,698 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:36,698 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:36,698 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:36,698 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:36,699 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:36,700 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:58:36,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:36,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:36,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:36,708 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:36,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 16:58:36,711 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:58:36,721 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:36,721 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:36,721 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:36,721 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:36,721 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:36,722 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:36,722 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:36,724 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:58:36,726 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:58:36,726 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:58:36,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:36,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:36,729 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:36,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 16:58:36,731 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:58:36,733 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:58:36,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:36,734 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:58:36,734 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:58:36,734 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(f3) = 1*f3 Supporting invariants [] [2025-04-26 16:58:36,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:36,741 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:58:36,755 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:36,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:58:36,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:58:36,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:36,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:36,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:58:36,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:36,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:58:36,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:58:36,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:36,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:36,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:58:36,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:36,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:58:36,806 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:58:36,806 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1027 states and 1493 transitions. cyclomatic complexity: 519 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (in total 12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:36,843 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1027 states and 1493 transitions. cyclomatic complexity: 519. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (in total 12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 2424 states and 3474 transitions. Complement of second has 5 states. [2025-04-26 16:58:36,844 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 16:58:36,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (in total 12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:36,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2025-04-26 16:58:36,845 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 49 transitions. Stem has 8 letters. Loop has 4 letters. [2025-04-26 16:58:36,846 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:36,846 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 49 transitions. Stem has 12 letters. Loop has 4 letters. [2025-04-26 16:58:36,846 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:36,846 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 49 transitions. Stem has 8 letters. Loop has 8 letters. [2025-04-26 16:58:36,846 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:36,846 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2424 states and 3474 transitions. [2025-04-26 16:58:36,859 INFO L131 ngComponentsAnalysis]: Automaton has 55 accepting balls. 377 [2025-04-26 16:58:36,868 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2424 states to 2112 states and 3068 transitions. [2025-04-26 16:58:36,868 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 890 [2025-04-26 16:58:36,870 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 965 [2025-04-26 16:58:36,870 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2112 states and 3068 transitions. [2025-04-26 16:58:36,870 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:58:36,870 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2112 states and 3068 transitions. [2025-04-26 16:58:36,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2112 states and 3068 transitions. [2025-04-26 16:58:36,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2112 to 1917. [2025-04-26 16:58:36,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1917 states, 1917 states have (on average 1.4715701617110069) internal successors, (in total 2821), 1916 states have internal predecessors, (2821), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:36,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1917 states to 1917 states and 2821 transitions. [2025-04-26 16:58:36,900 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1917 states and 2821 transitions. [2025-04-26 16:58:36,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:58:36,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:58:36,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:58:36,901 INFO L87 Difference]: Start difference. First operand 1917 states and 2821 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:36,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:58:36,957 INFO L93 Difference]: Finished difference Result 2528 states and 3553 transitions. [2025-04-26 16:58:36,957 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2528 states and 3553 transitions. [2025-04-26 16:58:36,967 INFO L131 ngComponentsAnalysis]: Automaton has 45 accepting balls. 318 [2025-04-26 16:58:36,974 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2528 states to 1719 states and 2498 transitions. [2025-04-26 16:58:36,974 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 834 [2025-04-26 16:58:36,975 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 857 [2025-04-26 16:58:36,975 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1719 states and 2498 transitions. [2025-04-26 16:58:36,975 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:58:36,975 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1719 states and 2498 transitions. [2025-04-26 16:58:36,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1719 states and 2498 transitions. [2025-04-26 16:58:36,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1719 to 1144. [2025-04-26 16:58:36,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1144 states, 1144 states have (on average 1.4772727272727273) internal successors, (in total 1690), 1143 states have internal predecessors, (1690), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:36,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1690 transitions. [2025-04-26 16:58:36,992 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1144 states and 1690 transitions. [2025-04-26 16:58:36,993 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:58:36,993 INFO L438 stractBuchiCegarLoop]: Abstraction has 1144 states and 1690 transitions. [2025-04-26 16:58:36,993 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:58:36,993 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1144 states and 1690 transitions. [2025-04-26 16:58:36,997 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 201 [2025-04-26 16:58:36,997 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:36,997 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:36,997 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:58:36,997 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:58:36,998 INFO L752 eck$LassoCheckResult]: Stem: "[83] $Ultimate##0-->L16: Formula: (and (= v_f3_4 0) (= v_f2_4 0) (= v_f1_3 0) (= v_x3_5 0) (= v_x1_5 0) (= v_x4_1 0) (= v_f4_2 0) (= v_x2_5 0)) InVars {f4=v_f4_2, f2=v_f2_4, x4=v_x4_1, f3=v_f3_4, x2=v_x2_5, f1=v_f1_3, x3=v_x3_5, x1=v_x1_5} OutVars{f4=v_f4_2, f2=v_f2_4, x4=v_x4_1, f3=v_f3_4, x2=v_x2_5, f1=v_f1_3, x3=v_x3_5, x1=v_x1_5} AuxVars[] AssignedVars[]" "[123] L16-->L33-1: Formula: (= v_thread1Thread1of1ForFork3_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork3_thidvar0=v_thread1Thread1of1ForFork3_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_thidvar0]" "[88] L33-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[]" "[90] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[114] L16-1-->L44: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" "[94] L44-->thread2FINAL: Formula: (<= v_z_3 v_x2_1) InVars {x2=v_x2_1, z=v_z_3} OutVars{x2=v_x2_1, z=v_z_3} AuxVars[] AssignedVars[]" "[96] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[117] L17-->L59: Formula: (and (= 3 v_thread3Thread1of1ForFork1_thidvar2_2) (= 3 v_thread3Thread1of1ForFork1_thidvar0_2) (= 3 v_thread3Thread1of1ForFork1_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_2, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_2, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2]" "[100] L59-->thread3FINAL: Formula: (<= v_z_6 v_x3_4) InVars {x3=v_x3_4, z=v_z_6} OutVars{x3=v_x3_4, z=v_z_6} AuxVars[] AssignedVars[]" "[102] thread3FINAL-->thread3EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[120] L18-->L74: Formula: (and (= 4 v_thread4Thread1of1ForFork2_thidvar2_2) (= 4 v_thread4Thread1of1ForFork2_thidvar3_2) (= 4 v_thread4Thread1of1ForFork2_thidvar1_2) (= 4 v_thread4Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread4Thread1of1ForFork2_thidvar3=v_thread4Thread1of1ForFork2_thidvar3_2, thread4Thread1of1ForFork2_thidvar0=v_thread4Thread1of1ForFork2_thidvar0_2, thread4Thread1of1ForFork2_thidvar2=v_thread4Thread1of1ForFork2_thidvar2_2, thread4Thread1of1ForFork2_thidvar1=v_thread4Thread1of1ForFork2_thidvar1_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_thidvar3, thread4Thread1of1ForFork2_thidvar0, thread4Thread1of1ForFork2_thidvar2, thread4Thread1of1ForFork2_thidvar1]" [2025-04-26 16:58:36,998 INFO L754 eck$LassoCheckResult]: Loop: "[107] L74-->L76: Formula: (< v_x4_3 v_z_8) InVars {x4=v_x4_3, z=v_z_8} OutVars{x4=v_x4_3, z=v_z_8} AuxVars[] AssignedVars[]" "[109] L76-->L76-1: Formula: (and (< 0 v_f4_6) (= v_f4_5 0)) InVars {f4=v_f4_6} OutVars{f4=v_f4_5} AuxVars[] AssignedVars[f4]" "[110] L76-1-->L82: Formula: (= v_x4_4 (+ v_x4_5 1)) InVars {x4=v_x4_5} OutVars{x4=v_x4_4} AuxVars[] AssignedVars[x4]" "[111] L82-->L74: Formula: (= v_f1_4 1) InVars {} OutVars{f1=v_f1_4} AuxVars[] AssignedVars[f1]" [2025-04-26 16:58:36,998 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:36,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1581143018, now seen corresponding path program 1 times [2025-04-26 16:58:36,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:36,998 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212662375] [2025-04-26 16:58:36,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:36,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:37,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:58:37,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:58:37,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:37,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:37,003 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:37,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:58:37,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:58:37,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:37,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:37,007 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:37,009 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:37,009 INFO L85 PathProgramCache]: Analyzing trace with hash 4219428, now seen corresponding path program 1 times [2025-04-26 16:58:37,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:37,009 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77612978] [2025-04-26 16:58:37,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:37,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:37,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:58:37,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:58:37,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:37,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:37,015 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:37,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:58:37,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:58:37,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:37,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:37,017 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:37,017 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:37,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1376740979, now seen corresponding path program 1 times [2025-04-26 16:58:37,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:37,017 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428127373] [2025-04-26 16:58:37,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:37,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:37,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:58:37,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:58:37,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:37,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:37,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:58:37,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:58:37,061 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428127373] [2025-04-26 16:58:37,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428127373] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:58:37,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:58:37,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:58:37,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108830883] [2025-04-26 16:58:37,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:58:37,086 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:37,086 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:37,086 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:37,086 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:37,086 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:58:37,086 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:37,086 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:37,086 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:37,086 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved4.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:58:37,086 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:37,086 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:37,087 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:37,089 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:37,097 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:37,122 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:37,122 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:58:37,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:37,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:37,124 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:37,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 16:58:37,127 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:37,127 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:37,138 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:58:37,138 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f1=1} Honda state: {f1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:58:37,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 16:58:37,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:37,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:37,146 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:37,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 16:58:37,148 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:37,148 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:37,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:37,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:37,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:37,166 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:37,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 16:58:37,169 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:37,169 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:37,237 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:58:37,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-04-26 16:58:37,241 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:37,241 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:37,241 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:37,241 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:37,241 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:58:37,241 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:37,241 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:37,241 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:37,241 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved4.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:58:37,241 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:37,241 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:37,242 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:37,248 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:37,257 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:37,293 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:37,293 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:58:37,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:37,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:37,295 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:37,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 16:58:37,298 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:58:37,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:37,308 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:37,308 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:37,308 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:37,308 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:37,309 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:37,309 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:37,310 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:58:37,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:37,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:37,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:37,318 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:37,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 16:58:37,320 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:58:37,330 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:37,330 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:37,330 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:37,330 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:37,330 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:37,331 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:37,331 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:37,333 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:58:37,334 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:58:37,335 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:58:37,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:37,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:37,336 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:37,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 16:58:37,339 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:58:37,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:37,341 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:58:37,342 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:58:37,342 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x4) = 1*z - 1*x4 Supporting invariants [] [2025-04-26 16:58:37,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-04-26 16:58:37,348 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:58:37,357 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:37,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:58:37,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:58:37,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:37,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:37,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:58:37,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:37,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:58:37,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:58:37,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:37,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:37,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:58:37,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:37,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:58:37,419 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:58:37,420 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1144 states and 1690 transitions. cyclomatic complexity: 583 Second operand has 4 states, 4 states have (on average 3.75) internal successors, (in total 15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:37,472 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1144 states and 1690 transitions. cyclomatic complexity: 583. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (in total 15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 2324 states and 3553 transitions. Complement of second has 6 states. [2025-04-26 16:58:37,472 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:58:37,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (in total 15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:37,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2025-04-26 16:58:37,473 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 79 transitions. Stem has 11 letters. Loop has 4 letters. [2025-04-26 16:58:37,473 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:37,473 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 79 transitions. Stem has 15 letters. Loop has 4 letters. [2025-04-26 16:58:37,473 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:37,473 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 79 transitions. Stem has 11 letters. Loop has 8 letters. [2025-04-26 16:58:37,473 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:37,473 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2324 states and 3553 transitions. [2025-04-26 16:58:37,498 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:58:37,498 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2324 states to 0 states and 0 transitions. [2025-04-26 16:58:37,498 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:58:37,498 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:58:37,498 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:58:37,498 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:58:37,498 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:58:37,498 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:58:37,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:58:37,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:58:37,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:58:37,499 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:37,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:58:37,499 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2025-04-26 16:58:37,499 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2025-04-26 16:58:37,499 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:58:37,499 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2025-04-26 16:58:37,499 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:58:37,499 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:58:37,499 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:58:37,499 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:58:37,499 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:58:37,499 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:58:37,499 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-26 16:58:37,501 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:58:37,501 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:58:37,501 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:58:37,501 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:58:37,501 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:58:37,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 16:58:37,514 INFO L201 PluginConnector]: Adding new model interleaved4.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:58:37 BoogieIcfgContainer [2025-04-26 16:58:37,514 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:58:37,515 INFO L158 Benchmark]: Toolchain (without parser) took 3651.52ms. Allocated memory was 142.6MB in the beginning and 125.8MB in the end (delta: -16.8MB). Free memory was 77.0MB in the beginning and 82.5MB in the end (delta: -5.5MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:58:37,515 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.15ms. Allocated memory is still 142.6MB. Free memory is still 77.8MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:58:37,515 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.49ms. Allocated memory is still 142.6MB. Free memory was 77.0MB in the beginning and 75.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:58:37,516 INFO L158 Benchmark]: Boogie Preprocessor took 25.56ms. Allocated memory is still 142.6MB. Free memory was 75.1MB in the beginning and 73.9MB in the end (delta: 1.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:58:37,516 INFO L158 Benchmark]: RCFGBuilder took 212.43ms. Allocated memory is still 142.6MB. Free memory was 73.9MB in the beginning and 64.1MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:58:37,516 INFO L158 Benchmark]: BuchiAutomizer took 3370.91ms. Allocated memory was 142.6MB in the beginning and 125.8MB in the end (delta: -16.8MB). Free memory was 63.9MB in the beginning and 82.5MB in the end (delta: -18.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:58:37,517 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.15ms. Allocated memory is still 142.6MB. Free memory is still 77.8MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.49ms. Allocated memory is still 142.6MB. Free memory was 77.0MB in the beginning and 75.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 25.56ms. Allocated memory is still 142.6MB. Free memory was 75.1MB in the beginning and 73.9MB in the end (delta: 1.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 212.43ms. Allocated memory is still 142.6MB. Free memory was 73.9MB in the beginning and 64.1MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 3370.91ms. Allocated memory was 142.6MB in the beginning and 125.8MB in the end (delta: -16.8MB). Free memory was 63.9MB in the beginning and 82.5MB in the end (delta: -18.6MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.2s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 5. Automata minimization 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 1973 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 259 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 255 mSDsluCounter, 301 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 137 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 218 IncrementalHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 164 mSDtfsCounter, 218 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT4 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital21 mio100 ax100 hnf100 lsp57 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 46ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 3 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s InitialAbstractionConstructionTime: 0.4s InitialAbstraction: Time to compute Ample Reduction [ms]: 438, Number of transitions in reduction automaton: 1309, Number of states in reduction automaton: 822, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (4 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function f1 and consists of 3 locations. One deterministic module has affine ranking function z + -1 * x2 and consists of 4 locations. One deterministic module has affine ranking function f3 and consists of 3 locations. One deterministic module has affine ranking function -1 * x4 + z and consists of 4 locations. 4 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 16:58:37,533 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...