/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i /storage/cav23-termute-examples/2_thr/complex_thr1_2.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:56:39,036 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:56:39,094 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:56:39,099 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:56:39,099 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:56:39,099 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:56:39,099 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:56:39,119 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:56:39,122 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:56:39,122 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:56:39,123 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:56:39,123 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:56:39,123 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:56:39,123 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:56:39,123 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:56:39,123 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:56:39,124 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:56:39,124 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:56:39,124 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:56:39,124 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:56:39,124 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:56:39,124 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:56:39,124 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:56:39,124 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:56:39,124 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:56:39,124 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:56:39,124 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:56:39,124 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:56:39,124 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:56:39,124 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:56:39,124 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:56:39,124 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:56:39,125 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:56:39,125 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:56:39,125 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:56:39,125 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:56:39,125 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:56:39,125 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:56:39,125 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:56:39,125 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:56:39,125 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:56:39,125 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:56:39,125 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:56:39,369 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:56:39,377 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:56:39,379 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:56:39,380 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:56:39,380 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:56:39,382 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/2_thr/complex_thr1_2.c.bpl [2025-04-26 16:56:39,382 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/2_thr/complex_thr1_2.c.bpl' [2025-04-26 16:56:39,396 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:56:39,397 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:56:39,397 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:56:39,398 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:56:39,398 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:56:39,407 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "complex_thr1_2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:39" (1/1) ... [2025-04-26 16:56:39,426 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "complex_thr1_2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:39" (1/1) ... [2025-04-26 16:56:39,431 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:56:39,432 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:56:39,433 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:56:39,433 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:56:39,433 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:56:39,437 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "complex_thr1_2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:39" (1/1) ... [2025-04-26 16:56:39,438 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "complex_thr1_2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:39" (1/1) ... [2025-04-26 16:56:39,439 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "complex_thr1_2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:39" (1/1) ... [2025-04-26 16:56:39,439 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "complex_thr1_2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:39" (1/1) ... [2025-04-26 16:56:39,441 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "complex_thr1_2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:39" (1/1) ... [2025-04-26 16:56:39,441 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "complex_thr1_2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:39" (1/1) ... [2025-04-26 16:56:39,444 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "complex_thr1_2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:39" (1/1) ... [2025-04-26 16:56:39,445 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "complex_thr1_2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:39" (1/1) ... [2025-04-26 16:56:39,445 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "complex_thr1_2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:39" (1/1) ... [2025-04-26 16:56:39,456 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:56:39,457 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:56:39,457 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:56:39,457 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:56:39,459 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "complex_thr1_2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:39" (1/1) ... [2025-04-26 16:56:39,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:56:39,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:39,485 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:56:39,488 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:56:39,509 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:56:39,510 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:56:39,510 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:56:39,510 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:56:39,510 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:56:39,510 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:56:39,510 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:56:39,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:56:39,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:56:39,511 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:56:39,545 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:56:39,546 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:56:39,630 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:56:39,630 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:56:39,640 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:56:39,641 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:56:39,643 INFO L201 PluginConnector]: Adding new model complex_thr1_2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:56:39 BoogieIcfgContainer [2025-04-26 16:56:39,643 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:56:39,644 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:56:39,644 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:56:39,649 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:56:39,650 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:56:39,650 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "complex_thr1_2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:39" (1/2) ... [2025-04-26 16:56:39,651 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@611490e1 and model type complex_thr1_2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:56:39, skipping insertion in model container [2025-04-26 16:56:39,651 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:56:39,651 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "complex_thr1_2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:56:39" (2/2) ... [2025-04-26 16:56:39,652 INFO L376 chiAutomizerObserver]: Analyzing ICFG complex_thr1_2.c.bpl [2025-04-26 16:56:39,697 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:56:39,739 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:56:39,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:56:39,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:39,744 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:56:39,746 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:56:39,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 26 transitions, 66 flow [2025-04-26 16:56:39,800 INFO L116 PetriNetUnfolderBase]: 4/22 cut-off events. [2025-04-26 16:56:39,802 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:56:39,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 22 events. 4/22 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 33 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 20. Up to 2 conditions per place. [2025-04-26 16:56:39,804 INFO L82 GeneralOperation]: Start removeDead. Operand has 27 places, 26 transitions, 66 flow [2025-04-26 16:56:39,808 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 25 places, 22 transitions, 56 flow [2025-04-26 16:56:39,808 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 25 places, 22 transitions, 56 flow [2025-04-26 16:56:39,814 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:56:39,866 WARN L140 AmpleReduction]: Number of pruned transitions: 33 [2025-04-26 16:56:39,866 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:56:39,866 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 11 [2025-04-26 16:56:39,866 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:17 [2025-04-26 16:56:39,866 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:27 [2025-04-26 16:56:39,866 WARN L145 AmpleReduction]: Times succ was already a loop node:10 [2025-04-26 16:56:39,866 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:10 [2025-04-26 16:56:39,866 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:56:39,868 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 56 states, 55 states have (on average 1.5818181818181818) internal successors, (in total 87), 55 states have internal predecessors, (87), 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:56:39,874 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:56:39,874 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:56:39,874 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:56:39,874 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:56:39,874 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:56:39,874 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:56:39,874 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:56:39,874 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:56:39,876 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 56 states, 55 states have (on average 1.5818181818181818) internal successors, (in total 87), 55 states have internal predecessors, (87), 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:56:39,884 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 38 [2025-04-26 16:56:39,884 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:39,884 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:39,887 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:56:39,887 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:56:39,887 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:56:39,887 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 56 states, 55 states have (on average 1.5818181818181818) internal successors, (in total 87), 55 states have internal predecessors, (87), 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:56:39,889 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 38 [2025-04-26 16:56:39,889 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:39,889 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:39,889 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:56:39,889 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:56:39,893 INFO L752 eck$LassoCheckResult]: Stem: "[78] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[59] $Ultimate##0-->L21: Formula: (= v_z_1 0) InVars {} OutVars{z=v_z_1} AuxVars[] AssignedVars[z]" "[81] L11-->L40: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-04-26 16:56:39,893 INFO L754 eck$LassoCheckResult]: Loop: "[73] L40-->L42: Formula: (< v_x_4 v_y_5) InVars {y=v_y_5, x=v_x_4} OutVars{y=v_y_5, x=v_x_4} AuxVars[] AssignedVars[]" "[75] L42-->L40: Formula: (= (+ v_x_6 1) v_x_5) InVars {x=v_x_6} OutVars{x=v_x_5} AuxVars[] AssignedVars[x]" [2025-04-26 16:56:39,896 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:39,897 INFO L85 PathProgramCache]: Analyzing trace with hash 106659, now seen corresponding path program 1 times [2025-04-26 16:56:39,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:39,902 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697730977] [2025-04-26 16:56:39,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:39,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:39,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:39,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:39,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:39,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:39,952 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:39,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:39,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:39,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:39,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:39,965 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:39,967 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:39,967 INFO L85 PathProgramCache]: Analyzing trace with hash 3299, now seen corresponding path program 1 times [2025-04-26 16:56:39,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:39,967 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889285806] [2025-04-26 16:56:39,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:39,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:39,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:39,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:39,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:39,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:39,973 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:39,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:39,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:39,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:39,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:39,976 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:39,977 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:39,977 INFO L85 PathProgramCache]: Analyzing trace with hash 102501637, now seen corresponding path program 1 times [2025-04-26 16:56:39,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:39,977 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103192002] [2025-04-26 16:56:39,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:39,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:39,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:39,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:39,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:39,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:39,983 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:39,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:39,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:39,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:39,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:39,993 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:40,052 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:40,052 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:40,052 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:40,052 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:40,053 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:56:40,053 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:40,053 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:40,053 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:40,053 INFO L132 ssoRankerPreferences]: Filename of dumped script: complex_thr1_2.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:56:40,053 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:40,053 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:40,063 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:40,107 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:40,107 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:56:40,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:40,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:40,112 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:56:40,113 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:56:40,115 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:40,115 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:40,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:56:40,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:40,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:40,142 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:56:40,144 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:56:40,145 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:56:40,145 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:40,216 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:56:40,221 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:56:40,222 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:40,222 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:40,222 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:40,222 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:40,222 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:40,222 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:40,222 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:40,222 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:40,222 INFO L132 ssoRankerPreferences]: Filename of dumped script: complex_thr1_2.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:56:40,222 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:40,222 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:40,223 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:40,250 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:40,253 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:40,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:40,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:40,277 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:56:40,279 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:56:40,280 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:56:40,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:40,291 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:56:40,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:40,291 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:40,292 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:40,295 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:56:40,295 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:56:40,297 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:40,301 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:56:40,301 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:56:40,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:40,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:40,304 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:56:40,305 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:56:40,307 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:40,310 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:56:40,310 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:56:40,311 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:40,311 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x, y) = -1*x + 1*y Supporting invariants [] [2025-04-26 16:56:40,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 16:56:40,319 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:40,339 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:40,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:40,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:40,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:40,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:40,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:40,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:40,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:40,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:40,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:40,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:40,384 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:40,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:40,404 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:56:40,435 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:56:40,437 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 56 states, 55 states have (on average 1.5818181818181818) internal successors, (in total 87), 55 states have internal predecessors, (87), 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 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 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:56:40,542 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 56 states, 55 states have (on average 1.5818181818181818) internal successors, (in total 87), 55 states have internal predecessors, (87), 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 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 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 116 states and 195 transitions. Complement of second has 6 states. [2025-04-26 16:56:40,542 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:56:40,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 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:56:40,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2025-04-26 16:56:40,549 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 55 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 16:56:40,550 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:40,550 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 55 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:56:40,550 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:40,550 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 55 transitions. Stem has 3 letters. Loop has 4 letters. [2025-04-26 16:56:40,550 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:40,551 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 195 transitions. [2025-04-26 16:56:40,555 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 30 [2025-04-26 16:56:40,557 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 66 states and 108 transitions. [2025-04-26 16:56:40,558 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2025-04-26 16:56:40,558 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2025-04-26 16:56:40,558 INFO L74 IsDeterministic]: Start isDeterministic. Operand 66 states and 108 transitions. [2025-04-26 16:56:40,559 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:40,559 INFO L218 hiAutomatonCegarLoop]: Abstraction has 66 states and 108 transitions. [2025-04-26 16:56:40,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 108 transitions. [2025-04-26 16:56:40,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2025-04-26 16:56:40,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 1.6166666666666667) internal successors, (in total 97), 59 states have internal predecessors, (97), 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:56:40,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 97 transitions. [2025-04-26 16:56:40,579 INFO L240 hiAutomatonCegarLoop]: Abstraction has 60 states and 97 transitions. [2025-04-26 16:56:40,579 INFO L438 stractBuchiCegarLoop]: Abstraction has 60 states and 97 transitions. [2025-04-26 16:56:40,579 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:56:40,580 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 97 transitions. [2025-04-26 16:56:40,580 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 30 [2025-04-26 16:56:40,580 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:40,581 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:40,581 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:56:40,581 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:56:40,581 INFO L752 eck$LassoCheckResult]: Stem: "[78] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[59] $Ultimate##0-->L21: Formula: (= v_z_1 0) InVars {} OutVars{z=v_z_1} AuxVars[] AssignedVars[z]" "[60] L21-->L22: Formula: (= v_i_1 v_x_1) InVars {x=v_x_1} OutVars{i=v_i_1, x=v_x_1} AuxVars[] AssignedVars[i]" "[61] L22-->L24-1: Formula: (and (< 0 v_x_2) (< 0 v_y_1)) InVars {y=v_y_1, x=v_x_2} OutVars{y=v_y_1, x=v_x_2} AuxVars[] AssignedVars[]" [2025-04-26 16:56:40,581 INFO L754 eck$LassoCheckResult]: Loop: "[64] L24-1-->L26: Formula: (< 0 v_i_2) InVars {i=v_i_2} OutVars{i=v_i_2} AuxVars[] AssignedVars[]" "[68] L26-->L27: Formula: (= (+ v_i_3 1) v_i_4) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[70] L27-->L24-1: Formula: (= (+ v_z_3 1) v_z_2) InVars {z=v_z_3} OutVars{z=v_z_2} AuxVars[] AssignedVars[z]" [2025-04-26 16:56:40,582 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:40,582 INFO L85 PathProgramCache]: Analyzing trace with hash 3305839, now seen corresponding path program 1 times [2025-04-26 16:56:40,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:40,582 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563358414] [2025-04-26 16:56:40,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:40,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:40,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:40,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:40,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:40,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:40,587 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:40,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:40,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:40,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:40,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:40,592 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:40,593 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:40,593 INFO L85 PathProgramCache]: Analyzing trace with hash 93473, now seen corresponding path program 1 times [2025-04-26 16:56:40,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:40,593 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332611341] [2025-04-26 16:56:40,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:40,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:40,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:40,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:40,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:40,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:40,599 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:40,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:40,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:40,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:40,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:40,604 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:40,605 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:40,605 INFO L85 PathProgramCache]: Analyzing trace with hash -299934477, now seen corresponding path program 1 times [2025-04-26 16:56:40,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:40,605 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716699128] [2025-04-26 16:56:40,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:40,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:40,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:56:40,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:56:40,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:40,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:40,612 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:40,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:56:40,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:56:40,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:40,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:40,622 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:40,647 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:40,647 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:40,647 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:40,647 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:40,647 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:56:40,647 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:40,647 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:40,647 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:40,647 INFO L132 ssoRankerPreferences]: Filename of dumped script: complex_thr1_2.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:56:40,647 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:40,647 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:40,648 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:40,654 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:40,676 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:40,676 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:56:40,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:40,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:40,678 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:56:40,679 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:56:40,681 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:40,681 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:40,697 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:56:40,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:40,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:40,699 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:56:40,700 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:56:40,700 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:56:40,700 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:40,722 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:56:40,727 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:56:40,727 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:40,727 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:40,727 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:40,727 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:40,727 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:40,727 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:40,727 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:40,727 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:40,727 INFO L132 ssoRankerPreferences]: Filename of dumped script: complex_thr1_2.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:56:40,727 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:40,727 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:40,728 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:40,733 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:40,759 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:40,759 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:40,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:40,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:40,761 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:56:40,763 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:56:40,764 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:56:40,774 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:40,774 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:56:40,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:40,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:40,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:40,775 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:56:40,775 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:56:40,777 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:40,779 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:56:40,779 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:56:40,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:40,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:40,781 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:56:40,782 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:56:40,783 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:40,786 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:56:40,787 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:56:40,787 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:40,788 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i) = 1*i Supporting invariants [] [2025-04-26 16:56:40,793 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:56:40,794 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:40,804 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:40,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:40,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:40,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:40,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:40,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:40,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:40,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:40,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:40,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:40,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:40,817 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:40,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:40,853 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:56:40,853 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:56:40,853 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 97 transitions. cyclomatic complexity: 51 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (in total 7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:40,879 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states and 97 transitions. cyclomatic complexity: 51. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (in total 7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 135 states and 226 transitions. Complement of second has 7 states. [2025-04-26 16:56:40,883 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:56:40,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (in total 7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:40,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2025-04-26 16:56:40,884 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 4 letters. Loop has 3 letters. [2025-04-26 16:56:40,884 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:40,884 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 7 letters. Loop has 3 letters. [2025-04-26 16:56:40,884 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:40,884 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 4 letters. Loop has 6 letters. [2025-04-26 16:56:40,884 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:40,884 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 135 states and 226 transitions. [2025-04-26 16:56:40,886 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 15 [2025-04-26 16:56:40,888 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 135 states to 103 states and 166 transitions. [2025-04-26 16:56:40,888 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2025-04-26 16:56:40,889 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2025-04-26 16:56:40,889 INFO L74 IsDeterministic]: Start isDeterministic. Operand 103 states and 166 transitions. [2025-04-26 16:56:40,889 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:40,889 INFO L218 hiAutomatonCegarLoop]: Abstraction has 103 states and 166 transitions. [2025-04-26 16:56:40,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states and 166 transitions. [2025-04-26 16:56:40,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 81. [2025-04-26 16:56:40,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 81 states have (on average 1.6790123456790123) internal successors, (in total 136), 80 states have internal predecessors, (136), 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:56:40,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 136 transitions. [2025-04-26 16:56:40,893 INFO L240 hiAutomatonCegarLoop]: Abstraction has 81 states and 136 transitions. [2025-04-26 16:56:40,893 INFO L438 stractBuchiCegarLoop]: Abstraction has 81 states and 136 transitions. [2025-04-26 16:56:40,893 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:56:40,893 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 81 states and 136 transitions. [2025-04-26 16:56:40,894 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 15 [2025-04-26 16:56:40,894 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:40,894 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:40,894 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:56:40,894 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:56:40,895 INFO L752 eck$LassoCheckResult]: Stem: "[78] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[59] $Ultimate##0-->L21: Formula: (= v_z_1 0) InVars {} OutVars{z=v_z_1} AuxVars[] AssignedVars[z]" "[60] L21-->L22: Formula: (= v_i_1 v_x_1) InVars {x=v_x_1} OutVars{i=v_i_1, x=v_x_1} AuxVars[] AssignedVars[i]" "[61] L22-->L24-1: Formula: (and (< 0 v_x_2) (< 0 v_y_1)) InVars {y=v_y_1, x=v_x_2} OutVars{y=v_y_1, x=v_x_2} AuxVars[] AssignedVars[]" "[63] L24-1-->L29-1: Formula: (<= v_i_5 0) InVars {i=v_i_5} OutVars{i=v_i_5} AuxVars[] AssignedVars[]" [2025-04-26 16:56:40,895 INFO L754 eck$LassoCheckResult]: Loop: "[67] L29-1-->L31: Formula: (< v_i_6 v_y_2) InVars {i=v_i_6, y=v_y_2} OutVars{i=v_i_6, y=v_y_2} AuxVars[] AssignedVars[]" "[69] L31-->L32: Formula: (= (+ v_i_8 1) v_i_7) InVars {i=v_i_8} OutVars{i=v_i_7} AuxVars[] AssignedVars[i]" "[71] L32-->L29-1: Formula: (= v_z_5 (+ v_z_4 1)) InVars {z=v_z_5} OutVars{z=v_z_4} AuxVars[] AssignedVars[z]" [2025-04-26 16:56:40,895 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:40,895 INFO L85 PathProgramCache]: Analyzing trace with hash 102481072, now seen corresponding path program 1 times [2025-04-26 16:56:40,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:40,895 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876630742] [2025-04-26 16:56:40,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:40,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:40,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:40,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:40,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:40,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:40,941 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:56:40,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:56:40,942 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876630742] [2025-04-26 16:56:40,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876630742] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:56:40,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:56:40,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:56:40,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202759277] [2025-04-26 16:56:40,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:56:40,945 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:56:40,946 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:40,946 INFO L85 PathProgramCache]: Analyzing trace with hash 96388, now seen corresponding path program 1 times [2025-04-26 16:56:40,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:40,946 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546649576] [2025-04-26 16:56:40,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:40,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:40,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:40,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:40,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:40,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:40,949 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:40,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:40,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:40,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:40,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:40,951 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:40,972 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:40,972 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:40,972 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:40,972 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:40,972 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:56:40,972 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:40,972 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:40,972 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:40,972 INFO L132 ssoRankerPreferences]: Filename of dumped script: complex_thr1_2.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:56:40,972 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:40,972 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:40,973 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:40,976 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:41,001 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:41,001 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:56:41,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:41,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:41,004 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:56:41,005 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:56:41,006 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:41,007 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:41,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:41,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:41,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:41,026 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:56:41,027 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:56:41,028 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:56:41,028 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:41,056 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:56:41,056 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {z=0} Honda state: {z=0} Generalized eigenvectors: [{z=-1}, {z=7}, {z=-7}] Lambdas: [8, 1, 1] Nus: [1, 0] [2025-04-26 16:56:41,061 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:56:41,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:41,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:41,063 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:56:41,064 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:56:41,065 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:41,065 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:41,081 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:56:41,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:41,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:41,084 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:56:41,085 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:56:41,086 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:56:41,086 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:41,158 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:56:41,163 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:56:41,163 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:41,163 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:41,163 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:41,163 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:41,163 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:41,163 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:41,163 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:41,163 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:41,163 INFO L132 ssoRankerPreferences]: Filename of dumped script: complex_thr1_2.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:56:41,163 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:41,163 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:41,164 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:41,169 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:41,204 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:41,204 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:41,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:41,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:41,207 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:56:41,208 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:56:41,209 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:56:41,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:41,220 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:56:41,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:41,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:41,220 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:41,221 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:56:41,221 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:56:41,223 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:41,230 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:56:41,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:41,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:41,232 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:56:41,233 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:56:41,235 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:56:41,245 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:41,245 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:56:41,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:41,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:41,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:41,246 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:56:41,246 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:56:41,249 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:41,251 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:56:41,251 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:56:41,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:41,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:41,253 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:56:41,255 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:56:41,256 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:41,259 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:56:41,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 16:56:41,260 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:56:41,260 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:41,260 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, y) = -1*i + 1*y Supporting invariants [] [2025-04-26 16:56:41,268 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:56:41,269 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:41,283 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:41,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:41,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:41,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:41,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:41,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:41,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:41,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:41,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:41,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:41,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:41,301 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:41,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:41,329 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:56:41,329 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:56:41,329 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 81 states and 136 transitions. cyclomatic complexity: 70 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:41,352 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 81 states and 136 transitions. cyclomatic complexity: 70. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 121 states and 200 transitions. Complement of second has 6 states. [2025-04-26 16:56:41,353 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:56:41,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:41,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2025-04-26 16:56:41,353 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 16:56:41,353 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:41,353 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 8 letters. Loop has 3 letters. [2025-04-26 16:56:41,354 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:41,354 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 5 letters. Loop has 6 letters. [2025-04-26 16:56:41,354 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:41,354 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 121 states and 200 transitions. [2025-04-26 16:56:41,355 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:56:41,355 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 121 states to 0 states and 0 transitions. [2025-04-26 16:56:41,355 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:56:41,355 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:56:41,355 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:56:41,355 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:56:41,355 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:41,356 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:41,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:56:41,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:56:41,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:56:41,357 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 4 states have internal predecessors, (5), 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:56:41,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:56:41,359 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2025-04-26 16:56:41,359 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2025-04-26 16:56:41,359 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:56:41,359 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2025-04-26 16:56:41,359 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:56:41,359 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:56:41,359 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:56:41,359 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:56:41,359 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:41,359 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:41,359 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-26 16:56:41,359 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:41,360 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:56:41,360 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:56:41,360 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:56:41,360 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:56:41,370 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:56:41,371 INFO L201 PluginConnector]: Adding new model complex_thr1_2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:56:41 BoogieIcfgContainer [2025-04-26 16:56:41,371 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:56:41,372 INFO L158 Benchmark]: Toolchain (without parser) took 1975.04ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 85.2MB in the beginning and 57.3MB in the end (delta: 27.9MB). Peak memory consumption was 28.5MB. Max. memory is 8.0GB. [2025-04-26 16:56:41,372 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.91ms. Allocated memory is still 159.4MB. Free memory is still 86.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:41,372 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.89ms. Allocated memory is still 159.4MB. Free memory was 85.1MB in the beginning and 83.3MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:41,372 INFO L158 Benchmark]: Boogie Preprocessor took 23.46ms. Allocated memory is still 159.4MB. Free memory was 83.3MB in the beginning and 82.2MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:56:41,373 INFO L158 Benchmark]: RCFGBuilder took 185.62ms. Allocated memory is still 159.4MB. Free memory was 82.2MB in the beginning and 73.2MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:56:41,373 INFO L158 Benchmark]: BuchiAutomizer took 1726.97ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 73.1MB in the beginning and 57.3MB in the end (delta: 15.8MB). Peak memory consumption was 15.9MB. Max. memory is 8.0GB. [2025-04-26 16:56:41,374 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.91ms. Allocated memory is still 159.4MB. Free memory is still 86.0MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.89ms. Allocated memory is still 159.4MB. Free memory was 85.1MB in the beginning and 83.3MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 23.46ms. Allocated memory is still 159.4MB. Free memory was 83.3MB in the beginning and 82.2MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 185.62ms. Allocated memory is still 159.4MB. Free memory was 82.2MB in the beginning and 73.2MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1726.97ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 73.1MB in the beginning and 57.3MB in the end (delta: 15.8MB). Peak memory consumption was 15.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.6s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 28 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 82 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 79 mSDsluCounter, 95 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 41 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 71 IncrementalHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 54 mSDtfsCounter, 71 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital14 mio100 ax100 hnf100 lsp79 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq153 hnf94 smp100 dnf100 smp100 tf112 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 57ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 132, Number of transitions in reduction automaton: 87, Number of states in reduction automaton: 56, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (1 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x + y and consists of 4 locations. One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function y + -1 * i and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:56:41,386 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...