/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i /storage/cav23-termute-examples/4_plus_thr/barrier-4t.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:57:07,340 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:57:07,385 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:57:07,391 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:57:07,391 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:57:07,391 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:57:07,391 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:57:07,415 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:57:07,415 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:57:07,415 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:57:07,416 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:57:07,416 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:57:07,416 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:57:07,416 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:57:07,416 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:57:07,416 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:57:07,416 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:57:07,416 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:57:07,416 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:57:07,416 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:57:07,416 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:57:07,416 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:57:07,417 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:57:07,417 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:57:07,417 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:57:07,417 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:57:07,417 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:57:07,417 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:57:07,417 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:57:07,417 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:57:07,417 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:57:07,417 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:57:07,417 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:57:07,417 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:57:07,417 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:57:07,417 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:57:07,417 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:57:07,417 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:57:07,417 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:57:07,418 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:57:07,418 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:57:07,418 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:57:07,418 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:57:07,623 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:57:07,628 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:57:07,629 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:57:07,630 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:57:07,630 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:57:07,631 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/4_plus_thr/barrier-4t.c.bpl [2025-04-26 16:57:07,631 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/4_plus_thr/barrier-4t.c.bpl' [2025-04-26 16:57:07,642 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:57:07,643 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:57:07,644 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:57:07,644 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:57:07,644 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:57:07,651 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "barrier-4t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:07" (1/1) ... [2025-04-26 16:57:07,673 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "barrier-4t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:07" (1/1) ... [2025-04-26 16:57:07,678 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:57:07,679 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:57:07,681 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:57:07,681 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:57:07,681 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:57:07,685 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "barrier-4t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:07" (1/1) ... [2025-04-26 16:57:07,685 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "barrier-4t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:07" (1/1) ... [2025-04-26 16:57:07,686 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "barrier-4t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:07" (1/1) ... [2025-04-26 16:57:07,687 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "barrier-4t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:07" (1/1) ... [2025-04-26 16:57:07,688 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "barrier-4t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:07" (1/1) ... [2025-04-26 16:57:07,688 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "barrier-4t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:07" (1/1) ... [2025-04-26 16:57:07,693 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "barrier-4t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:07" (1/1) ... [2025-04-26 16:57:07,694 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "barrier-4t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:07" (1/1) ... [2025-04-26 16:57:07,694 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "barrier-4t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:07" (1/1) ... [2025-04-26 16:57:07,701 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:57:07,704 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:57:07,704 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:57:07,704 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:57:07,704 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "barrier-4t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:07" (1/1) ... [2025-04-26 16:57:07,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:57:07,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:07,724 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:57:07,730 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:57:07,746 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:57:07,746 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:57:07,746 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:57:07,746 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:57:07,746 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:57:07,746 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:57:07,746 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:57:07,747 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:57:07,747 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:57:07,747 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:57:07,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:57:07,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:57:07,747 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 16:57:07,747 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 16:57:07,747 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 16:57:07,747 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:57:07,784 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:57:07,785 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:57:07,884 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:57:07,884 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:57:07,892 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:57:07,892 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:57:07,893 INFO L201 PluginConnector]: Adding new model barrier-4t.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:57:07 BoogieIcfgContainer [2025-04-26 16:57:07,894 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:57:07,895 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:57:07,895 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:57:07,899 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:57:07,899 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:57:07,899 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "barrier-4t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:07" (1/2) ... [2025-04-26 16:57:07,900 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@756e7233 and model type barrier-4t.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:57:07, skipping insertion in model container [2025-04-26 16:57:07,901 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:57:07,901 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "barrier-4t.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:57:07" (2/2) ... [2025-04-26 16:57:07,902 INFO L376 chiAutomizerObserver]: Analyzing ICFG barrier-4t.c.bpl [2025-04-26 16:57:07,965 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-26 16:57:07,999 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:57:07,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:57:07,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:08,001 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:57:08,003 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:57:08,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 54 transitions, 136 flow [2025-04-26 16:57:08,077 INFO L116 PetriNetUnfolderBase]: 8/46 cut-off events. [2025-04-26 16:57:08,078 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-26 16:57:08,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 46 events. 8/46 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 114 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2025-04-26 16:57:08,082 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 54 transitions, 136 flow [2025-04-26 16:57:08,085 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 46 transitions, 116 flow [2025-04-26 16:57:08,085 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 51 places, 46 transitions, 116 flow [2025-04-26 16:57:08,089 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:57:09,023 WARN L140 AmpleReduction]: Number of pruned transitions: 9248 [2025-04-26 16:57:09,024 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:57:09,024 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 1557 [2025-04-26 16:57:09,024 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:235 [2025-04-26 16:57:09,024 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:3046 [2025-04-26 16:57:09,024 WARN L145 AmpleReduction]: Times succ was already a loop node:3869 [2025-04-26 16:57:09,024 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:483 [2025-04-26 16:57:09,024 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:57:09,047 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 4839 states, 4838 states have (on average 2.5117817279867714) internal successors, (in total 12152), 4838 states have internal predecessors, (12152), 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:57:09,055 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:57:09,055 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:57:09,055 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:57:09,055 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:57:09,055 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:57:09,056 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:57:09,056 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:57:09,056 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:57:09,068 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4839 states, 4838 states have (on average 2.5117817279867714) internal successors, (in total 12152), 4838 states have internal predecessors, (12152), 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:57:09,199 INFO L131 ngComponentsAnalysis]: Automaton has 859 accepting balls. 3316 [2025-04-26 16:57:09,199 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:57:09,199 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:57:09,203 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:57:09,203 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:57:09,203 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:57:09,212 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4839 states, 4838 states have (on average 2.5117817279867714) internal successors, (in total 12152), 4838 states have internal predecessors, (12152), 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:57:09,266 INFO L131 ngComponentsAnalysis]: Automaton has 859 accepting balls. 3316 [2025-04-26 16:57:09,267 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:57:09,267 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:57:09,267 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:57:09,267 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:57:09,271 INFO L752 eck$LassoCheckResult]: Stem: "[112] $Ultimate##0-->L13: Formula: (= v_x2_10 0) InVars {} OutVars{x2=v_x2_10} AuxVars[] AssignedVars[x2]" "[158] L13-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:57:09,272 INFO L754 eck$LassoCheckResult]: Loop: "[121] L26-->L28: 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[]" "[123] L28-->L26: 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:57:09,275 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:09,275 INFO L85 PathProgramCache]: Analyzing trace with hash 4591, now seen corresponding path program 1 times [2025-04-26 16:57:09,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:09,282 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199810423] [2025-04-26 16:57:09,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:09,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:09,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:09,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:09,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:09,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:09,333 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:09,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:09,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:09,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:09,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:09,348 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:09,350 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:09,350 INFO L85 PathProgramCache]: Analyzing trace with hash 4835, now seen corresponding path program 1 times [2025-04-26 16:57:09,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:09,350 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265630483] [2025-04-26 16:57:09,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:09,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:09,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:09,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:09,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:09,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:09,360 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:09,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:09,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:09,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:09,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:09,366 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:09,367 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:09,367 INFO L85 PathProgramCache]: Analyzing trace with hash 4415825, now seen corresponding path program 1 times [2025-04-26 16:57:09,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:09,367 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651048090] [2025-04-26 16:57:09,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:09,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:09,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:57:09,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:57:09,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:09,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:09,372 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:09,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:57:09,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:57:09,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:09,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:09,381 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:09,447 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:09,452 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:09,452 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:09,452 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:09,461 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:57:09,461 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:09,461 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:09,461 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:09,462 INFO L132 ssoRankerPreferences]: Filename of dumped script: barrier-4t.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:57:09,462 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:09,462 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:09,501 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:09,533 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:09,533 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:57:09,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:09,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:09,536 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:57:09,538 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:57:09,540 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:57:09,540 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:09,563 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:57:09,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:09,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:09,566 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:57:09,568 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:57:09,569 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:57:09,569 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:09,643 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:57:09,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 16:57:09,648 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:09,648 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:09,648 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:09,648 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:09,648 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:57:09,648 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:09,648 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:09,648 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:09,648 INFO L132 ssoRankerPreferences]: Filename of dumped script: barrier-4t.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:57:09,648 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:09,648 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:09,649 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:09,673 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:09,677 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:57:09,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:09,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:09,681 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:57:09,683 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:57:09,684 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:57:09,695 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:57:09,695 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:57:09,696 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:57:09,696 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:57:09,697 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:57:09,701 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:57:09,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:57:09,705 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:57:09,710 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:57:09,710 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:57:09,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:09,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:09,714 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:57:09,715 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:57:09,716 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:57:09,719 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:57:09,720 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:57:09,720 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:57:09,721 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:57:09,721 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x1) = 1*z - 1*x1 Supporting invariants [] [2025-04-26 16:57:09,727 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:57:09,730 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:57:09,753 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:09,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:09,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:09,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:09,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:09,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:57:09,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:09,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:09,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:09,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:09,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:09,777 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:57:09,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:09,795 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:57:09,815 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:57:09,829 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 4839 states, 4838 states have (on average 2.5117817279867714) internal successors, (in total 12152), 4838 states have internal predecessors, (12152), 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:57:10,187 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 4839 states, 4838 states have (on average 2.5117817279867714) internal successors, (in total 12152), 4838 states have internal predecessors, (12152), 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 14249 states and 36711 transitions. Complement of second has 7 states. [2025-04-26 16:57:10,188 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:57:10,191 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:57:10,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 162 transitions. [2025-04-26 16:57:10,195 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 162 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 16:57:10,196 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:10,196 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 162 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:57:10,196 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:10,196 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 162 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 16:57:10,196 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:10,197 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14249 states and 36711 transitions. [2025-04-26 16:57:10,351 INFO L131 ngComponentsAnalysis]: Automaton has 1012 accepting balls. 3078 [2025-04-26 16:57:10,460 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14249 states to 10721 states and 27962 transitions. [2025-04-26 16:57:10,461 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4910 [2025-04-26 16:57:10,477 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5941 [2025-04-26 16:57:10,478 INFO L74 IsDeterministic]: Start isDeterministic. Operand 10721 states and 27962 transitions. [2025-04-26 16:57:10,478 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:57:10,478 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10721 states and 27962 transitions. [2025-04-26 16:57:10,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10721 states and 27962 transitions. [2025-04-26 16:57:10,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10721 to 9735. [2025-04-26 16:57:10,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9735 states, 9735 states have (on average 2.5960965588084233) internal successors, (in total 25273), 9734 states have internal predecessors, (25273), 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:57:10,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9735 states to 9735 states and 25273 transitions. [2025-04-26 16:57:10,847 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9735 states and 25273 transitions. [2025-04-26 16:57:10,847 INFO L438 stractBuchiCegarLoop]: Abstraction has 9735 states and 25273 transitions. [2025-04-26 16:57:10,847 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:57:10,847 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9735 states and 25273 transitions. [2025-04-26 16:57:10,895 INFO L131 ngComponentsAnalysis]: Automaton has 1012 accepting balls. 3078 [2025-04-26 16:57:10,895 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:57:10,895 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:57:10,896 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:57:10,896 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:57:10,896 INFO L752 eck$LassoCheckResult]: Stem: "[112] $Ultimate##0-->L13: Formula: (= v_x2_10 0) InVars {} OutVars{x2=v_x2_10} AuxVars[] AssignedVars[x2]" "[158] L13-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[161] L13-1-->L41: 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:57:10,896 INFO L754 eck$LassoCheckResult]: Loop: "[130] L41-->L43: 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[]" "[132] L43-->L41: 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:57:10,897 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:10,897 INFO L85 PathProgramCache]: Analyzing trace with hash 142482, now seen corresponding path program 1 times [2025-04-26 16:57:10,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:10,897 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952043315] [2025-04-26 16:57:10,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:10,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:10,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:57:10,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:57:10,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:10,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:10,902 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:10,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:57:10,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:57:10,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:10,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:10,906 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:10,907 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:10,907 INFO L85 PathProgramCache]: Analyzing trace with hash 5123, now seen corresponding path program 1 times [2025-04-26 16:57:10,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:10,907 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313062403] [2025-04-26 16:57:10,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:10,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:10,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:10,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:10,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:10,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:10,911 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:10,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:10,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:10,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:10,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:10,913 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:10,913 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:10,914 INFO L85 PathProgramCache]: Analyzing trace with hash 136929364, now seen corresponding path program 1 times [2025-04-26 16:57:10,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:10,914 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154286992] [2025-04-26 16:57:10,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:10,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:10,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:57:10,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:57:10,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:10,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:10,920 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:10,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:57:10,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:57:10,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:10,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:10,924 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:10,940 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:10,940 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:10,940 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:10,940 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:10,940 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:57:10,940 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:10,940 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:10,940 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:10,940 INFO L132 ssoRankerPreferences]: Filename of dumped script: barrier-4t.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:57:10,940 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:10,942 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:10,942 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:10,962 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:10,963 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:57:10,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:10,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:10,965 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:57:10,966 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:57:10,968 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:57:10,968 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:10,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 16:57:10,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:10,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:10,988 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:57:10,990 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:57:10,991 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:57:10,992 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:11,060 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:57:11,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 16:57:11,065 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:11,065 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:11,065 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:11,065 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:11,065 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:57:11,065 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:11,065 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:11,065 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:11,065 INFO L132 ssoRankerPreferences]: Filename of dumped script: barrier-4t.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:57:11,065 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:11,065 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:11,066 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:11,085 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:11,086 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:57:11,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:11,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:11,088 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:57:11,090 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:57:11,091 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:57:11,102 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:57:11,103 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:57:11,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:57:11,103 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:57:11,103 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:57:11,104 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:57:11,104 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:57:11,106 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:57:11,109 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:57:11,109 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:57:11,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:11,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:11,113 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:57:11,115 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:57:11,115 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:57:11,118 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:57:11,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 16:57:11,119 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:57:11,119 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:57:11,119 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x3) = 1*z - 1*x3 Supporting invariants [] [2025-04-26 16:57:11,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 16:57:11,129 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:57:11,144 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:11,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:57:11,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:57:11,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:11,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:11,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:57:11,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:11,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:11,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:11,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:11,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:11,162 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:57:11,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:11,177 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:57:11,178 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:57:11,178 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9735 states and 25273 transitions. cyclomatic complexity: 17275 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:57:11,630 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9735 states and 25273 transitions. cyclomatic complexity: 17275. 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 30168 states and 81195 transitions. Complement of second has 7 states. [2025-04-26 16:57:11,631 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:57:11,632 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:57:11,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 166 transitions. [2025-04-26 16:57:11,632 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 166 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 16:57:11,632 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:11,632 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 166 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:57:11,632 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:11,632 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 166 transitions. Stem has 3 letters. Loop has 4 letters. [2025-04-26 16:57:11,633 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:11,633 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30168 states and 81195 transitions. [2025-04-26 16:57:12,017 INFO L131 ngComponentsAnalysis]: Automaton has 647 accepting balls. 1572 [2025-04-26 16:57:12,253 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30168 states to 19288 states and 51639 transitions. [2025-04-26 16:57:12,253 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5056 [2025-04-26 16:57:12,271 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6509 [2025-04-26 16:57:12,272 INFO L74 IsDeterministic]: Start isDeterministic. Operand 19288 states and 51639 transitions. [2025-04-26 16:57:12,272 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:57:12,272 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19288 states and 51639 transitions. [2025-04-26 16:57:12,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19288 states and 51639 transitions. [2025-04-26 16:57:12,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19288 to 17904. [2025-04-26 16:57:12,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17904 states, 17904 states have (on average 2.7346403038427165) internal successors, (in total 48961), 17903 states have internal predecessors, (48961), 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:57:12,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17904 states to 17904 states and 48961 transitions. [2025-04-26 16:57:12,839 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17904 states and 48961 transitions. [2025-04-26 16:57:12,839 INFO L438 stractBuchiCegarLoop]: Abstraction has 17904 states and 48961 transitions. [2025-04-26 16:57:12,840 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:57:12,840 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17904 states and 48961 transitions. [2025-04-26 16:57:12,928 INFO L131 ngComponentsAnalysis]: Automaton has 647 accepting balls. 1572 [2025-04-26 16:57:12,929 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:57:12,929 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:57:12,929 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:57:12,929 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:57:12,930 INFO L752 eck$LassoCheckResult]: Stem: "[112] $Ultimate##0-->L13: Formula: (= v_x2_10 0) InVars {} OutVars{x2=v_x2_10} AuxVars[] AssignedVars[x2]" "[158] L13-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[161] L13-1-->L41: 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]" "[164] L14-->L56: 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:57:12,930 INFO L754 eck$LassoCheckResult]: Loop: "[139] L56-->L58: 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[]" "[141] L58-->L56: 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:57:12,930 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:12,930 INFO L85 PathProgramCache]: Analyzing trace with hash 4417106, now seen corresponding path program 1 times [2025-04-26 16:57:12,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:12,930 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045460924] [2025-04-26 16:57:12,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:12,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:12,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:57:12,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:57:12,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:12,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:12,935 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:12,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:57:12,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:57:12,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:12,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:12,938 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:12,938 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:12,938 INFO L85 PathProgramCache]: Analyzing trace with hash 5411, now seen corresponding path program 1 times [2025-04-26 16:57:12,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:12,939 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899528275] [2025-04-26 16:57:12,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:12,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:12,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:12,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:12,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:12,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:12,944 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:12,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:12,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:12,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:12,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:12,947 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:12,947 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:12,947 INFO L85 PathProgramCache]: Analyzing trace with hash -50123980, now seen corresponding path program 1 times [2025-04-26 16:57:12,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:12,947 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326654405] [2025-04-26 16:57:12,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:12,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:12,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:57:12,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:57:12,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:12,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:12,950 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:12,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:57:12,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:57:12,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:12,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:12,953 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:12,967 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:12,967 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:12,967 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:12,967 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:12,967 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:57:12,967 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:12,967 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:12,967 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:12,967 INFO L132 ssoRankerPreferences]: Filename of dumped script: barrier-4t.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:57:12,967 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:12,967 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:12,968 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:12,984 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:12,984 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:57:12,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:12,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:12,986 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:57:12,987 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:57:12,989 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:57:12,989 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:13,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 16:57:13,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:13,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:13,008 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:57:13,009 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:57:13,011 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:57:13,011 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:13,078 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:57:13,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 16:57:13,083 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:13,083 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:13,083 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:13,083 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:13,083 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:57:13,083 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:13,083 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:13,083 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:13,083 INFO L132 ssoRankerPreferences]: Filename of dumped script: barrier-4t.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:57:13,083 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:13,083 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:13,084 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:13,102 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:13,102 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:57:13,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:13,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:13,104 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:57:13,105 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:57:13,107 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:57:13,116 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:57:13,117 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:57:13,117 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:57:13,117 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:57:13,117 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:57:13,118 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:57:13,118 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:57:13,120 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:57:13,122 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:57:13,122 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:57:13,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:13,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:13,124 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:57:13,126 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:57:13,127 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:57:13,129 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:57:13,130 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:57:13,130 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:57:13,130 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:57:13,130 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x4, z) = -1*x4 + 1*z Supporting invariants [] [2025-04-26 16:57:13,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 16:57:13,137 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:57:13,148 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:13,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:57:13,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:57:13,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:13,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:13,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:57:13,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:13,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:13,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:13,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:13,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:13,163 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:57:13,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:13,177 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:57:13,178 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:57:13,178 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17904 states and 48961 transitions. cyclomatic complexity: 33323 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:57:13,701 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17904 states and 48961 transitions. cyclomatic complexity: 33323. 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 57514 states and 158530 transitions. Complement of second has 7 states. [2025-04-26 16:57:13,702 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:57:13,703 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:57:13,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 173 transitions. [2025-04-26 16:57:13,703 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 173 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:57:13,703 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:13,703 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 173 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:57:13,703 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:13,703 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 173 transitions. Stem has 4 letters. Loop has 4 letters. [2025-04-26 16:57:13,703 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:13,703 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57514 states and 158530 transitions. [2025-04-26 16:57:14,346 INFO L131 ngComponentsAnalysis]: Automaton has 291 accepting balls. 610 [2025-04-26 16:57:14,606 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57514 states to 35185 states and 98154 transitions. [2025-04-26 16:57:14,606 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6307 [2025-04-26 16:57:14,621 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7251 [2025-04-26 16:57:14,621 INFO L74 IsDeterministic]: Start isDeterministic. Operand 35185 states and 98154 transitions. [2025-04-26 16:57:14,621 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:57:14,621 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35185 states and 98154 transitions. [2025-04-26 16:57:14,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35185 states and 98154 transitions. [2025-04-26 16:57:15,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35185 to 33666. [2025-04-26 16:57:15,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33666 states, 33666 states have (on average 2.8083526406463495) internal successors, (in total 94546), 33665 states have internal predecessors, (94546), 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:57:15,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33666 states to 33666 states and 94546 transitions. [2025-04-26 16:57:15,713 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33666 states and 94546 transitions. [2025-04-26 16:57:15,713 INFO L438 stractBuchiCegarLoop]: Abstraction has 33666 states and 94546 transitions. [2025-04-26 16:57:15,713 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:57:15,713 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33666 states and 94546 transitions. [2025-04-26 16:57:15,978 INFO L131 ngComponentsAnalysis]: Automaton has 291 accepting balls. 610 [2025-04-26 16:57:15,978 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:57:15,978 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:57:15,978 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:57:15,978 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:57:15,979 INFO L752 eck$LassoCheckResult]: Stem: "[112] $Ultimate##0-->L13: Formula: (= v_x2_10 0) InVars {} OutVars{x2=v_x2_10} AuxVars[] AssignedVars[x2]" "[158] L13-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[161] L13-1-->L41: 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]" "[164] L14-->L56: 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]" "[167] L15-->L71: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" [2025-04-26 16:57:15,980 INFO L754 eck$LassoCheckResult]: Loop: "[148] L71-->L73: Formula: (< v_x5_5 v_z_15) InVars {x5=v_x5_5, z=v_z_15} OutVars{x5=v_x5_5, z=v_z_15} AuxVars[] AssignedVars[]" "[150] L73-->L71: Formula: (= v_x5_6 (+ v_x5_7 1)) InVars {x5=v_x5_7} OutVars{x5=v_x5_6} AuxVars[] AssignedVars[x5]" [2025-04-26 16:57:15,980 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:15,980 INFO L85 PathProgramCache]: Analyzing trace with hash 136930453, now seen corresponding path program 1 times [2025-04-26 16:57:15,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:15,980 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060174496] [2025-04-26 16:57:15,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:15,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:15,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:57:15,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:57:15,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:15,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:15,986 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:15,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:57:15,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:57:15,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:15,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:15,993 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:15,993 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:15,993 INFO L85 PathProgramCache]: Analyzing trace with hash 5699, now seen corresponding path program 1 times [2025-04-26 16:57:15,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:15,993 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449084170] [2025-04-26 16:57:15,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:15,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:15,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:15,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:15,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:15,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:15,998 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:15,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:15,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:15,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:15,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:16,000 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:16,000 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:16,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1553816105, now seen corresponding path program 1 times [2025-04-26 16:57:16,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:16,000 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957463663] [2025-04-26 16:57:16,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:16,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:16,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:57:16,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:57:16,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:16,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:16,008 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:16,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:57:16,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:57:16,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:16,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:16,014 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:16,033 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:16,034 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:16,034 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:16,034 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:16,034 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:57:16,034 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:16,034 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:16,034 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:16,034 INFO L132 ssoRankerPreferences]: Filename of dumped script: barrier-4t.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:57:16,034 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:16,034 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:16,034 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:16,055 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:16,055 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:57:16,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:16,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:16,057 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:57:16,059 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:57:16,060 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:57:16,060 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:16,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 16:57:16,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:16,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:16,078 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:57:16,080 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:57:16,081 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:57:16,081 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:16,145 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:57:16,150 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 16:57:16,150 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:16,150 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:16,150 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:16,150 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:16,150 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:57:16,150 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:16,150 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:16,150 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:16,150 INFO L132 ssoRankerPreferences]: Filename of dumped script: barrier-4t.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:57:16,150 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:16,150 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:16,151 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:16,170 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:16,170 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:57:16,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:16,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:16,173 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:57:16,174 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:57:16,175 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:57:16,186 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:57:16,186 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:57:16,186 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:57:16,186 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:57:16,186 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:57:16,187 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:57:16,187 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:57:16,189 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:57:16,194 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:57:16,194 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:57:16,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:16,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:16,196 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:57:16,198 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:57:16,199 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:57:16,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 16:57:16,202 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:57:16,203 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:57:16,203 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x5, z) = -1*x5 + 1*z Supporting invariants [] [2025-04-26 16:57:16,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 16:57:16,210 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:57:16,223 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:16,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:57:16,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:57:16,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:16,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:16,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:57:16,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:16,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:16,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:16,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:16,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:16,243 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:57:16,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:16,256 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:57:16,256 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:57:16,256 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33666 states and 94546 transitions. cyclomatic complexity: 64299 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:57:16,995 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33666 states and 94546 transitions. cyclomatic complexity: 64299. 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 98545 states and 269459 transitions. Complement of second has 7 states. [2025-04-26 16:57:16,996 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:57:16,996 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:57:16,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 177 transitions. [2025-04-26 16:57:16,997 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 177 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:57:16,997 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:16,997 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 177 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 16:57:16,997 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:16,997 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 177 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 16:57:16,997 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:16,997 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98545 states and 269459 transitions. [2025-04-26 16:57:18,229 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 38 [2025-04-26 16:57:18,243 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98545 states to 2627 states and 7155 transitions. [2025-04-26 16:57:18,243 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 660 [2025-04-26 16:57:18,244 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 660 [2025-04-26 16:57:18,244 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2627 states and 7155 transitions. [2025-04-26 16:57:18,244 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:57:18,244 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2627 states and 7155 transitions. [2025-04-26 16:57:18,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2627 states and 7155 transitions. [2025-04-26 16:57:18,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2627 to 2627. [2025-04-26 16:57:18,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2627 states, 2627 states have (on average 2.7236391320898363) internal successors, (in total 7155), 2626 states have internal predecessors, (7155), 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:57:18,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2627 states to 2627 states and 7155 transitions. [2025-04-26 16:57:18,270 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2627 states and 7155 transitions. [2025-04-26 16:57:18,270 INFO L438 stractBuchiCegarLoop]: Abstraction has 2627 states and 7155 transitions. [2025-04-26 16:57:18,270 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:57:18,270 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2627 states and 7155 transitions. [2025-04-26 16:57:18,276 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 38 [2025-04-26 16:57:18,277 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:57:18,277 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:57:18,277 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:57:18,277 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:57:18,277 INFO L752 eck$LassoCheckResult]: Stem: "[112] $Ultimate##0-->L13: Formula: (= v_x2_10 0) InVars {} OutVars{x2=v_x2_10} AuxVars[] AssignedVars[x2]" "[158] L13-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[120] L26-->L30: 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[]" "[122] L30-->L31: Formula: (= v_x2_1 (+ v_x2_2 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[124] L31-->L32-1: Formula: (<= 4 v_x2_3) InVars {x2=v_x2_3} OutVars{x2=v_x2_3} AuxVars[] AssignedVars[]" [2025-04-26 16:57:18,278 INFO L754 eck$LassoCheckResult]: Loop: "[126] L32-1-->L34: 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[]" "[128] L34-->L32-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:57:18,278 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:18,278 INFO L85 PathProgramCache]: Analyzing trace with hash 136889707, now seen corresponding path program 1 times [2025-04-26 16:57:18,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:18,278 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238464178] [2025-04-26 16:57:18,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:18,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:18,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:57:18,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:57:18,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:18,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:18,312 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:57:18,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:57:18,312 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238464178] [2025-04-26 16:57:18,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238464178] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:57:18,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:57:18,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:57:18,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841268746] [2025-04-26 16:57:18,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:57:18,317 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:57:18,317 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:18,317 INFO L85 PathProgramCache]: Analyzing trace with hash 4995, now seen corresponding path program 1 times [2025-04-26 16:57:18,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:18,317 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885435966] [2025-04-26 16:57:18,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:18,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:18,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:18,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:18,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:18,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:18,321 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:18,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:18,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:18,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:18,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:18,322 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:18,333 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:18,333 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:18,334 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:18,334 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:18,334 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:57:18,334 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:18,334 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:18,334 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:18,334 INFO L132 ssoRankerPreferences]: Filename of dumped script: barrier-4t.c.bpl_petrified1_Iteration5_Loop [2025-04-26 16:57:18,334 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:18,334 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:18,335 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:18,358 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:18,358 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:57:18,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:18,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:18,360 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:57:18,362 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:57:18,363 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:57:18,363 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:18,379 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:57:18,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:18,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:18,382 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:57:18,383 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:57:18,384 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:57:18,384 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:18,449 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:57:18,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-04-26 16:57:18,453 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:18,454 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:18,454 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:18,454 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:18,454 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:57:18,454 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:18,454 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:18,454 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:18,454 INFO L132 ssoRankerPreferences]: Filename of dumped script: barrier-4t.c.bpl_petrified1_Iteration5_Loop [2025-04-26 16:57:18,454 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:18,454 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:18,454 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:18,477 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:18,478 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:57:18,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:18,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:18,481 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:57:18,482 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:57:18,483 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:57:18,493 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:57:18,493 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:57:18,493 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:57:18,493 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:57:18,493 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:57:18,494 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:57:18,494 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:57:18,496 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:57:18,498 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:57:18,498 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:57:18,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:18,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:18,500 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:57:18,501 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:57:18,503 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:57:18,506 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:57:18,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-04-26 16:57:18,507 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:57:18,507 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:57:18,507 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x3, z) = -1*x3 + 1*z Supporting invariants [] [2025-04-26 16:57:18,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-04-26 16:57:18,513 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:57:18,523 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:18,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:57:18,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:57:18,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:18,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:18,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:57:18,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:18,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:18,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:18,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:18,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:18,540 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:57:18,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:18,552 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:57:18,553 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:57:18,553 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2627 states and 7155 transitions. cyclomatic complexity: 4821 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:57:18,630 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2627 states and 7155 transitions. cyclomatic complexity: 4821. 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 5233 states and 14038 transitions. Complement of second has 7 states. [2025-04-26 16:57:18,630 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:57:18,632 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:57:18,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2025-04-26 16:57:18,632 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 108 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:57:18,632 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:18,632 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 108 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 16:57:18,632 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:18,633 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 108 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 16:57:18,633 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:18,633 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5233 states and 14038 transitions. [2025-04-26 16:57:18,654 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 36 [2025-04-26 16:57:18,667 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5233 states to 3383 states and 9002 transitions. [2025-04-26 16:57:18,667 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 675 [2025-04-26 16:57:18,668 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 790 [2025-04-26 16:57:18,668 INFO L74 IsDeterministic]: Start isDeterministic. Operand 3383 states and 9002 transitions. [2025-04-26 16:57:18,669 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:57:18,669 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3383 states and 9002 transitions. [2025-04-26 16:57:18,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3383 states and 9002 transitions. [2025-04-26 16:57:18,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3383 to 2706. [2025-04-26 16:57:18,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2706 states, 2706 states have (on average 2.7187730968218773) internal successors, (in total 7357), 2705 states have internal predecessors, (7357), 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:57:18,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 7357 transitions. [2025-04-26 16:57:18,698 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2706 states and 7357 transitions. [2025-04-26 16:57:18,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:57:18,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:57:18,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:57:18,702 INFO L87 Difference]: Start difference. First operand 2706 states and 7357 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:57:18,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:57:18,743 INFO L93 Difference]: Finished difference Result 1817 states and 4717 transitions. [2025-04-26 16:57:18,744 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1817 states and 4717 transitions. [2025-04-26 16:57:18,750 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 24 [2025-04-26 16:57:18,755 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1817 states to 1807 states and 4671 transitions. [2025-04-26 16:57:18,756 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 463 [2025-04-26 16:57:18,756 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 463 [2025-04-26 16:57:18,756 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1807 states and 4671 transitions. [2025-04-26 16:57:18,757 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:57:18,757 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1807 states and 4671 transitions. [2025-04-26 16:57:18,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1807 states and 4671 transitions. [2025-04-26 16:57:18,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1807 to 1807. [2025-04-26 16:57:18,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1807 states, 1807 states have (on average 2.5849474266740455) internal successors, (in total 4671), 1806 states have internal predecessors, (4671), 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:57:18,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1807 states to 1807 states and 4671 transitions. [2025-04-26 16:57:18,858 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1807 states and 4671 transitions. [2025-04-26 16:57:18,858 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 16:57:18,860 INFO L438 stractBuchiCegarLoop]: Abstraction has 1807 states and 4671 transitions. [2025-04-26 16:57:18,860 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:57:18,860 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1807 states and 4671 transitions. [2025-04-26 16:57:18,864 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 24 [2025-04-26 16:57:18,864 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:57:18,864 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:57:18,864 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:57:18,864 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:57:18,865 INFO L752 eck$LassoCheckResult]: Stem: "[112] $Ultimate##0-->L13: Formula: (= v_x2_10 0) InVars {} OutVars{x2=v_x2_10} AuxVars[] AssignedVars[x2]" "[158] L13-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[161] L13-1-->L41: 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]" "[129] L41-->L45: 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[]" "[131] L45-->L46: Formula: (= (+ v_x2_5 1) v_x2_4) InVars {x2=v_x2_5} OutVars{x2=v_x2_4} AuxVars[] AssignedVars[x2]" "[120] L26-->L30: 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[]" "[122] L30-->L31: Formula: (= v_x2_1 (+ v_x2_2 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[133] L46-->L47-1: Formula: (<= 4 v_x2_6) InVars {x2=v_x2_6} OutVars{x2=v_x2_6} AuxVars[] AssignedVars[]" [2025-04-26 16:57:18,865 INFO L754 eck$LassoCheckResult]: Loop: "[135] L47-1-->L49: 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[]" "[137] L49-->L47-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:57:18,865 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:18,865 INFO L85 PathProgramCache]: Analyzing trace with hash -957082353, now seen corresponding path program 1 times [2025-04-26 16:57:18,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:18,865 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352880660] [2025-04-26 16:57:18,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:18,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:18,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:57:18,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:57:18,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:18,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:18,902 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:57:18,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:57:18,902 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352880660] [2025-04-26 16:57:18,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352880660] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:57:18,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:57:18,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:57:18,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921505999] [2025-04-26 16:57:18,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:57:18,903 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:57:18,903 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:18,903 INFO L85 PathProgramCache]: Analyzing trace with hash 5283, now seen corresponding path program 1 times [2025-04-26 16:57:18,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:18,903 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667865703] [2025-04-26 16:57:18,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:18,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:18,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:18,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:18,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:18,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:18,905 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:18,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:18,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:18,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:18,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:18,909 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:18,923 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:18,924 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:18,924 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:18,924 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:18,924 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:57:18,924 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:18,924 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:18,924 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:18,924 INFO L132 ssoRankerPreferences]: Filename of dumped script: barrier-4t.c.bpl_petrified1_Iteration6_Loop [2025-04-26 16:57:18,924 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:18,924 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:18,924 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:18,938 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:18,938 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:57:18,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:18,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:18,940 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:18,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 16:57:18,943 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:57:18,943 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:18,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-04-26 16:57:18,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:18,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:18,962 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:18,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 16:57:18,966 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:57:18,966 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:19,032 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:57:19,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-04-26 16:57:19,036 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:19,037 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:19,037 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:19,037 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:19,037 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:57:19,037 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:19,037 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:19,037 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:19,037 INFO L132 ssoRankerPreferences]: Filename of dumped script: barrier-4t.c.bpl_petrified1_Iteration6_Loop [2025-04-26 16:57:19,037 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:19,037 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:19,037 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:19,057 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:19,057 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:57:19,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:19,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:19,059 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:19,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-04-26 16:57:19,060 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:57:19,070 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:57:19,070 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:57:19,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:57:19,071 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:57:19,071 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:57:19,072 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:57:19,072 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:57:19,074 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:57:19,076 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:57:19,076 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:57:19,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:19,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:19,078 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:19,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-04-26 16:57:19,079 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:57:19,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-04-26 16:57:19,082 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:57:19,082 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:57:19,082 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x4, z) = -1*x4 + 1*z Supporting invariants [] [2025-04-26 16:57:19,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-04-26 16:57:19,088 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:57:19,099 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:19,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:57:19,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:57:19,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:19,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:19,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:57:19,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:19,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:19,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:19,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:19,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:19,119 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:57:19,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:19,135 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:57:19,135 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:57:19,136 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1807 states and 4671 transitions. cyclomatic complexity: 3082 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:57:19,193 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1807 states and 4671 transitions. cyclomatic complexity: 3082. 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 3252 states and 8162 transitions. Complement of second has 7 states. [2025-04-26 16:57:19,193 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:57:19,194 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:57:19,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2025-04-26 16:57:19,194 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 97 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 16:57:19,194 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:19,194 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 97 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 16:57:19,194 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:19,194 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 97 transitions. Stem has 8 letters. Loop has 4 letters. [2025-04-26 16:57:19,194 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:19,194 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3252 states and 8162 transitions. [2025-04-26 16:57:19,206 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 20 [2025-04-26 16:57:19,212 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3252 states to 2196 states and 5453 transitions. [2025-04-26 16:57:19,212 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 482 [2025-04-26 16:57:19,212 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 543 [2025-04-26 16:57:19,212 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2196 states and 5453 transitions. [2025-04-26 16:57:19,213 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:57:19,213 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2196 states and 5453 transitions. [2025-04-26 16:57:19,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2196 states and 5453 transitions. [2025-04-26 16:57:19,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2196 to 1865. [2025-04-26 16:57:19,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1865 states, 1865 states have (on average 2.562466487935657) internal successors, (in total 4779), 1864 states have internal predecessors, (4779), 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:57:19,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1865 states to 1865 states and 4779 transitions. [2025-04-26 16:57:19,229 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1865 states and 4779 transitions. [2025-04-26 16:57:19,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:57:19,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 16:57:19,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-26 16:57:19,229 INFO L87 Difference]: Start difference. First operand 1865 states and 4779 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:57:19,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:57:19,257 INFO L93 Difference]: Finished difference Result 793 states and 2071 transitions. [2025-04-26 16:57:19,257 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 793 states and 2071 transitions. [2025-04-26 16:57:19,261 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2025-04-26 16:57:19,262 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 793 states to 660 states and 1633 transitions. [2025-04-26 16:57:19,262 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 161 [2025-04-26 16:57:19,263 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 161 [2025-04-26 16:57:19,263 INFO L74 IsDeterministic]: Start isDeterministic. Operand 660 states and 1633 transitions. [2025-04-26 16:57:19,263 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:57:19,263 INFO L218 hiAutomatonCegarLoop]: Abstraction has 660 states and 1633 transitions. [2025-04-26 16:57:19,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states and 1633 transitions. [2025-04-26 16:57:19,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2025-04-26 16:57:19,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 660 states have (on average 2.474242424242424) internal successors, (in total 1633), 659 states have internal predecessors, (1633), 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:57:19,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 1633 transitions. [2025-04-26 16:57:19,268 INFO L240 hiAutomatonCegarLoop]: Abstraction has 660 states and 1633 transitions. [2025-04-26 16:57:19,268 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 16:57:19,270 INFO L438 stractBuchiCegarLoop]: Abstraction has 660 states and 1633 transitions. [2025-04-26 16:57:19,270 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 16:57:19,270 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 660 states and 1633 transitions. [2025-04-26 16:57:19,272 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2025-04-26 16:57:19,272 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:57:19,272 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:57:19,272 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:57:19,272 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:57:19,272 INFO L752 eck$LassoCheckResult]: Stem: "[112] $Ultimate##0-->L13: Formula: (= v_x2_10 0) InVars {} OutVars{x2=v_x2_10} AuxVars[] AssignedVars[x2]" "[158] L13-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[161] L13-1-->L41: 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]" "[129] L41-->L45: 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[]" "[131] L45-->L46: Formula: (= (+ v_x2_5 1) v_x2_4) InVars {x2=v_x2_5} OutVars{x2=v_x2_4} AuxVars[] AssignedVars[x2]" "[164] L14-->L56: 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]" "[120] L26-->L30: 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[]" "[122] L30-->L31: Formula: (= v_x2_1 (+ v_x2_2 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[138] L56-->L60: Formula: (<= v_z_10 v_x4_8) InVars {x4=v_x4_8, z=v_z_10} OutVars{x4=v_x4_8, z=v_z_10} AuxVars[] AssignedVars[]" "[140] L60-->L61: Formula: (= v_x2_7 (+ v_x2_8 1)) InVars {x2=v_x2_8} OutVars{x2=v_x2_7} AuxVars[] AssignedVars[x2]" "[142] L61-->L62-1: Formula: (<= 4 v_x2_9) InVars {x2=v_x2_9} OutVars{x2=v_x2_9} AuxVars[] AssignedVars[]" [2025-04-26 16:57:19,272 INFO L754 eck$LassoCheckResult]: Loop: "[144] L62-1-->L64: Formula: (< v_x5_1 v_z_11) InVars {x5=v_x5_1, z=v_z_11} OutVars{x5=v_x5_1, z=v_z_11} AuxVars[] AssignedVars[]" "[146] L64-->L62-1: Formula: (= v_x5_2 (+ v_x5_3 1)) InVars {x5=v_x5_3} OutVars{x5=v_x5_2} AuxVars[] AssignedVars[x5]" [2025-04-26 16:57:19,272 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:19,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1189822374, now seen corresponding path program 1 times [2025-04-26 16:57:19,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:19,273 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509914092] [2025-04-26 16:57:19,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:19,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:19,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:57:19,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:57:19,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:19,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:19,332 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:57:19,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:57:19,332 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509914092] [2025-04-26 16:57:19,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509914092] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:57:19,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:57:19,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-26 16:57:19,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825002478] [2025-04-26 16:57:19,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:57:19,332 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:57:19,333 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:19,333 INFO L85 PathProgramCache]: Analyzing trace with hash 5571, now seen corresponding path program 1 times [2025-04-26 16:57:19,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:19,333 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441378122] [2025-04-26 16:57:19,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:19,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:19,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:19,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:19,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:19,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:19,335 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:19,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:19,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:19,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:19,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:19,340 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:19,350 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:19,351 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:19,351 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:19,351 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:19,351 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:57:19,351 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:19,351 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:19,351 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:19,351 INFO L132 ssoRankerPreferences]: Filename of dumped script: barrier-4t.c.bpl_petrified1_Iteration7_Loop [2025-04-26 16:57:19,351 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:19,351 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:19,351 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:19,366 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:19,367 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:57:19,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:19,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:19,369 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:19,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-04-26 16:57:19,372 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:57:19,372 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:19,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2025-04-26 16:57:19,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:19,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:19,422 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:19,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-04-26 16:57:19,425 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:57:19,425 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:19,488 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:57:19,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-04-26 16:57:19,492 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:19,492 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:19,492 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:19,492 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:19,493 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:57:19,493 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:19,493 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:19,493 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:19,493 INFO L132 ssoRankerPreferences]: Filename of dumped script: barrier-4t.c.bpl_petrified1_Iteration7_Loop [2025-04-26 16:57:19,493 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:19,493 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:19,493 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:19,509 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:19,509 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:57:19,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:19,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:19,511 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:19,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-04-26 16:57:19,514 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:57:19,523 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:57:19,523 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:57:19,523 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:57:19,523 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:57:19,523 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:57:19,525 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:57:19,525 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:57:19,527 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:57:19,531 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:57:19,531 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:57:19,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:19,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:19,533 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:19,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-04-26 16:57:19,535 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:57:19,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2025-04-26 16:57:19,539 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:57:19,539 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:57:19,539 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x5) = 1*z - 1*x5 Supporting invariants [] [2025-04-26 16:57:19,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-04-26 16:57:19,545 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:57:19,556 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:19,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:57:19,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:57:19,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:19,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:19,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:57:19,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:19,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:19,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:19,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:19,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:19,583 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:57:19,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:19,594 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:57:19,594 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:57:19,594 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 660 states and 1633 transitions. cyclomatic complexity: 1052 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 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:57:19,623 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 660 states and 1633 transitions. cyclomatic complexity: 1052. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 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 901 states and 2105 transitions. Complement of second has 6 states. [2025-04-26 16:57:19,623 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:57:19,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 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:57:19,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2025-04-26 16:57:19,624 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 57 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 16:57:19,624 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:19,624 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 57 transitions. Stem has 13 letters. Loop has 2 letters. [2025-04-26 16:57:19,624 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:19,624 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 57 transitions. Stem has 11 letters. Loop has 4 letters. [2025-04-26 16:57:19,624 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:19,624 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 901 states and 2105 transitions. [2025-04-26 16:57:19,627 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:57:19,628 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 901 states to 0 states and 0 transitions. [2025-04-26 16:57:19,628 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:57:19,628 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:57:19,628 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:57:19,628 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:57:19,628 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:57:19,628 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:57:19,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:57:19,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-26 16:57:19,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-26 16:57:19,629 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (in total 11), 5 states have internal predecessors, (11), 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:57:19,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:57:19,629 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2025-04-26 16:57:19,629 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2025-04-26 16:57:19,629 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:57:19,629 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2025-04-26 16:57:19,629 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:57:19,629 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:57:19,629 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:57:19,629 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:57:19,629 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:57:19,629 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:57:19,629 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-26 16:57:19,630 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:57:19,630 INFO L340 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-04-26 16:57:19,630 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:57:19,630 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:57:19,630 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:57:19,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 16:57:19,642 INFO L201 PluginConnector]: Adding new model barrier-4t.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:57:19 BoogieIcfgContainer [2025-04-26 16:57:19,642 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:57:19,643 INFO L158 Benchmark]: Toolchain (without parser) took 11999.67ms. Allocated memory was 167.8MB in the beginning and 1.1GB in the end (delta: 939.5MB). Free memory was 92.6MB in the beginning and 484.4MB in the end (delta: -391.8MB). Peak memory consumption was 550.9MB. Max. memory is 8.0GB. [2025-04-26 16:57:19,643 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.13ms. Allocated memory is still 167.8MB. Free memory is still 93.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:57:19,643 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.51ms. Allocated memory is still 167.8MB. Free memory was 92.6MB in the beginning and 90.7MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:57:19,643 INFO L158 Benchmark]: Boogie Preprocessor took 22.36ms. Allocated memory is still 167.8MB. Free memory was 90.7MB in the beginning and 89.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:57:19,643 INFO L158 Benchmark]: RCFGBuilder took 190.26ms. Allocated memory is still 167.8MB. Free memory was 89.6MB in the beginning and 79.4MB in the end (delta: 10.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:57:19,644 INFO L158 Benchmark]: BuchiAutomizer took 11747.22ms. Allocated memory was 167.8MB in the beginning and 1.1GB in the end (delta: 939.5MB). Free memory was 79.4MB in the beginning and 484.4MB in the end (delta: -405.0MB). Peak memory consumption was 538.4MB. Max. memory is 8.0GB. [2025-04-26 16:57:19,645 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.13ms. Allocated memory is still 167.8MB. Free memory is still 93.5MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.51ms. Allocated memory is still 167.8MB. Free memory was 92.6MB in the beginning and 90.7MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.36ms. Allocated memory is still 167.8MB. Free memory was 90.7MB in the beginning and 89.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 190.26ms. Allocated memory is still 167.8MB. Free memory was 89.6MB in the beginning and 79.4MB in the end (delta: 10.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 11747.22ms. Allocated memory was 167.8MB in the beginning and 1.1GB in the end (delta: 939.5MB). Free memory was 79.4MB in the beginning and 484.4MB in the end (delta: -405.0MB). Peak memory consumption was 538.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.6s and 8 iterations. TraceHistogramMax:1. Analysis of lassos took 1.8s. Construction of modules took 0.4s. Büchi inclusion checks took 2.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 8. Automata minimization 2.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 4897 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 3.1s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [7, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 580 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 573 mSDsluCounter, 733 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 372 mSDsCounter, 61 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 595 IncrementalHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61 mSolverCounterUnsat, 361 mSDtfsCounter, 595 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT4 conc0 concLT0 SILN0 SILU0 SILI0 SILT3 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: 42ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s InitialAbstractionConstructionTime: 1.0s InitialAbstraction: Time to compute Ample Reduction [ms]: 1030, Number of transitions in reduction automaton: 12152, Number of states in reduction automaton: 4839, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (3 trivial, 7 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 * x5 + 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 * x5 + z and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 6 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:57:19,658 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...