/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 18:42:39,519 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:42:39,560 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:42:39,563 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:42:39,563 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:42:39,563 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:42:39,563 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:42:39,580 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:42:39,580 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:42:39,581 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:42:39,581 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:42:39,581 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:42:39,581 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:42:39,581 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:42:39,581 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:42:39,581 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:42:39,581 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:42:39,581 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:42:39,581 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:42:39,581 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:42:39,581 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:42:39,582 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:42:39,582 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:42:39,582 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:42:39,582 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:42:39,582 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:42:39,582 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:42:39,582 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:42:39,582 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:42:39,582 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:42:39,582 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:42:39,582 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:42:39,582 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:42:39,582 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:42:39,582 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:42:39,584 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:42:39,584 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:42:39,584 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:42:39,585 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:42:39,585 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:42:39,585 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:42:39,585 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:42:39,585 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:42:39,803 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:42:39,813 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:42:39,814 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:42:39,815 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:42:39,816 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:42:39,817 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/4_plus_thr/barrier-4t.c.bpl [2025-04-26 18:42:39,817 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/4_plus_thr/barrier-4t.c.bpl' [2025-04-26 18:42:39,832 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:42:39,834 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:42:39,835 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:42:39,835 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:42:39,835 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:42:39,843 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 06:42:39" (1/1) ... [2025-04-26 18:42:39,866 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 06:42:39" (1/1) ... [2025-04-26 18:42:39,872 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:42:39,873 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:42:39,873 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:42:39,873 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:42:39,873 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:42:39,878 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 06:42:39" (1/1) ... [2025-04-26 18:42:39,878 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 06:42:39" (1/1) ... [2025-04-26 18:42:39,878 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 06:42:39" (1/1) ... [2025-04-26 18:42:39,879 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 06:42:39" (1/1) ... [2025-04-26 18:42:39,880 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 06:42:39" (1/1) ... [2025-04-26 18:42:39,880 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 06:42:39" (1/1) ... [2025-04-26 18:42:39,883 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 06:42:39" (1/1) ... [2025-04-26 18:42:39,884 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 06:42:39" (1/1) ... [2025-04-26 18:42:39,884 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 06:42:39" (1/1) ... [2025-04-26 18:42:39,892 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:42:39,892 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:42:39,892 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:42:39,892 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:42:39,893 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 06:42:39" (1/1) ... [2025-04-26 18:42:39,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:42:39,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:39,917 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:39,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 18:42:39,937 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:42:39,937 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:42:39,937 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:42:39,937 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:42:39,937 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:42:39,937 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:42:39,937 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:42:39,938 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:42:39,938 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:42:39,938 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:42:39,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:42:39,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:42:39,938 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 18:42:39,938 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 18:42:39,938 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 18:42:39,938 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 18:42:39,971 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:42:39,972 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:42:40,056 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:42:40,057 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:42:40,063 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:42:40,064 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:42:40,064 INFO L201 PluginConnector]: Adding new model barrier-4t.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:42:40 BoogieIcfgContainer [2025-04-26 18:42:40,064 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:42:40,067 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:42:40,067 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:42:40,072 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:42:40,072 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:42:40,072 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 06:42:39" (1/2) ... [2025-04-26 18:42:40,073 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@73ff742a and model type barrier-4t.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:42:40, skipping insertion in model container [2025-04-26 18:42:40,073 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:42:40,073 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 06:42:40" (2/2) ... [2025-04-26 18:42:40,074 INFO L376 chiAutomizerObserver]: Analyzing ICFG barrier-4t.c.bpl [2025-04-26 18:42:40,123 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-26 18:42:40,155 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:42:40,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:42:40,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:40,158 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:40,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 18:42:40,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 54 transitions, 136 flow [2025-04-26 18:42:40,229 INFO L116 PetriNetUnfolderBase]: 8/46 cut-off events. [2025-04-26 18:42:40,232 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-26 18:42:40,235 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 18:42:40,236 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 54 transitions, 136 flow [2025-04-26 18:42:40,239 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 46 transitions, 116 flow [2025-04-26 18:42:40,239 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 51 places, 46 transitions, 116 flow [2025-04-26 18:42:40,241 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 51 places, 46 transitions, 116 flow [2025-04-26 18:42:40,451 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 5268 states, 5267 states have (on average 4.43630149990507) internal successors, (in total 23366), 5267 states have internal predecessors, (23366), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:40,468 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 5268 states, 5267 states have (on average 4.43630149990507) internal successors, (in total 23366), 5267 states have internal predecessors, (23366), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:40,472 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:42:41,212 WARN L140 AmpleReduction]: Number of pruned transitions: 9248 [2025-04-26 18:42:41,212 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:42:41,212 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 1557 [2025-04-26 18:42:41,212 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:235 [2025-04-26 18:42:41,212 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:3046 [2025-04-26 18:42:41,213 WARN L145 AmpleReduction]: Times succ was already a loop node:3869 [2025-04-26 18:42:41,213 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:479 [2025-04-26 18:42:41,213 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:42:41,228 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 18:42:41,235 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:42:41,235 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:42:41,235 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:42:41,235 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:42:41,235 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:42:41,235 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:42:41,235 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:42:41,235 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:42:41,244 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 18:42:41,343 INFO L131 ngComponentsAnalysis]: Automaton has 859 accepting balls. 3316 [2025-04-26 18:42:41,343 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:41,343 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:41,348 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:42:41,348 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:41,348 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:42:41,355 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 18:42:41,410 INFO L131 ngComponentsAnalysis]: Automaton has 859 accepting balls. 3316 [2025-04-26 18:42:41,410 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:41,410 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:41,410 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:42:41,410 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:41,414 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 18:42:41,415 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 18:42:41,420 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:41,420 INFO L85 PathProgramCache]: Analyzing trace with hash 4591, now seen corresponding path program 1 times [2025-04-26 18:42:41,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:41,425 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639975681] [2025-04-26 18:42:41,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:41,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:41,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:41,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:41,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:41,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:41,480 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:41,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:41,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:41,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:41,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:41,495 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:41,499 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:41,499 INFO L85 PathProgramCache]: Analyzing trace with hash 4835, now seen corresponding path program 1 times [2025-04-26 18:42:41,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:41,500 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845350113] [2025-04-26 18:42:41,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:41,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:41,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:41,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:41,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:41,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:41,508 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:41,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:41,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:41,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:41,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:41,512 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:41,516 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:41,516 INFO L85 PathProgramCache]: Analyzing trace with hash 4415825, now seen corresponding path program 1 times [2025-04-26 18:42:41,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:41,516 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364613197] [2025-04-26 18:42:41,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:41,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:41,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:41,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:41,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:41,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:41,523 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:41,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:41,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:41,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:41,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:41,528 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:41,585 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:41,586 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:41,586 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:41,586 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:41,586 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:41,586 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:41,587 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:41,587 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:41,587 INFO L132 ssoRankerPreferences]: Filename of dumped script: barrier-4t.c.bpl_petrified1_Iteration1_Loop [2025-04-26 18:42:41,587 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:41,587 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:41,596 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:41,645 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:41,646 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:41,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:41,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:41,674 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:41,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 18:42:41,677 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:41,677 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:41,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:41,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:41,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:41,712 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:41,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 18:42:41,715 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:41,715 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:41,785 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:41,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 18:42:41,790 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:41,790 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:41,790 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:41,790 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:41,790 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:41,790 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:41,790 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:41,790 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:41,790 INFO L132 ssoRankerPreferences]: Filename of dumped script: barrier-4t.c.bpl_petrified1_Iteration1_Loop [2025-04-26 18:42:41,790 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:41,790 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:41,791 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:41,817 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:41,820 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:41,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:41,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:41,826 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:41,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 18:42:41,830 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:42:41,842 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:41,842 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:41,843 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:41,843 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:41,843 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:41,847 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:41,848 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:41,850 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:41,855 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:42:41,856 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:41,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:41,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:41,884 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:41,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 18:42:41,888 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:41,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 18:42:41,891 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:41,891 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:41,892 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x1) = 1*z - 1*x1 Supporting invariants [] [2025-04-26 18:42:41,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 18:42:41,901 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:41,922 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:41,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:41,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:41,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:41,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:41,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:41,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:41,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:41,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:41,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:41,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:41,943 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:41,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:41,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:42:41,977 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:42:41,984 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 18:42:42,303 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 18:42:42,304 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 18:42:42,306 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 18:42:42,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 162 transitions. [2025-04-26 18:42:42,310 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 162 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 18:42:42,310 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:42,310 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 162 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 18:42:42,311 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:42,311 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 162 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 18:42:42,311 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:42,311 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14249 states and 36711 transitions. [2025-04-26 18:42:42,515 INFO L131 ngComponentsAnalysis]: Automaton has 1012 accepting balls. 3078 [2025-04-26 18:42:42,617 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14249 states to 10721 states and 27962 transitions. [2025-04-26 18:42:42,618 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4910 [2025-04-26 18:42:42,630 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5941 [2025-04-26 18:42:42,631 INFO L74 IsDeterministic]: Start isDeterministic. Operand 10721 states and 27962 transitions. [2025-04-26 18:42:42,631 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:42,631 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10721 states and 27962 transitions. [2025-04-26 18:42:42,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10721 states and 27962 transitions. [2025-04-26 18:42:42,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10721 to 9735. [2025-04-26 18:42:42,917 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 18:42:42,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9735 states to 9735 states and 25273 transitions. [2025-04-26 18:42:42,945 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9735 states and 25273 transitions. [2025-04-26 18:42:42,945 INFO L438 stractBuchiCegarLoop]: Abstraction has 9735 states and 25273 transitions. [2025-04-26 18:42:42,946 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:42:42,946 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9735 states and 25273 transitions. [2025-04-26 18:42:43,024 INFO L131 ngComponentsAnalysis]: Automaton has 1012 accepting balls. 3078 [2025-04-26 18:42:43,025 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:43,025 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:43,026 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:42:43,026 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:43,026 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 18:42:43,027 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 18:42:43,027 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:43,027 INFO L85 PathProgramCache]: Analyzing trace with hash 142482, now seen corresponding path program 1 times [2025-04-26 18:42:43,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:43,027 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54013068] [2025-04-26 18:42:43,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:43,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:43,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:43,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:43,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:43,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:43,032 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:43,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:43,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:43,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:43,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:43,037 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:43,037 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:43,037 INFO L85 PathProgramCache]: Analyzing trace with hash 5123, now seen corresponding path program 1 times [2025-04-26 18:42:43,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:43,037 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152123652] [2025-04-26 18:42:43,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:43,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:43,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:43,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:43,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:43,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:43,042 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:43,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:43,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:43,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:43,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:43,044 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:43,044 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:43,044 INFO L85 PathProgramCache]: Analyzing trace with hash 136929364, now seen corresponding path program 1 times [2025-04-26 18:42:43,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:43,046 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851912683] [2025-04-26 18:42:43,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:43,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:43,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:43,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:43,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:43,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:43,050 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:43,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:43,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:43,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:43,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:43,055 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:43,071 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:43,071 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:43,071 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:43,071 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:43,071 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:43,072 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:43,072 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:43,072 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:43,072 INFO L132 ssoRankerPreferences]: Filename of dumped script: barrier-4t.c.bpl_petrified1_Iteration2_Loop [2025-04-26 18:42:43,072 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:43,072 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:43,072 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:43,090 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:43,090 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:43,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:43,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:43,093 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:43,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 18:42:43,095 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:43,095 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:43,116 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 18:42:43,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:43,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:43,119 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:43,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 18:42:43,122 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:43,122 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:43,203 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:43,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 18:42:43,208 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:43,208 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:43,208 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:43,208 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:43,208 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:43,208 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:43,208 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:43,208 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:43,208 INFO L132 ssoRankerPreferences]: Filename of dumped script: barrier-4t.c.bpl_petrified1_Iteration2_Loop [2025-04-26 18:42:43,208 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:43,208 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:43,209 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:43,230 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:43,231 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:43,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:43,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:43,260 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:43,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 18:42:43,263 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:42:43,276 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:43,277 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:43,277 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:43,277 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:43,277 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:43,278 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:43,278 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:43,281 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:43,284 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:42:43,284 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:42:43,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:43,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:43,292 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:43,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 18:42:43,293 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:43,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 18:42:43,296 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:43,296 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:43,296 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x3) = 1*z - 1*x3 Supporting invariants [] [2025-04-26 18:42:43,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 18:42:43,303 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:43,315 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:43,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:43,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:43,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:43,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:43,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:43,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:43,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:43,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:43,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:43,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:43,332 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:43,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:43,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:42:43,347 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:42:43,348 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 18:42:43,713 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 18:42:43,713 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 18:42:43,714 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 18:42:43,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 166 transitions. [2025-04-26 18:42:43,714 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 166 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 18:42:43,714 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:43,714 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 166 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 18:42:43,714 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:43,714 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 166 transitions. Stem has 3 letters. Loop has 4 letters. [2025-04-26 18:42:43,715 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:43,715 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30168 states and 81195 transitions. [2025-04-26 18:42:43,977 INFO L131 ngComponentsAnalysis]: Automaton has 647 accepting balls. 1572 [2025-04-26 18:42:44,217 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30168 states to 19288 states and 51639 transitions. [2025-04-26 18:42:44,217 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5056 [2025-04-26 18:42:44,274 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6509 [2025-04-26 18:42:44,275 INFO L74 IsDeterministic]: Start isDeterministic. Operand 19288 states and 51639 transitions. [2025-04-26 18:42:44,275 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:44,275 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19288 states and 51639 transitions. [2025-04-26 18:42:44,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19288 states and 51639 transitions. [2025-04-26 18:42:44,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19288 to 17904. [2025-04-26 18:42:44,735 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 18:42:44,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17904 states to 17904 states and 48961 transitions. [2025-04-26 18:42:44,871 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17904 states and 48961 transitions. [2025-04-26 18:42:44,871 INFO L438 stractBuchiCegarLoop]: Abstraction has 17904 states and 48961 transitions. [2025-04-26 18:42:44,871 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:42:44,871 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17904 states and 48961 transitions. [2025-04-26 18:42:45,014 INFO L131 ngComponentsAnalysis]: Automaton has 647 accepting balls. 1572 [2025-04-26 18:42:45,015 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:45,015 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:45,015 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 18:42:45,016 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:45,016 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 18:42:45,016 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 18:42:45,017 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:45,017 INFO L85 PathProgramCache]: Analyzing trace with hash 4417106, now seen corresponding path program 1 times [2025-04-26 18:42:45,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:45,017 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509735151] [2025-04-26 18:42:45,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:45,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:45,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:45,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:45,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:45,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:45,024 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:45,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:45,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:45,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:45,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:45,031 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:45,032 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:45,032 INFO L85 PathProgramCache]: Analyzing trace with hash 5411, now seen corresponding path program 1 times [2025-04-26 18:42:45,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:45,032 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460798359] [2025-04-26 18:42:45,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:45,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:45,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:45,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:45,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:45,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:45,034 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:45,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:45,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:45,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:45,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:45,043 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:45,043 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:45,043 INFO L85 PathProgramCache]: Analyzing trace with hash -50123980, now seen corresponding path program 1 times [2025-04-26 18:42:45,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:45,043 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330648302] [2025-04-26 18:42:45,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:45,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:45,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:42:45,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:42:45,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:45,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:45,051 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:45,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:42:45,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:42:45,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:45,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:45,059 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:45,071 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:45,072 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:45,072 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:45,072 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:45,072 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:45,072 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:45,072 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:45,072 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:45,072 INFO L132 ssoRankerPreferences]: Filename of dumped script: barrier-4t.c.bpl_petrified1_Iteration3_Loop [2025-04-26 18:42:45,072 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:45,072 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:45,072 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:45,104 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:45,104 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:45,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:45,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:45,108 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:45,113 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:45,113 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:45,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 18:42:45,140 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 18:42:45,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:45,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:45,143 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:45,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 18:42:45,145 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:45,145 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:45,208 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:45,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 18:42:45,212 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:45,212 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:45,212 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:45,212 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:45,213 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:45,213 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:45,213 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:45,213 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:45,213 INFO L132 ssoRankerPreferences]: Filename of dumped script: barrier-4t.c.bpl_petrified1_Iteration3_Loop [2025-04-26 18:42:45,213 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:45,213 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:45,216 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:45,231 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:45,231 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:45,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:45,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:45,234 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:45,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 18:42:45,236 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:42:45,246 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:45,247 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:45,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:45,247 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:45,247 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:45,249 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:45,249 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:45,251 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:45,254 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:42:45,254 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:45,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:45,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:45,256 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:45,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 18:42:45,259 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:45,261 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 18:42:45,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:45,264 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:45,264 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:45,264 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x4, z) = -1*x4 + 1*z Supporting invariants [] [2025-04-26 18:42:45,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 18:42:45,270 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:45,282 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:45,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:45,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:45,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:45,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:45,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:45,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:45,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:45,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:45,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:45,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:45,300 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:45,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:45,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:42:45,314 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:42:45,315 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 18:42:45,792 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 18:42:45,792 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 18:42:45,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:45,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 173 transitions. [2025-04-26 18:42:45,793 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 173 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 18:42:45,794 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:45,794 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 173 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 18:42:45,794 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:45,794 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 173 transitions. Stem has 4 letters. Loop has 4 letters. [2025-04-26 18:42:45,794 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:45,794 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57514 states and 158530 transitions. [2025-04-26 18:42:46,457 INFO L131 ngComponentsAnalysis]: Automaton has 291 accepting balls. 610 [2025-04-26 18:42:46,708 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57514 states to 35185 states and 98154 transitions. [2025-04-26 18:42:46,709 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6307 [2025-04-26 18:42:46,722 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7251 [2025-04-26 18:42:46,723 INFO L74 IsDeterministic]: Start isDeterministic. Operand 35185 states and 98154 transitions. [2025-04-26 18:42:46,723 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:46,723 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35185 states and 98154 transitions. [2025-04-26 18:42:46,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35185 states and 98154 transitions. [2025-04-26 18:42:47,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35185 to 33666. [2025-04-26 18:42:47,492 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 18:42:47,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33666 states to 33666 states and 94546 transitions. [2025-04-26 18:42:47,817 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33666 states and 94546 transitions. [2025-04-26 18:42:47,817 INFO L438 stractBuchiCegarLoop]: Abstraction has 33666 states and 94546 transitions. [2025-04-26 18:42:47,817 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:42:47,817 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33666 states and 94546 transitions. [2025-04-26 18:42:47,998 INFO L131 ngComponentsAnalysis]: Automaton has 291 accepting balls. 610 [2025-04-26 18:42:47,998 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:47,998 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:47,999 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 18:42:47,999 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:47,999 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 18:42:47,999 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 18:42:48,000 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:48,000 INFO L85 PathProgramCache]: Analyzing trace with hash 136930453, now seen corresponding path program 1 times [2025-04-26 18:42:48,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:48,000 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562433537] [2025-04-26 18:42:48,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:48,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:48,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:48,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:48,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:48,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:48,005 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:48,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:48,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:48,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:48,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:48,009 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:48,009 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:48,009 INFO L85 PathProgramCache]: Analyzing trace with hash 5699, now seen corresponding path program 1 times [2025-04-26 18:42:48,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:48,009 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755276212] [2025-04-26 18:42:48,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:48,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:48,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:48,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:48,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:48,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:48,012 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:48,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:48,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:48,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:48,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:48,014 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:48,014 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:48,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1553816105, now seen corresponding path program 1 times [2025-04-26 18:42:48,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:48,014 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861394161] [2025-04-26 18:42:48,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:48,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:48,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:42:48,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:42:48,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:48,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:48,022 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:48,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:42:48,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:42:48,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:48,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:48,027 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:48,043 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:48,043 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:48,043 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:48,043 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:48,043 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:48,043 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:48,044 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:48,044 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:48,044 INFO L132 ssoRankerPreferences]: Filename of dumped script: barrier-4t.c.bpl_petrified1_Iteration4_Loop [2025-04-26 18:42:48,044 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:48,044 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:48,044 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:48,060 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:48,060 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:48,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:48,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:48,063 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:48,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 18:42:48,066 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:48,066 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:48,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 18:42:48,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:48,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:48,085 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 18:42:48,086 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 18:42:48,088 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:48,088 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:48,154 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:48,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:48,159 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:48,159 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:48,159 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:48,159 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:48,159 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:48,159 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:48,159 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:48,159 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:48,159 INFO L132 ssoRankerPreferences]: Filename of dumped script: barrier-4t.c.bpl_petrified1_Iteration4_Loop [2025-04-26 18:42:48,159 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:48,159 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:48,160 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:48,177 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:48,177 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:48,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:48,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:48,180 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 18:42:48,182 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 18:42:48,183 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:42:48,193 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:48,193 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:48,193 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:48,193 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:48,193 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:48,194 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:48,194 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:48,196 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:48,199 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:42:48,199 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:48,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:48,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:48,201 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 18:42:48,203 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 18:42:48,204 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:48,207 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 18:42:48,207 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:48,207 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:48,207 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x5, z) = -1*x5 + 1*z Supporting invariants [] [2025-04-26 18:42:48,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 18:42:48,214 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:48,226 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:48,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:48,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:48,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:48,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:48,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:48,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:48,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:48,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:48,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:48,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:48,247 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:48,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:48,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:42:48,260 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:42:48,260 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 18:42:48,996 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 18:42:48,997 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 18:42:48,997 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 18:42:48,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 177 transitions. [2025-04-26 18:42:48,998 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 177 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 18:42:48,998 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:48,998 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 177 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 18:42:48,998 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:48,998 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 177 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 18:42:48,998 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:48,998 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98545 states and 269459 transitions. [2025-04-26 18:42:50,137 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 38 [2025-04-26 18:42:50,149 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98545 states to 2627 states and 7155 transitions. [2025-04-26 18:42:50,149 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 660 [2025-04-26 18:42:50,150 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 660 [2025-04-26 18:42:50,150 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2627 states and 7155 transitions. [2025-04-26 18:42:50,150 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:50,150 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2627 states and 7155 transitions. [2025-04-26 18:42:50,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2627 states and 7155 transitions. [2025-04-26 18:42:50,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2627 to 2627. [2025-04-26 18:42:50,169 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 18:42:50,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2627 states to 2627 states and 7155 transitions. [2025-04-26 18:42:50,173 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2627 states and 7155 transitions. [2025-04-26 18:42:50,173 INFO L438 stractBuchiCegarLoop]: Abstraction has 2627 states and 7155 transitions. [2025-04-26 18:42:50,173 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:42:50,173 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2627 states and 7155 transitions. [2025-04-26 18:42:50,178 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 38 [2025-04-26 18:42:50,178 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:50,178 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:50,178 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 18:42:50,178 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:50,179 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 18:42:50,179 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 18:42:50,179 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:50,179 INFO L85 PathProgramCache]: Analyzing trace with hash 136889707, now seen corresponding path program 1 times [2025-04-26 18:42:50,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:50,179 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43738871] [2025-04-26 18:42:50,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:50,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:50,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:50,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:50,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:50,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:50,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:42:50,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:42:50,223 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43738871] [2025-04-26 18:42:50,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43738871] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:42:50,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:42:50,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 18:42:50,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804593214] [2025-04-26 18:42:50,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:42:50,228 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:42:50,228 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:50,228 INFO L85 PathProgramCache]: Analyzing trace with hash 4995, now seen corresponding path program 1 times [2025-04-26 18:42:50,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:50,228 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537401070] [2025-04-26 18:42:50,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:50,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:50,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:50,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:50,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:50,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:50,233 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:50,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:50,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:50,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:50,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:50,235 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:50,246 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:50,247 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:50,247 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:50,247 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:50,247 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:50,247 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:50,247 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:50,247 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:50,247 INFO L132 ssoRankerPreferences]: Filename of dumped script: barrier-4t.c.bpl_petrified1_Iteration5_Loop [2025-04-26 18:42:50,247 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:50,247 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:50,247 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:50,268 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:50,268 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:50,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:50,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:50,271 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 18:42:50,346 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:50,347 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:50,353 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 18:42:50,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:50,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:50,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:50,365 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 18:42:50,365 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 18:42:50,367 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:50,367 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:50,434 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:50,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-04-26 18:42:50,442 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:50,442 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:50,442 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:50,442 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:50,442 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:50,442 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:50,442 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:50,442 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:50,442 INFO L132 ssoRankerPreferences]: Filename of dumped script: barrier-4t.c.bpl_petrified1_Iteration5_Loop [2025-04-26 18:42:50,442 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:50,442 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:50,443 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:50,470 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:50,470 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:50,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:50,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:50,472 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 18:42:50,473 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 18:42:50,474 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:42:50,484 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:50,485 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:50,485 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:50,485 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:50,485 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:50,486 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:50,486 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:50,487 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:50,489 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:42:50,489 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:42:50,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:50,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:50,491 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 18:42:50,492 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 18:42:50,493 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:50,496 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 18:42:50,496 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:50,496 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:50,496 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x3, z) = -1*x3 + 1*z Supporting invariants [] [2025-04-26 18:42:50,502 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 18:42:50,502 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:50,513 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:50,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:50,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:50,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:50,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:50,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:50,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:50,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:50,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:50,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:50,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:50,526 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:50,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:50,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:42:50,537 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:42:50,538 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 18:42:50,607 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 18:42:50,607 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 18:42:50,608 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 18:42:50,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2025-04-26 18:42:50,608 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 108 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 18:42:50,608 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:50,608 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 108 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 18:42:50,608 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:50,608 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 108 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 18:42:50,608 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:50,608 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5233 states and 14038 transitions. [2025-04-26 18:42:50,634 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 36 [2025-04-26 18:42:50,647 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5233 states to 3383 states and 9002 transitions. [2025-04-26 18:42:50,647 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 675 [2025-04-26 18:42:50,648 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 790 [2025-04-26 18:42:50,648 INFO L74 IsDeterministic]: Start isDeterministic. Operand 3383 states and 9002 transitions. [2025-04-26 18:42:50,648 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:50,649 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3383 states and 9002 transitions. [2025-04-26 18:42:50,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3383 states and 9002 transitions. [2025-04-26 18:42:50,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3383 to 2706. [2025-04-26 18:42:50,672 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 18:42:50,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 7357 transitions. [2025-04-26 18:42:50,676 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2706 states and 7357 transitions. [2025-04-26 18:42:50,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:42:50,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 18:42:50,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-26 18:42:50,680 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 18:42:50,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:42:50,714 INFO L93 Difference]: Finished difference Result 1817 states and 4717 transitions. [2025-04-26 18:42:50,714 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1817 states and 4717 transitions. [2025-04-26 18:42:50,720 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 24 [2025-04-26 18:42:50,725 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1817 states to 1807 states and 4671 transitions. [2025-04-26 18:42:50,725 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 463 [2025-04-26 18:42:50,725 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 463 [2025-04-26 18:42:50,726 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1807 states and 4671 transitions. [2025-04-26 18:42:50,726 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:50,726 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1807 states and 4671 transitions. [2025-04-26 18:42:50,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1807 states and 4671 transitions. [2025-04-26 18:42:50,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1807 to 1807. [2025-04-26 18:42:50,737 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 18:42:50,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1807 states to 1807 states and 4671 transitions. [2025-04-26 18:42:50,740 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1807 states and 4671 transitions. [2025-04-26 18:42:50,740 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 18:42:50,741 INFO L438 stractBuchiCegarLoop]: Abstraction has 1807 states and 4671 transitions. [2025-04-26 18:42:50,741 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 18:42:50,741 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1807 states and 4671 transitions. [2025-04-26 18:42:50,745 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 24 [2025-04-26 18:42:50,745 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:50,745 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:50,745 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:42:50,745 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:50,745 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 18:42:50,745 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 18:42:50,746 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:50,746 INFO L85 PathProgramCache]: Analyzing trace with hash -957082353, now seen corresponding path program 1 times [2025-04-26 18:42:50,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:50,746 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319454474] [2025-04-26 18:42:50,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:50,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:50,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:42:50,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:42:50,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:50,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:50,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:42:50,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:42:50,779 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319454474] [2025-04-26 18:42:50,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319454474] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:42:50,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:42:50,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:42:50,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564873570] [2025-04-26 18:42:50,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:42:50,779 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:42:50,779 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:50,779 INFO L85 PathProgramCache]: Analyzing trace with hash 5283, now seen corresponding path program 1 times [2025-04-26 18:42:50,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:50,779 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322285172] [2025-04-26 18:42:50,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:50,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:50,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:50,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:50,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:50,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:50,782 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:50,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:50,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:50,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:50,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:50,783 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:50,793 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:50,793 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:50,793 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:50,793 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:50,793 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:50,793 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:50,793 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:50,793 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:50,793 INFO L132 ssoRankerPreferences]: Filename of dumped script: barrier-4t.c.bpl_petrified1_Iteration6_Loop [2025-04-26 18:42:50,793 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:50,793 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:50,793 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:50,807 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:50,807 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:50,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:50,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:50,809 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 18:42:50,810 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 18:42:50,811 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:50,811 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:50,827 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 18:42:50,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:50,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:50,829 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 18:42:50,830 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 18:42:50,833 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:50,833 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:50,897 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:50,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:50,902 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:50,902 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:50,902 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:50,902 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:50,902 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:50,902 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:50,902 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:50,902 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:50,902 INFO L132 ssoRankerPreferences]: Filename of dumped script: barrier-4t.c.bpl_petrified1_Iteration6_Loop [2025-04-26 18:42:50,902 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:50,902 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:50,903 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:50,918 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:50,918 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:50,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:50,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:50,920 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 18:42:50,922 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 18:42:50,922 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:42:50,932 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:50,932 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:50,933 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:50,933 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:50,933 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:50,934 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:50,934 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:50,939 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:50,942 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:42:50,942 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:50,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:50,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:50,945 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 18:42:50,946 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 18:42:50,948 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:50,950 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 18:42:50,951 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 18:42:50,951 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:50,951 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:50,951 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x4, z) = -1*x4 + 1*z Supporting invariants [] [2025-04-26 18:42:50,958 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 18:42:50,958 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:50,970 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:50,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:42:50,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:42:50,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:50,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:50,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:50,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:50,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:50,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:50,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:50,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:50,991 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:50,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:51,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:42:51,003 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:42:51,003 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 18:42:51,066 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 18:42:51,066 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 18:42:51,067 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 18:42:51,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2025-04-26 18:42:51,067 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 97 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 18:42:51,067 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:51,067 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 97 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 18:42:51,067 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:51,067 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 97 transitions. Stem has 8 letters. Loop has 4 letters. [2025-04-26 18:42:51,067 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:51,067 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3252 states and 8162 transitions. [2025-04-26 18:42:51,079 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 20 [2025-04-26 18:42:51,085 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3252 states to 2196 states and 5453 transitions. [2025-04-26 18:42:51,085 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 482 [2025-04-26 18:42:51,086 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 543 [2025-04-26 18:42:51,086 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2196 states and 5453 transitions. [2025-04-26 18:42:51,086 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:51,086 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2196 states and 5453 transitions. [2025-04-26 18:42:51,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2196 states and 5453 transitions. [2025-04-26 18:42:51,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2196 to 1865. [2025-04-26 18:42:51,099 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 18:42:51,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1865 states to 1865 states and 4779 transitions. [2025-04-26 18:42:51,102 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1865 states and 4779 transitions. [2025-04-26 18:42:51,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:42:51,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 18:42:51,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-26 18:42:51,102 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 18:42:51,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:42:51,134 INFO L93 Difference]: Finished difference Result 793 states and 2071 transitions. [2025-04-26 18:42:51,134 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 793 states and 2071 transitions. [2025-04-26 18:42:51,137 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2025-04-26 18:42:51,139 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 793 states to 660 states and 1633 transitions. [2025-04-26 18:42:51,139 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 161 [2025-04-26 18:42:51,139 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 161 [2025-04-26 18:42:51,139 INFO L74 IsDeterministic]: Start isDeterministic. Operand 660 states and 1633 transitions. [2025-04-26 18:42:51,139 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:51,139 INFO L218 hiAutomatonCegarLoop]: Abstraction has 660 states and 1633 transitions. [2025-04-26 18:42:51,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states and 1633 transitions. [2025-04-26 18:42:51,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2025-04-26 18:42:51,143 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 18:42:51,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 1633 transitions. [2025-04-26 18:42:51,144 INFO L240 hiAutomatonCegarLoop]: Abstraction has 660 states and 1633 transitions. [2025-04-26 18:42:51,145 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 18:42:51,147 INFO L438 stractBuchiCegarLoop]: Abstraction has 660 states and 1633 transitions. [2025-04-26 18:42:51,148 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 18:42:51,148 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 660 states and 1633 transitions. [2025-04-26 18:42:51,150 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2025-04-26 18:42:51,150 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:51,150 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:51,150 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:42:51,150 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:51,151 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 18:42:51,151 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 18:42:51,151 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:51,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1189822374, now seen corresponding path program 1 times [2025-04-26 18:42:51,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:51,151 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981688000] [2025-04-26 18:42:51,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:51,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:51,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:42:51,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:42:51,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:51,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:51,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:42:51,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:42:51,210 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981688000] [2025-04-26 18:42:51,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981688000] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:42:51,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:42:51,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-26 18:42:51,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426786970] [2025-04-26 18:42:51,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:42:51,211 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:42:51,211 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:51,211 INFO L85 PathProgramCache]: Analyzing trace with hash 5571, now seen corresponding path program 1 times [2025-04-26 18:42:51,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:51,211 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827065834] [2025-04-26 18:42:51,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:51,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:51,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:51,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:51,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:51,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:51,213 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:51,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:51,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:51,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:51,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:51,219 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:51,231 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:51,232 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:51,232 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:51,232 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:51,232 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:51,232 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:51,232 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:51,232 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:51,232 INFO L132 ssoRankerPreferences]: Filename of dumped script: barrier-4t.c.bpl_petrified1_Iteration7_Loop [2025-04-26 18:42:51,232 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:51,232 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:51,232 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:51,248 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:51,248 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:51,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:51,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:51,250 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 18:42:51,252 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 18:42:51,253 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:51,253 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:51,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-04-26 18:42:51,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:51,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:51,273 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 18:42:51,274 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 18:42:51,276 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:51,276 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:51,342 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:51,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:51,347 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:51,347 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:51,347 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:51,347 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:51,347 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:51,347 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:51,347 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:51,347 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:51,347 INFO L132 ssoRankerPreferences]: Filename of dumped script: barrier-4t.c.bpl_petrified1_Iteration7_Loop [2025-04-26 18:42:51,347 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:51,347 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:51,348 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:51,362 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:51,362 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:51,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:51,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:51,364 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 18:42:51,365 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 18:42:51,367 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:42:51,376 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:51,376 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:51,376 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:51,377 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:51,377 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:51,377 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:51,377 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:51,379 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:51,381 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:42:51,381 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:51,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:51,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:51,384 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 18:42:51,385 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 18:42:51,385 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:51,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-04-26 18:42:51,388 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:51,388 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:51,388 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x5) = 1*z - 1*x5 Supporting invariants [] [2025-04-26 18:42:51,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:51,395 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:51,407 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:51,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:42:51,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:42:51,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:51,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:51,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:51,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:51,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:51,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:51,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:51,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:51,434 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:51,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:51,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:42:51,443 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:42:51,443 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 18:42:51,467 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 18:42:51,467 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:42:51,468 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 18:42:51,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2025-04-26 18:42:51,468 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 57 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 18:42:51,468 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:51,468 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 57 transitions. Stem has 13 letters. Loop has 2 letters. [2025-04-26 18:42:51,468 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:51,468 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 57 transitions. Stem has 11 letters. Loop has 4 letters. [2025-04-26 18:42:51,468 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:51,468 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 901 states and 2105 transitions. [2025-04-26 18:42:51,471 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:42:51,471 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 901 states to 0 states and 0 transitions. [2025-04-26 18:42:51,471 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:42:51,471 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:42:51,471 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:42:51,471 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:42:51,471 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:51,471 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:51,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:42:51,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-26 18:42:51,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-26 18:42:51,471 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 18:42:51,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:42:51,471 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2025-04-26 18:42:51,471 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2025-04-26 18:42:51,471 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:42:51,471 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2025-04-26 18:42:51,472 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:42:51,472 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:42:51,472 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:42:51,472 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:42:51,472 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:51,472 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:51,472 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-26 18:42:51,472 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:51,472 INFO L340 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-04-26 18:42:51,472 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:42:51,472 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:42:51,472 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:42:51,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 18:42:51,483 INFO L201 PluginConnector]: Adding new model barrier-4t.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:42:51 BoogieIcfgContainer [2025-04-26 18:42:51,483 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:42:51,483 INFO L158 Benchmark]: Toolchain (without parser) took 11649.64ms. Allocated memory was 155.2MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 87.7MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 817.7MB. Max. memory is 8.0GB. [2025-04-26 18:42:51,484 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.19ms. Allocated memory is still 155.2MB. Free memory is still 88.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:51,484 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.97ms. Allocated memory is still 155.2MB. Free memory was 87.6MB in the beginning and 85.0MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:51,484 INFO L158 Benchmark]: Boogie Preprocessor took 18.40ms. Allocated memory is still 155.2MB. Free memory was 85.0MB in the beginning and 83.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:51,484 INFO L158 Benchmark]: RCFGBuilder took 171.96ms. Allocated memory is still 155.2MB. Free memory was 83.9MB in the beginning and 74.0MB in the end (delta: 9.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 18:42:51,484 INFO L158 Benchmark]: BuchiAutomizer took 11416.18ms. Allocated memory was 155.2MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 73.9MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 805.2MB. Max. memory is 8.0GB. [2025-04-26 18:42:51,485 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.19ms. Allocated memory is still 155.2MB. Free memory is still 88.6MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.97ms. Allocated memory is still 155.2MB. Free memory was 87.6MB in the beginning and 85.0MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 18.40ms. Allocated memory is still 155.2MB. Free memory was 85.0MB in the beginning and 83.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 171.96ms. Allocated memory is still 155.2MB. Free memory was 83.9MB in the beginning and 74.0MB in the end (delta: 9.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 11416.18ms. Allocated memory was 155.2MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 73.9MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 805.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.3s and 8 iterations. TraceHistogramMax:1. Analysis of lassos took 2.0s. Construction of modules took 0.3s. Büchi inclusion checks took 2.1s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 8. Automata minimization 2.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 4897 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 2.9s 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, 592 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 585 mSDsluCounter, 717 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 359 mSDsCounter, 61 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 592 IncrementalHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61 mSolverCounterUnsat, 358 mSDtfsCounter, 592 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: 70ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.7s InitialAbstractionConstructionTime: 1.0s InitialAbstraction: Time to compute Ample Reduction [ms]: 1064, 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 18:42:51,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...