/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/3_thr/barrier-3t.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:56:54,790 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:56:54,836 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:56:54,839 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:56:54,839 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:56:54,839 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:54,839 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:56:54,853 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:56:54,853 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:56:54,853 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:56:54,854 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:56:54,854 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:56:54,854 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:56:54,854 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:56:54,854 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:56:54,854 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:56:54,854 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:56:54,854 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:56:54,854 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:56:54,854 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:56:54,854 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:56:54,854 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:56:54,854 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:56:54,855 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:56:54,855 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:56:54,855 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:56:54,855 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:56:54,855 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:56:54,855 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:56:54,855 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:56:54,855 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:56:54,855 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:56:54,855 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:56:54,855 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:56:54,855 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:56:54,855 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:56:54,855 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:56:54,855 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:56:54,855 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:56:54,855 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:56:54,856 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:56:54,856 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:56:54,856 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:56:55,065 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:56:55,073 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:56:55,074 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:56:55,075 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:56:55,075 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:56:55,077 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/3_thr/barrier-3t.c.bpl [2025-04-26 16:56:55,077 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/3_thr/barrier-3t.c.bpl' [2025-04-26 16:56:55,091 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:56:55,092 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:56:55,093 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:56:55,093 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:56:55,093 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:56:55,099 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "barrier-3t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:55" (1/1) ... [2025-04-26 16:56:55,118 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "barrier-3t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:55" (1/1) ... [2025-04-26 16:56:55,123 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:56:55,124 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:56:55,125 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:56:55,125 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:56:55,125 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:56:55,129 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "barrier-3t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:55" (1/1) ... [2025-04-26 16:56:55,129 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "barrier-3t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:55" (1/1) ... [2025-04-26 16:56:55,130 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "barrier-3t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:55" (1/1) ... [2025-04-26 16:56:55,131 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "barrier-3t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:55" (1/1) ... [2025-04-26 16:56:55,133 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "barrier-3t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:55" (1/1) ... [2025-04-26 16:56:55,134 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "barrier-3t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:55" (1/1) ... [2025-04-26 16:56:55,136 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "barrier-3t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:55" (1/1) ... [2025-04-26 16:56:55,136 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "barrier-3t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:55" (1/1) ... [2025-04-26 16:56:55,138 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "barrier-3t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:55" (1/1) ... [2025-04-26 16:56:55,147 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:56:55,147 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:56:55,148 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:56:55,148 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:56:55,148 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "barrier-3t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:55" (1/1) ... [2025-04-26 16:56:55,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:56:55,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:55,174 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:55,176 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:55,194 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:56:55,194 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:56:55,194 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:56:55,194 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:56:55,194 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:56:55,194 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:56:55,194 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:56:55,194 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:56:55,194 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:56:55,194 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:56:55,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:56:55,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:56:55,196 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:55,232 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:56:55,233 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:56:55,306 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:56:55,307 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:56:55,316 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:56:55,317 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:56:55,317 INFO L201 PluginConnector]: Adding new model barrier-3t.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:56:55 BoogieIcfgContainer [2025-04-26 16:56:55,317 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:56:55,318 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:56:55,318 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:56:55,322 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:56:55,322 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:56:55,322 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "barrier-3t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:55" (1/2) ... [2025-04-26 16:56:55,323 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@26744a37 and model type barrier-3t.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:56:55, skipping insertion in model container [2025-04-26 16:56:55,323 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:56:55,323 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "barrier-3t.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:56:55" (2/2) ... [2025-04-26 16:56:55,324 INFO L376 chiAutomizerObserver]: Analyzing ICFG barrier-3t.c.bpl [2025-04-26 16:56:55,369 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 16:56:55,405 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:56:55,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:56:55,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:55,422 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:55,423 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:55,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 41 transitions, 103 flow [2025-04-26 16:56:55,491 INFO L116 PetriNetUnfolderBase]: 6/35 cut-off events. [2025-04-26 16:56:55,494 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 16:56:55,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 35 events. 6/35 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 72 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2025-04-26 16:56:55,498 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 41 transitions, 103 flow [2025-04-26 16:56:55,502 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 35 transitions, 88 flow [2025-04-26 16:56:55,502 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 39 places, 35 transitions, 88 flow [2025-04-26 16:56:55,508 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:56:55,908 WARN L140 AmpleReduction]: Number of pruned transitions: 728 [2025-04-26 16:56:55,908 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:56:55,908 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 166 [2025-04-26 16:56:55,908 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:93 [2025-04-26 16:56:55,909 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:363 [2025-04-26 16:56:55,910 WARN L145 AmpleReduction]: Times succ was already a loop node:378 [2025-04-26 16:56:55,910 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:33 [2025-04-26 16:56:55,910 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:56:55,914 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 623 states, 622 states have (on average 2.1318327974276525) internal successors, (in total 1326), 622 states have internal predecessors, (1326), 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:55,922 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:56:55,922 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:56:55,922 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:56:55,922 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:56:55,922 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:56:55,922 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:56:55,922 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:56:55,922 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:56:55,926 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 623 states, 622 states have (on average 2.1318327974276525) internal successors, (in total 1326), 622 states have internal predecessors, (1326), 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:55,964 INFO L131 ngComponentsAnalysis]: Automaton has 135 accepting balls. 404 [2025-04-26 16:56:55,965 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:55,965 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:55,971 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:56:55,971 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:56:55,971 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:56:55,972 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 623 states, 622 states have (on average 2.1318327974276525) internal successors, (in total 1326), 622 states have internal predecessors, (1326), 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:55,982 INFO L131 ngComponentsAnalysis]: Automaton has 135 accepting balls. 404 [2025-04-26 16:56:55,983 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:55,983 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:55,983 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:56:55,983 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:56:55,987 INFO L752 eck$LassoCheckResult]: Stem: "[84] $Ultimate##0-->L13: Formula: (= v_x2_10 0) InVars {} OutVars{x2=v_x2_10} AuxVars[] AssignedVars[x2]" "[120] L13-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:56:55,987 INFO L754 eck$LassoCheckResult]: Loop: "[92] L24-->L26: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[94] L26-->L24: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" [2025-04-26 16:56:55,991 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:55,992 INFO L85 PathProgramCache]: Analyzing trace with hash 3685, now seen corresponding path program 1 times [2025-04-26 16:56:55,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:55,998 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22861028] [2025-04-26 16:56:55,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:55,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:56,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:56,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:56,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:56,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:56,046 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:56,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:56,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:56,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:56,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:56,060 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:56,063 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:56,063 INFO L85 PathProgramCache]: Analyzing trace with hash 3907, now seen corresponding path program 1 times [2025-04-26 16:56:56,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:56,063 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046381213] [2025-04-26 16:56:56,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:56,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:56,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:56,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:56,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:56,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:56,071 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:56,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:56,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:56,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:56,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:56,074 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:56,075 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:56,075 INFO L85 PathProgramCache]: Analyzing trace with hash 3544231, now seen corresponding path program 1 times [2025-04-26 16:56:56,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:56,075 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222975929] [2025-04-26 16:56:56,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:56,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:56,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:56,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:56,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:56,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:56,080 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:56,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:56,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:56,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:56,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:56,085 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:56,125 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:56,125 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:56,126 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:56,126 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:56,126 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:56:56,126 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:56,126 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:56,126 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:56,126 INFO L132 ssoRankerPreferences]: Filename of dumped script: barrier-3t.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:56:56,126 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:56,126 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:56,149 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:56,196 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:56,196 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:56:56,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:56,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:56,201 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:56,203 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:56,204 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:56,204 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:56,227 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:56,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:56,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:56,231 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:56,233 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:56,234 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:56:56,234 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:56,306 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:56:56,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 16:56:56,311 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:56,312 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:56,312 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:56,312 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:56,312 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:56,312 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:56,312 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:56,312 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:56,312 INFO L132 ssoRankerPreferences]: Filename of dumped script: barrier-3t.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:56:56,312 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:56,312 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:56,313 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:56,337 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:56,341 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:56,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:56,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:56,344 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:56,347 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:56,347 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:56,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:56,359 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:56:56,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:56,360 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:56,360 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:56,367 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:56:56,367 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:56:56,370 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:56,376 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:56:56,376 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:56:56,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:56,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:56,396 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:56,398 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:56,399 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:56,402 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:56:56,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:56,404 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:56:56,405 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:56,405 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x1) = 1*z - 1*x1 Supporting invariants [] [2025-04-26 16:56:56,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:56,413 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:56,451 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:56,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:56,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:56,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:56,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:56,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:56,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:56,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:56,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:56,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:56,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:56,492 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:56,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:56,518 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:56,536 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:56,539 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 623 states, 622 states have (on average 2.1318327974276525) internal successors, (in total 1326), 622 states have internal predecessors, (1326), 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.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 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:56,730 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 623 states, 622 states have (on average 2.1318327974276525) internal successors, (in total 1326), 622 states have internal predecessors, (1326), 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.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 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 1846 states and 4067 transitions. Complement of second has 7 states. [2025-04-26 16:56:56,732 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:56:56,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 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:56,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 118 transitions. [2025-04-26 16:56:56,742 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 118 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 16:56:56,743 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:56,743 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 118 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:56:56,743 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:56,743 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 118 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 16:56:56,743 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:56,744 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1846 states and 4067 transitions. [2025-04-26 16:56:56,762 INFO L131 ngComponentsAnalysis]: Automaton has 139 accepting balls. 340 [2025-04-26 16:56:56,786 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1846 states to 1295 states and 2912 transitions. [2025-04-26 16:56:56,787 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 577 [2025-04-26 16:56:56,793 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 723 [2025-04-26 16:56:56,794 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1295 states and 2912 transitions. [2025-04-26 16:56:56,794 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:56,795 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1295 states and 2912 transitions. [2025-04-26 16:56:56,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states and 2912 transitions. [2025-04-26 16:56:56,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 1158. [2025-04-26 16:56:56,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1158 states, 1158 states have (on average 2.2573402417962005) internal successors, (in total 2614), 1157 states have internal predecessors, (2614), 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:56,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 2614 transitions. [2025-04-26 16:56:56,869 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1158 states and 2614 transitions. [2025-04-26 16:56:56,869 INFO L438 stractBuchiCegarLoop]: Abstraction has 1158 states and 2614 transitions. [2025-04-26 16:56:56,869 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:56:56,869 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1158 states and 2614 transitions. [2025-04-26 16:56:56,877 INFO L131 ngComponentsAnalysis]: Automaton has 139 accepting balls. 340 [2025-04-26 16:56:56,877 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:56,877 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:56,877 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:56:56,877 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:56:56,878 INFO L752 eck$LassoCheckResult]: Stem: "[84] $Ultimate##0-->L13: Formula: (= v_x2_10 0) InVars {} OutVars{x2=v_x2_10} AuxVars[] AssignedVars[x2]" "[120] L13-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[123] L13-1-->L39: 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:56,878 INFO L754 eck$LassoCheckResult]: Loop: "[101] L39-->L41: Formula: (< v_x3_5 v_z_5) InVars {x3=v_x3_5, z=v_z_5} OutVars{x3=v_x3_5, z=v_z_5} AuxVars[] AssignedVars[]" "[103] L41-->L39: Formula: (= (+ v_x3_7 1) v_x3_6) InVars {x3=v_x3_7} OutVars{x3=v_x3_6} AuxVars[] AssignedVars[x3]" [2025-04-26 16:56:56,879 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:56,879 INFO L85 PathProgramCache]: Analyzing trace with hash 114358, now seen corresponding path program 1 times [2025-04-26 16:56:56,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:56,879 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584548991] [2025-04-26 16:56:56,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:56,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:56,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:56,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:56,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:56,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:56,884 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:56,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:56,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:56,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:56,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:56,889 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:56,889 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:56,889 INFO L85 PathProgramCache]: Analyzing trace with hash 4195, now seen corresponding path program 1 times [2025-04-26 16:56:56,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:56,890 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878154521] [2025-04-26 16:56:56,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:56,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:56,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:56,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:56,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:56,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:56,894 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:56,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:56,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:56,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:56,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:56,896 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:56,898 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:56,898 INFO L85 PathProgramCache]: Analyzing trace with hash 109901272, now seen corresponding path program 1 times [2025-04-26 16:56:56,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:56,898 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365713630] [2025-04-26 16:56:56,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:56,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:56,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:56,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:56,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:56,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:56,904 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:56,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:56,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:56,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:56,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:56,909 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:56,924 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:56,924 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:56,924 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:56,924 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:56,924 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:56:56,924 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:56,924 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:56,924 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:56,924 INFO L132 ssoRankerPreferences]: Filename of dumped script: barrier-3t.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:56:56,924 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:56,924 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:56,925 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:56,943 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:56,944 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:56:56,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:56,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:56,948 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:56,949 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:56,950 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:56,950 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:56,970 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:56,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:56,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:56,973 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:56,977 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:56,977 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:56:56,977 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:57,045 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:56:57,050 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:57,051 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:57,051 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:57,051 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:57,051 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:57,051 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:57,051 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:57,051 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:57,051 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:57,051 INFO L132 ssoRankerPreferences]: Filename of dumped script: barrier-3t.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:56:57,051 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:57,051 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:57,052 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:57,068 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:57,068 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:57,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:57,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:57,080 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:57,082 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:57,083 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:57,093 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:57,093 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:56:57,093 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:57,093 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:57,093 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:57,094 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:56:57,094 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:56:57,096 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:57,099 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:56:57,099 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:56:57,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:57,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:57,101 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:57,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:56:57,104 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:57,107 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:56:57,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:57,108 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:56:57,108 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:57,108 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x3) = 1*z - 1*x3 Supporting invariants [] [2025-04-26 16:56:57,114 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:57,115 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:57,126 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:57,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:57,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:57,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:57,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:57,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:57,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:57,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:57,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:57,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:57,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:57,139 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:57,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:57,150 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:57,151 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:57,151 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1158 states and 2614 transitions. cyclomatic complexity: 1699 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:57,312 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1158 states and 2614 transitions. cyclomatic complexity: 1699. 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 3541 states and 8186 transitions. Complement of second has 7 states. [2025-04-26 16:56:57,312 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:56:57,313 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:57,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 124 transitions. [2025-04-26 16:56:57,313 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 124 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 16:56:57,313 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:57,313 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 124 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:56:57,314 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:57,314 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 124 transitions. Stem has 3 letters. Loop has 4 letters. [2025-04-26 16:56:57,314 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:57,314 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3541 states and 8186 transitions. [2025-04-26 16:56:57,351 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 136 [2025-04-26 16:56:57,397 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3541 states to 2083 states and 4860 transitions. [2025-04-26 16:56:57,397 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 554 [2025-04-26 16:56:57,399 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 725 [2025-04-26 16:56:57,399 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2083 states and 4860 transitions. [2025-04-26 16:56:57,400 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:57,400 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2083 states and 4860 transitions. [2025-04-26 16:56:57,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2083 states and 4860 transitions. [2025-04-26 16:56:57,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2083 to 1921. [2025-04-26 16:56:57,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1921 states, 1921 states have (on average 2.4003123373243103) internal successors, (in total 4611), 1920 states have internal predecessors, (4611), 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:57,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1921 states to 1921 states and 4611 transitions. [2025-04-26 16:56:57,452 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1921 states and 4611 transitions. [2025-04-26 16:56:57,452 INFO L438 stractBuchiCegarLoop]: Abstraction has 1921 states and 4611 transitions. [2025-04-26 16:56:57,453 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:56:57,453 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1921 states and 4611 transitions. [2025-04-26 16:56:57,464 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 136 [2025-04-26 16:56:57,464 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:57,464 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:57,465 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:56:57,465 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:56:57,465 INFO L752 eck$LassoCheckResult]: Stem: "[84] $Ultimate##0-->L13: Formula: (= v_x2_10 0) InVars {} OutVars{x2=v_x2_10} AuxVars[] AssignedVars[x2]" "[120] L13-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[123] L13-1-->L39: 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]" "[126] L14-->L54: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-04-26 16:56:57,466 INFO L754 eck$LassoCheckResult]: Loop: "[110] L54-->L56: Formula: (< v_x4_5 v_z_9) InVars {x4=v_x4_5, z=v_z_9} OutVars{x4=v_x4_5, z=v_z_9} AuxVars[] AssignedVars[]" "[112] L56-->L54: Formula: (= v_x4_6 (+ v_x4_7 1)) InVars {x4=v_x4_7} OutVars{x4=v_x4_6} AuxVars[] AssignedVars[x4]" [2025-04-26 16:56:57,466 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:57,466 INFO L85 PathProgramCache]: Analyzing trace with hash 3545224, now seen corresponding path program 1 times [2025-04-26 16:56:57,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:57,467 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23086391] [2025-04-26 16:56:57,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:57,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:57,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:57,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:57,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:57,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:57,471 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:57,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:57,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:57,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:57,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:57,475 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:57,476 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:57,476 INFO L85 PathProgramCache]: Analyzing trace with hash 4483, now seen corresponding path program 1 times [2025-04-26 16:56:57,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:57,476 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202300865] [2025-04-26 16:56:57,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:57,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:57,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:57,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:57,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:57,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:57,483 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:57,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:57,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:57,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:57,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:57,485 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:57,486 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:57,486 INFO L85 PathProgramCache]: Analyzing trace with hash -888003510, now seen corresponding path program 1 times [2025-04-26 16:56:57,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:57,486 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556682019] [2025-04-26 16:56:57,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:57,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:57,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:56:57,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:56:57,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:57,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:57,490 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:57,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:56:57,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:56:57,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:57,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:57,495 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:57,511 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:57,511 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:57,511 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:57,511 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:57,511 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:56:57,512 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:57,512 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:57,512 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:57,512 INFO L132 ssoRankerPreferences]: Filename of dumped script: barrier-3t.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:56:57,512 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:57,512 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:57,512 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:57,532 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:57,532 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:56:57,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:57,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:57,535 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:57,536 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:57,537 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:57,537 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:57,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 16:56:57,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:57,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:57,557 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:57,558 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:57,559 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:56:57,559 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:57,641 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:56:57,646 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:57,646 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:57,646 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:57,646 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:57,646 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:57,647 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:57,647 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:57,647 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:57,647 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:57,647 INFO L132 ssoRankerPreferences]: Filename of dumped script: barrier-3t.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:56:57,647 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:57,647 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:57,647 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:57,668 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:57,668 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:57,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:57,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:57,670 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:57,673 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:57,673 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:57,685 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:57,685 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:56:57,685 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:57,685 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:57,686 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:57,687 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:56:57,687 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:56:57,689 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:57,694 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:56:57,694 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:56:57,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:57,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:57,699 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:57,702 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:57,702 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:57,708 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:57,708 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:56:57,708 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:57,708 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x4) = 1*z - 1*x4 Supporting invariants [] [2025-04-26 16:56:57,719 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:57,720 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:57,736 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:57,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:57,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:57,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:57,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:57,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:57,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:57,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:57,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:57,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:57,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:57,759 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:57,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:57,779 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:57,780 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:57,780 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1921 states and 4611 transitions. cyclomatic complexity: 2956 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:57,903 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1921 states and 4611 transitions. cyclomatic complexity: 2956. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 5510 states and 13008 transitions. Complement of second has 7 states. [2025-04-26 16:56:57,904 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:56:57,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:57,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 128 transitions. [2025-04-26 16:56:57,906 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 128 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:56:57,906 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:57,906 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 128 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:56:57,906 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:57,906 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 128 transitions. Stem has 4 letters. Loop has 4 letters. [2025-04-26 16:56:57,906 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:57,906 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5510 states and 13008 transitions. [2025-04-26 16:56:57,975 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2025-04-26 16:56:57,976 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5510 states to 147 states and 318 transitions. [2025-04-26 16:56:57,976 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2025-04-26 16:56:57,976 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 64 [2025-04-26 16:56:57,976 INFO L74 IsDeterministic]: Start isDeterministic. Operand 147 states and 318 transitions. [2025-04-26 16:56:57,977 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:57,977 INFO L218 hiAutomatonCegarLoop]: Abstraction has 147 states and 318 transitions. [2025-04-26 16:56:57,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states and 318 transitions. [2025-04-26 16:56:57,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2025-04-26 16:56:57,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 147 states have (on average 2.163265306122449) internal successors, (in total 318), 146 states have internal predecessors, (318), 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:57,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 318 transitions. [2025-04-26 16:56:57,981 INFO L240 hiAutomatonCegarLoop]: Abstraction has 147 states and 318 transitions. [2025-04-26 16:56:57,981 INFO L438 stractBuchiCegarLoop]: Abstraction has 147 states and 318 transitions. [2025-04-26 16:56:57,981 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:56:57,981 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 147 states and 318 transitions. [2025-04-26 16:56:57,982 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2025-04-26 16:56:57,982 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:57,982 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:57,982 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:56:57,982 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:56:57,983 INFO L752 eck$LassoCheckResult]: Stem: "[84] $Ultimate##0-->L13: Formula: (= v_x2_10 0) InVars {} OutVars{x2=v_x2_10} AuxVars[] AssignedVars[x2]" "[120] L13-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[91] L24-->L28: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" "[93] L28-->L29: Formula: (= v_x2_1 (+ v_x2_2 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[95] L29-->L30-1: Formula: (<= 3 v_x2_3) InVars {x2=v_x2_3} OutVars{x2=v_x2_3} AuxVars[] AssignedVars[]" [2025-04-26 16:56:57,983 INFO L754 eck$LassoCheckResult]: Loop: "[97] L30-1-->L32: Formula: (< v_x3_1 v_z_3) InVars {x3=v_x3_1, z=v_z_3} OutVars{x3=v_x3_1, z=v_z_3} AuxVars[] AssignedVars[]" "[99] L32-->L30-1: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" [2025-04-26 16:56:57,983 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:57,983 INFO L85 PathProgramCache]: Analyzing trace with hash 109870264, now seen corresponding path program 1 times [2025-04-26 16:56:57,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:57,983 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881145000] [2025-04-26 16:56:57,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:57,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:57,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:57,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:57,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:57,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:58,033 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:58,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:56:58,033 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881145000] [2025-04-26 16:56:58,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881145000] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:56:58,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:56:58,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:56:58,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050622684] [2025-04-26 16:56:58,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:56:58,038 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:56:58,038 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:58,038 INFO L85 PathProgramCache]: Analyzing trace with hash 4067, now seen corresponding path program 1 times [2025-04-26 16:56:58,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:58,038 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251270811] [2025-04-26 16:56:58,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:58,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:58,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:58,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:58,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:58,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:58,043 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:58,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:58,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:58,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:58,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:58,047 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:58,058 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:58,058 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:58,058 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:58,058 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:58,058 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:56:58,058 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:58,058 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:58,058 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:58,058 INFO L132 ssoRankerPreferences]: Filename of dumped script: barrier-3t.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:56:58,058 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:58,058 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:58,058 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:58,072 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:58,072 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:56:58,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:58,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:58,081 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:58,083 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:58,084 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:58,084 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:58,104 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:58,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:58,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:58,106 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:58,108 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:58,109 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:56:58,109 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:58,175 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:56:58,179 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:58,180 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:58,180 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:58,180 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:58,180 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:58,180 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:58,180 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:58,180 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:58,180 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:58,180 INFO L132 ssoRankerPreferences]: Filename of dumped script: barrier-3t.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:56:58,180 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:58,180 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:58,181 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:58,197 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:58,198 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:58,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:58,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:58,200 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:58,201 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:58,202 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:58,212 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:58,212 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:56:58,212 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:58,212 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:58,212 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:58,213 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:56:58,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:56:58,215 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:58,217 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:56:58,217 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:56:58,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:58,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:58,219 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:58,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 16:56:58,221 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:58,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 16:56:58,225 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:56:58,225 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:58,225 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x3) = 1*z - 1*x3 Supporting invariants [] [2025-04-26 16:56:58,231 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:58,232 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:58,243 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:58,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:58,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:58,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:58,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:58,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:58,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:58,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:58,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:58,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:58,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:58,260 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:58,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:58,275 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:58,276 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:58,276 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 147 states and 318 transitions. cyclomatic complexity: 194 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 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:58,316 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 147 states and 318 transitions. cyclomatic complexity: 194. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 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 292 states and 648 transitions. Complement of second has 7 states. [2025-04-26 16:56:58,316 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:56:58,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 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:58,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2025-04-26 16:56:58,317 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:56:58,317 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:58,317 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 16:56:58,317 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:58,317 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 16:56:58,317 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:58,317 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 292 states and 648 transitions. [2025-04-26 16:56:58,319 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2025-04-26 16:56:58,320 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 292 states to 202 states and 429 transitions. [2025-04-26 16:56:58,321 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2025-04-26 16:56:58,321 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78 [2025-04-26 16:56:58,321 INFO L74 IsDeterministic]: Start isDeterministic. Operand 202 states and 429 transitions. [2025-04-26 16:56:58,321 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:58,321 INFO L218 hiAutomatonCegarLoop]: Abstraction has 202 states and 429 transitions. [2025-04-26 16:56:58,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states and 429 transitions. [2025-04-26 16:56:58,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 149. [2025-04-26 16:56:58,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 149 states have (on average 2.1476510067114094) internal successors, (in total 320), 148 states have internal predecessors, (320), 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:58,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 320 transitions. [2025-04-26 16:56:58,323 INFO L240 hiAutomatonCegarLoop]: Abstraction has 149 states and 320 transitions. [2025-04-26 16:56:58,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:56:58,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:56:58,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:56:58,326 INFO L87 Difference]: Start difference. First operand 149 states and 320 transitions. Second operand has 4 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:58,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:56:58,343 INFO L93 Difference]: Finished difference Result 84 states and 164 transitions. [2025-04-26 16:56:58,343 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 164 transitions. [2025-04-26 16:56:58,344 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-04-26 16:56:58,344 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 74 states and 140 transitions. [2025-04-26 16:56:58,344 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2025-04-26 16:56:58,345 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2025-04-26 16:56:58,345 INFO L74 IsDeterministic]: Start isDeterministic. Operand 74 states and 140 transitions. [2025-04-26 16:56:58,345 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:58,345 INFO L218 hiAutomatonCegarLoop]: Abstraction has 74 states and 140 transitions. [2025-04-26 16:56:58,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 140 transitions. [2025-04-26 16:56:58,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-04-26 16:56:58,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 74 states have (on average 1.8918918918918919) internal successors, (in total 140), 73 states have internal predecessors, (140), 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:58,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 140 transitions. [2025-04-26 16:56:58,346 INFO L240 hiAutomatonCegarLoop]: Abstraction has 74 states and 140 transitions. [2025-04-26 16:56:58,346 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 16:56:58,347 INFO L438 stractBuchiCegarLoop]: Abstraction has 74 states and 140 transitions. [2025-04-26 16:56:58,347 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:56:58,347 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 140 transitions. [2025-04-26 16:56:58,347 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-04-26 16:56:58,347 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:58,347 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:58,347 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:56:58,347 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:56:58,348 INFO L752 eck$LassoCheckResult]: Stem: "[84] $Ultimate##0-->L13: Formula: (= v_x2_10 0) InVars {} OutVars{x2=v_x2_10} AuxVars[] AssignedVars[x2]" "[120] L13-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[123] L13-1-->L39: 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]" "[100] L39-->L43: Formula: (<= v_z_6 v_x3_8) InVars {x3=v_x3_8, z=v_z_6} OutVars{x3=v_x3_8, z=v_z_6} AuxVars[] AssignedVars[]" "[102] L43-->L44: Formula: (= (+ v_x2_5 1) v_x2_4) InVars {x2=v_x2_5} OutVars{x2=v_x2_4} AuxVars[] AssignedVars[x2]" "[91] L24-->L28: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" "[93] L28-->L29: Formula: (= v_x2_1 (+ v_x2_2 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[104] L44-->L45-1: Formula: (<= 3 v_x2_6) InVars {x2=v_x2_6} OutVars{x2=v_x2_6} AuxVars[] AssignedVars[]" [2025-04-26 16:56:58,348 INFO L754 eck$LassoCheckResult]: Loop: "[106] L45-1-->L47: Formula: (< v_x4_1 v_z_7) InVars {x4=v_x4_1, z=v_z_7} OutVars{x4=v_x4_1, z=v_z_7} AuxVars[] AssignedVars[]" "[108] L47-->L45-1: Formula: (= (+ v_x4_3 1) v_x4_2) InVars {x4=v_x4_3} OutVars{x4=v_x4_2} AuxVars[] AssignedVars[x4]" [2025-04-26 16:56:58,348 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:58,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1302851726, now seen corresponding path program 1 times [2025-04-26 16:56:58,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:58,348 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951087272] [2025-04-26 16:56:58,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:58,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:58,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:56:58,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:56:58,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:58,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:58,391 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:58,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:56:58,391 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951087272] [2025-04-26 16:56:58,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951087272] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:56:58,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:56:58,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:56:58,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902663736] [2025-04-26 16:56:58,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:56:58,392 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:56:58,392 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:58,392 INFO L85 PathProgramCache]: Analyzing trace with hash 4355, now seen corresponding path program 1 times [2025-04-26 16:56:58,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:58,392 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612723946] [2025-04-26 16:56:58,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:58,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:58,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:58,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:58,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:58,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:58,397 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:58,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:58,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:58,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:58,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:58,399 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:58,421 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:58,421 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:58,421 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:58,421 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:58,421 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:56:58,421 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:58,421 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:58,421 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:58,421 INFO L132 ssoRankerPreferences]: Filename of dumped script: barrier-3t.c.bpl_petrified1_Iteration5_Loop [2025-04-26 16:56:58,421 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:58,421 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:58,421 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:58,434 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:58,434 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:56:58,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:58,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:58,436 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:58,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 16:56:58,439 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:58,439 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:58,454 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-04-26 16:56:58,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:58,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:58,456 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:58,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 16:56:58,458 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:56:58,458 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:58,522 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:56:58,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-04-26 16:56:58,526 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:58,526 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:58,526 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:58,526 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:58,526 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:58,526 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:58,526 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:58,527 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:58,527 INFO L132 ssoRankerPreferences]: Filename of dumped script: barrier-3t.c.bpl_petrified1_Iteration5_Loop [2025-04-26 16:56:58,527 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:58,527 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:58,527 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:58,548 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:58,548 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:58,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:58,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:58,550 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:58,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 16:56:58,553 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:58,563 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:58,563 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:56:58,563 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:58,563 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:58,563 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:58,564 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:56:58,564 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:56:58,567 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:58,570 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:56:58,570 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:56:58,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:58,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:58,572 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:58,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 16:56:58,577 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:58,579 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:56:58,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-04-26 16:56:58,580 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:56:58,580 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:58,580 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x4) = 1*z - 1*x4 Supporting invariants [] [2025-04-26 16:56:58,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:58,587 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:58,598 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:58,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:56:58,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:56:58,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:58,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:58,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:58,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:58,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:58,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:58,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:58,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:58,621 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:58,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:58,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:58,632 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:58,632 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 140 transitions. cyclomatic complexity: 78 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 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:58,653 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 74 states and 140 transitions. cyclomatic complexity: 78. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 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 98 states and 177 transitions. Complement of second has 6 states. [2025-04-26 16:56:58,654 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:58,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 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:58,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2025-04-26 16:56:58,654 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 16:56:58,654 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:58,654 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 16:56:58,654 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:58,654 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 8 letters. Loop has 4 letters. [2025-04-26 16:56:58,654 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:58,655 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98 states and 177 transitions. [2025-04-26 16:56:58,655 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:56:58,655 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98 states to 0 states and 0 transitions. [2025-04-26 16:56:58,655 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:56:58,655 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:56:58,655 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:56:58,655 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:56:58,655 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:58,655 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:58,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:56:58,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 16:56:58,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-26 16:56:58,656 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 5 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:58,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:56:58,656 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2025-04-26 16:56:58,656 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2025-04-26 16:56:58,656 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:56:58,656 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2025-04-26 16:56:58,656 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:56:58,656 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:56:58,656 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:56:58,656 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:56:58,656 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:58,656 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:58,656 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-26 16:56:58,659 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:58,659 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:56:58,659 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:56:58,659 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:56:58,659 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:56:58,671 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:58,672 INFO L201 PluginConnector]: Adding new model barrier-3t.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:56:58 BoogieIcfgContainer [2025-04-26 16:56:58,673 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:56:58,673 INFO L158 Benchmark]: Toolchain (without parser) took 3581.42ms. Allocated memory was 167.8MB in the beginning and 142.6MB in the end (delta: -25.2MB). Free memory was 93.9MB in the beginning and 48.4MB in the end (delta: 45.4MB). Peak memory consumption was 24.3MB. Max. memory is 8.0GB. [2025-04-26 16:56:58,673 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.16ms. Allocated memory is still 167.8MB. Free memory is still 94.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:58,674 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.25ms. Allocated memory is still 167.8MB. Free memory was 93.9MB in the beginning and 91.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:58,674 INFO L158 Benchmark]: Boogie Preprocessor took 22.16ms. Allocated memory is still 167.8MB. Free memory was 91.9MB in the beginning and 91.0MB in the end (delta: 881.9kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:56:58,674 INFO L158 Benchmark]: RCFGBuilder took 169.63ms. Allocated memory is still 167.8MB. Free memory was 90.8MB in the beginning and 81.3MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:56:58,674 INFO L158 Benchmark]: BuchiAutomizer took 3354.84ms. Allocated memory was 167.8MB in the beginning and 142.6MB in the end (delta: -25.2MB). Free memory was 81.3MB in the beginning and 48.4MB in the end (delta: 32.8MB). Peak memory consumption was 11.7MB. Max. memory is 8.0GB. [2025-04-26 16:56:58,678 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.16ms. Allocated memory is still 167.8MB. Free memory is still 94.7MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.25ms. Allocated memory is still 167.8MB. Free memory was 93.9MB in the beginning and 91.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 22.16ms. Allocated memory is still 167.8MB. Free memory was 91.9MB in the beginning and 91.0MB in the end (delta: 881.9kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 169.63ms. Allocated memory is still 167.8MB. Free memory was 90.8MB in the beginning and 81.3MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 3354.84ms. Allocated memory was 167.8MB in the beginning and 142.6MB in the end (delta: -25.2MB). Free memory was 81.3MB in the beginning and 48.4MB in the end (delta: 32.8MB). Peak memory consumption was 11.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.2s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 1.4s. Construction of modules took 0.2s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 352 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 268 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 263 mSDsluCounter, 310 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 148 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 286 IncrementalHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 162 mSDtfsCounter, 286 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 63ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s InitialAbstractionConstructionTime: 0.5s InitialAbstraction: Time to compute Ample Reduction [ms]: 509, Number of transitions in reduction automaton: 1326, Number of states in reduction automaton: 623, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (2 trivial, 5 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x1 + z and consists of 5 locations. One deterministic module has affine ranking function -1 * x3 + z and consists of 5 locations. One deterministic module has affine ranking function -1 * x4 + z and consists of 5 locations. One deterministic module has affine ranking function -1 * x3 + z and consists of 5 locations. One deterministic module has affine ranking function -1 * x4 + z and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 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:58,690 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...