/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 ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/bench/exp1x3.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:39:57,390 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:39:57,438 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:39:57,444 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:39:57,444 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:39:57,445 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:39:57,445 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:39:57,469 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:39:57,469 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:39:57,469 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:39:57,469 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:39:57,469 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:39:57,470 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:39:57,470 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:39:57,470 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:39:57,470 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:39:57,470 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:39:57,470 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:39:57,470 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:39:57,470 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:39:57,470 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:39:57,470 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:39:57,470 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:39:57,470 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:39:57,470 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:39:57,470 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:39:57,470 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:39:57,470 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:39:57,470 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:39:57,471 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:39:57,471 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:39:57,471 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:39:57,471 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:39:57,471 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:39:57,471 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:39:57,471 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:39:57,471 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:39:57,471 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:39:57,471 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:39:57,471 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:39:57,471 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:39:57,471 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:39:57,471 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:39:57,694 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:39:57,701 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:39:57,703 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:39:57,704 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:39:57,705 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:39:57,706 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/bench/exp1x3.wvr.bpl [2025-04-26 18:39:57,706 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/bench/exp1x3.wvr.bpl' [2025-04-26 18:39:57,721 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:39:57,722 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:39:57,723 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:39:57,723 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:39:57,723 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:39:57,731 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "exp1x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:57" (1/1) ... [2025-04-26 18:39:57,750 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "exp1x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:57" (1/1) ... [2025-04-26 18:39:57,755 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:39:57,756 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:39:57,757 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:39:57,757 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:39:57,757 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:39:57,761 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "exp1x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:57" (1/1) ... [2025-04-26 18:39:57,762 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "exp1x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:57" (1/1) ... [2025-04-26 18:39:57,762 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "exp1x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:57" (1/1) ... [2025-04-26 18:39:57,762 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "exp1x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:57" (1/1) ... [2025-04-26 18:39:57,764 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "exp1x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:57" (1/1) ... [2025-04-26 18:39:57,765 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "exp1x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:57" (1/1) ... [2025-04-26 18:39:57,768 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "exp1x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:57" (1/1) ... [2025-04-26 18:39:57,768 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "exp1x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:57" (1/1) ... [2025-04-26 18:39:57,768 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "exp1x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:57" (1/1) ... [2025-04-26 18:39:57,778 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:39:57,778 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:39:57,781 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:39:57,781 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:39:57,782 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "exp1x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:57" (1/1) ... [2025-04-26 18:39:57,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:39:57,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:57,809 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:39:57,813 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:39:57,833 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:39:57,833 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:39:57,833 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:39:57,833 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:39:57,833 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:39:57,833 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:39:57,833 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:39:57,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:39:57,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:39:57,834 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:39:57,867 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:39:57,869 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:39:57,930 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:39:57,930 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:39:57,939 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:39:57,939 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:39:57,940 INFO L201 PluginConnector]: Adding new model exp1x3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:39:57 BoogieIcfgContainer [2025-04-26 18:39:57,940 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:39:57,942 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:39:57,942 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:39:57,946 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:39:57,946 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:39:57,947 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "exp1x3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:57" (1/2) ... [2025-04-26 18:39:57,948 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@74278580 and model type exp1x3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:39:57, skipping insertion in model container [2025-04-26 18:39:57,948 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:39:57,948 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "exp1x3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:39:57" (2/2) ... [2025-04-26 18:39:57,949 INFO L376 chiAutomizerObserver]: Analyzing ICFG exp1x3.wvr.bpl [2025-04-26 18:39:57,983 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 18:39:58,019 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:39:58,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:39:58,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:58,022 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:39:58,024 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:39:58,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 21 transitions, 56 flow [2025-04-26 18:39:58,088 INFO L116 PetriNetUnfolderBase]: 2/17 cut-off events. [2025-04-26 18:39:58,091 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 18:39:58,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26 conditions, 17 events. 2/17 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 17 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2025-04-26 18:39:58,095 INFO L82 GeneralOperation]: Start removeDead. Operand has 24 places, 21 transitions, 56 flow [2025-04-26 18:39:58,099 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 22 places, 17 transitions, 46 flow [2025-04-26 18:39:58,099 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 22 places, 17 transitions, 46 flow [2025-04-26 18:39:58,100 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 22 places, 17 transitions, 46 flow [2025-04-26 18:39:58,110 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 31 states, 29 states have (on average 1.896551724137931) internal successors, (in total 55), 30 states have internal predecessors, (55), 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:39:58,111 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 31 states, 29 states have (on average 1.896551724137931) internal successors, (in total 55), 30 states have internal predecessors, (55), 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:39:58,112 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:39:58,148 WARN L140 AmpleReduction]: Number of pruned transitions: 10 [2025-04-26 18:39:58,148 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:39:58,150 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 6 [2025-04-26 18:39:58,150 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:15 [2025-04-26 18:39:58,150 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:9 [2025-04-26 18:39:58,150 WARN L145 AmpleReduction]: Times succ was already a loop node:10 [2025-04-26 18:39:58,150 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 18:39:58,150 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:39:58,151 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 31 states, 29 states have (on average 1.5517241379310345) internal successors, (in total 45), 30 states have internal predecessors, (45), 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:39:58,157 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:39:58,158 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:39:58,158 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:39:58,158 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:39:58,158 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:39:58,158 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:39:58,158 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:39:58,158 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:39:58,160 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 31 states, 29 states have (on average 1.5517241379310345) internal successors, (in total 45), 30 states have internal predecessors, (45), 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:39:58,171 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 16 [2025-04-26 18:39:58,171 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:58,171 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:58,174 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:39:58,174 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:39:58,174 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:39:58,175 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 31 states, 29 states have (on average 1.5517241379310345) internal successors, (in total 45), 30 states have internal predecessors, (45), 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:39:58,176 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 16 [2025-04-26 18:39:58,176 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:58,176 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:58,176 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:39:58,176 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:39:58,181 INFO L752 eck$LassoCheckResult]: Stem: "[33] $Ultimate##0-->L33: Formula: (and (= v_x2_6 v_x1_6) (< 0 v_x1_6)) InVars {x1=v_x1_6, x2=v_x2_6} OutVars{x1=v_x1_6, x2=v_x2_6} AuxVars[] AssignedVars[]" "[53] L33-->L16: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" [2025-04-26 18:39:58,181 INFO L754 eck$LassoCheckResult]: Loop: "[41] L16-->L17: Formula: (< v_x1_1 v_n_1) InVars {x1=v_x1_1, n=v_n_1} OutVars{x1=v_x1_1, n=v_n_1} AuxVars[] AssignedVars[]" "[43] L17-->L16: Formula: (= (* v_x1_3 2) v_x1_2) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" [2025-04-26 18:39:58,185 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:58,185 INFO L85 PathProgramCache]: Analyzing trace with hash 2037, now seen corresponding path program 1 times [2025-04-26 18:39:58,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:58,190 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771177758] [2025-04-26 18:39:58,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:58,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:58,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:58,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:58,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:58,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:58,234 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:58,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:58,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:58,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:58,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:58,249 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:58,252 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:58,252 INFO L85 PathProgramCache]: Analyzing trace with hash 2275, now seen corresponding path program 1 times [2025-04-26 18:39:58,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:58,253 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009216052] [2025-04-26 18:39:58,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:58,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:58,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:58,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:58,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:58,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:58,259 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:58,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:58,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:58,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:58,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:58,262 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:58,263 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:58,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1958871, now seen corresponding path program 1 times [2025-04-26 18:39:58,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:58,263 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304055619] [2025-04-26 18:39:58,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:58,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:58,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:39:58,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:39:58,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:58,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:58,268 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:58,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:39:58,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:39:58,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:58,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:58,272 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:58,337 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:58,337 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:58,337 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:58,338 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:58,338 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:39:58,338 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:58,338 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:58,338 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:58,338 INFO L132 ssoRankerPreferences]: Filename of dumped script: exp1x3.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 18:39:58,338 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:58,338 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:58,348 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:58,370 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:58,421 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:58,421 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:39:58,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:58,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:58,424 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:39:58,426 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:39:58,427 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:39:58,427 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:39:58,457 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:39:58,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:58,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:58,459 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:39:58,460 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:39:58,462 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:39:58,462 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:39:58,533 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:39:58,539 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:39:58,539 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:58,539 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:58,539 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:58,539 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:58,539 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:58,539 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:58,540 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:58,540 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:58,540 INFO L132 ssoRankerPreferences]: Filename of dumped script: exp1x3.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 18:39:58,540 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:58,540 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:58,541 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:58,556 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:58,597 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:58,628 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:58,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:58,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:58,632 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:39:58,632 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:39:58,634 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:39:58,645 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:58,645 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:58,646 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:58,646 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:58,658 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:58,659 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:58,670 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:58,680 INFO L436 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-04-26 18:39:58,680 INFO L437 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 18:39:58,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:58,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:58,702 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:39:58,704 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:39:58,705 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:58,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:58,723 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 18:39:58,723 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:58,724 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, n) = -1*x1 + 1*n Supporting invariants [1*x1 - 1 >= 0] [2025-04-26 18:39:58,730 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:39:58,736 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:39:58,772 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:58,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:58,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:58,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:58,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:58,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-26 18:39:58,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:58,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:58,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:58,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:58,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:58,822 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 18:39:58,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:58,851 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:39:58,875 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2025-04-26 18:39:58,881 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 31 states, 29 states have (on average 1.5517241379310345) internal successors, (in total 45), 30 states have internal predecessors, (45), 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 4 states, 4 states have (on average 1.0) 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:39:58,994 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 31 states, 29 states have (on average 1.5517241379310345) internal successors, (in total 45), 30 states have internal predecessors, (45), 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 4 states, 4 states have (on average 1.0) 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 65 states and 100 transitions. Complement of second has 8 states. [2025-04-26 18:39:58,995 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:39:58,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.0) 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:39:59,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2025-04-26 18:39:59,004 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 18:39:59,008 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:59,008 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 18:39:59,008 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:59,008 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 18:39:59,008 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:59,009 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 100 transitions. [2025-04-26 18:39:59,011 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2025-04-26 18:39:59,014 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 21 states and 32 transitions. [2025-04-26 18:39:59,015 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-04-26 18:39:59,015 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2025-04-26 18:39:59,015 INFO L74 IsDeterministic]: Start isDeterministic. Operand 21 states and 32 transitions. [2025-04-26 18:39:59,015 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:59,016 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 32 transitions. [2025-04-26 18:39:59,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 32 transitions. [2025-04-26 18:39:59,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2025-04-26 18:39:59,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.5263157894736843) internal successors, (in total 29), 18 states have internal predecessors, (29), 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:39:59,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 29 transitions. [2025-04-26 18:39:59,033 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 29 transitions. [2025-04-26 18:39:59,033 INFO L438 stractBuchiCegarLoop]: Abstraction has 19 states and 29 transitions. [2025-04-26 18:39:59,033 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:39:59,033 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 29 transitions. [2025-04-26 18:39:59,034 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2025-04-26 18:39:59,035 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:59,035 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:59,035 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 18:39:59,035 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:39:59,035 INFO L752 eck$LassoCheckResult]: Stem: "[33] $Ultimate##0-->L33: Formula: (and (= v_x2_6 v_x1_6) (< 0 v_x1_6)) InVars {x1=v_x1_6, x2=v_x2_6} OutVars{x1=v_x1_6, x2=v_x2_6} AuxVars[] AssignedVars[]" "[53] L33-->L16: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[40] L16-->thread1FINAL: Formula: (<= v_n_2 v_x1_4) InVars {x1=v_x1_4, n=v_n_2} OutVars{x1=v_x1_4, n=v_n_2} AuxVars[] AssignedVars[]" "[42] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[50] L33-1-->L24: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" [2025-04-26 18:39:59,035 INFO L754 eck$LassoCheckResult]: Loop: "[45] L24-->L25: Formula: (< v_x2_1 v_n_3) InVars {x2=v_x2_1, n=v_n_3} OutVars{x2=v_x2_1, n=v_n_3} AuxVars[] AssignedVars[]" "[47] L25-->L24: Formula: (= v_x2_2 (* v_x2_3 2)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-04-26 18:39:59,036 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:59,036 INFO L85 PathProgramCache]: Analyzing trace with hash 60724059, now seen corresponding path program 1 times [2025-04-26 18:39:59,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:59,036 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998194423] [2025-04-26 18:39:59,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:59,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:59,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:39:59,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:39:59,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:59,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:59,041 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:59,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:39:59,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:39:59,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:59,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:59,047 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:59,048 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:59,048 INFO L85 PathProgramCache]: Analyzing trace with hash 2403, now seen corresponding path program 1 times [2025-04-26 18:39:59,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:59,048 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320070350] [2025-04-26 18:39:59,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:59,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:59,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:59,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:59,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:59,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:59,054 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:59,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:59,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:59,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:59,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:59,056 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:59,058 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:59,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1773720003, now seen corresponding path program 1 times [2025-04-26 18:39:59,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:59,058 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282558819] [2025-04-26 18:39:59,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:59,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:59,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:39:59,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:39:59,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:59,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:59,106 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:39:59,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:39:59,106 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282558819] [2025-04-26 18:39:59,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282558819] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:39:59,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:39:59,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:39:59,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258739970] [2025-04-26 18:39:59,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:39:59,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:39:59,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 18:39:59,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 18:39:59,122 INFO L87 Difference]: Start difference. First operand 19 states and 29 transitions. cyclomatic complexity: 15 Second operand has 4 states, 4 states have (on average 1.75) 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:39:59,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:39:59,147 INFO L93 Difference]: Finished difference Result 24 states and 34 transitions. [2025-04-26 18:39:59,147 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 34 transitions. [2025-04-26 18:39:59,148 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2025-04-26 18:39:59,148 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 21 states and 31 transitions. [2025-04-26 18:39:59,148 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2025-04-26 18:39:59,148 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2025-04-26 18:39:59,148 INFO L74 IsDeterministic]: Start isDeterministic. Operand 21 states and 31 transitions. [2025-04-26 18:39:59,148 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:59,149 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 31 transitions. [2025-04-26 18:39:59,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 31 transitions. [2025-04-26 18:39:59,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2025-04-26 18:39:59,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (in total 28), 18 states have internal predecessors, (28), 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:39:59,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 28 transitions. [2025-04-26 18:39:59,150 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 28 transitions. [2025-04-26 18:39:59,150 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 18:39:59,150 INFO L438 stractBuchiCegarLoop]: Abstraction has 19 states and 28 transitions. [2025-04-26 18:39:59,150 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:39:59,151 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 28 transitions. [2025-04-26 18:39:59,151 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2025-04-26 18:39:59,151 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:59,151 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:59,151 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 18:39:59,151 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:39:59,152 INFO L752 eck$LassoCheckResult]: Stem: "[33] $Ultimate##0-->L33: Formula: (and (= v_x2_6 v_x1_6) (< 0 v_x1_6)) InVars {x1=v_x1_6, x2=v_x2_6} OutVars{x1=v_x1_6, x2=v_x2_6} AuxVars[] AssignedVars[]" "[53] L33-->L16: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[41] L16-->L17: Formula: (< v_x1_1 v_n_1) InVars {x1=v_x1_1, n=v_n_1} OutVars{x1=v_x1_1, n=v_n_1} AuxVars[] AssignedVars[]" "[50] L33-1-->L24: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" "[43] L17-->L16: Formula: (= (* v_x1_3 2) v_x1_2) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[40] L16-->thread1FINAL: Formula: (<= v_n_2 v_x1_4) InVars {x1=v_x1_4, n=v_n_2} OutVars{x1=v_x1_4, n=v_n_2} AuxVars[] AssignedVars[]" [2025-04-26 18:39:59,152 INFO L754 eck$LassoCheckResult]: Loop: "[45] L24-->L25: Formula: (< v_x2_1 v_n_3) InVars {x2=v_x2_1, n=v_n_3} OutVars{x2=v_x2_1, n=v_n_3} AuxVars[] AssignedVars[]" "[47] L25-->L24: Formula: (= v_x2_2 (* v_x2_3 2)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-04-26 18:39:59,152 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:59,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1882483131, now seen corresponding path program 1 times [2025-04-26 18:39:59,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:59,152 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657125262] [2025-04-26 18:39:59,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:59,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:59,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:39:59,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:39:59,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:59,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:59,160 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:59,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:39:59,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:39:59,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:59,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:59,164 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:59,165 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:59,165 INFO L85 PathProgramCache]: Analyzing trace with hash 2403, now seen corresponding path program 2 times [2025-04-26 18:39:59,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:59,165 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033865503] [2025-04-26 18:39:59,165 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:39:59,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:59,167 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:59,170 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:59,170 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:39:59,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:59,170 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:59,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:59,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:59,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:59,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:59,172 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:59,172 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:59,173 INFO L85 PathProgramCache]: Analyzing trace with hash 885058717, now seen corresponding path program 1 times [2025-04-26 18:39:59,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:59,173 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745407636] [2025-04-26 18:39:59,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:59,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:59,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:39:59,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:39:59,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:59,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:59,177 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:59,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:39:59,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:39:59,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:59,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:59,180 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:59,239 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:59,239 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:59,239 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:59,239 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:59,239 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:39:59,239 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:59,239 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:59,239 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:59,239 INFO L132 ssoRankerPreferences]: Filename of dumped script: exp1x3.wvr.bpl_petrified1_Iteration3_Lasso [2025-04-26 18:39:59,239 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:59,240 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:59,240 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:59,242 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:59,245 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:59,247 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:59,306 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:59,307 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:39:59,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:59,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:59,309 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:39:59,311 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:39:59,311 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:39:59,311 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:39:59,322 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:39:59,322 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork0_thidvar1=0} Honda state: {thread2Thread1of1ForFork0_thidvar1=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:39:59,328 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:39:59,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:59,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:59,330 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:39:59,332 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:39:59,333 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:39:59,333 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:39:59,345 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:39:59,345 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork0_thidvar0=0} Honda state: {thread2Thread1of1ForFork0_thidvar0=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:39:59,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:59,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:59,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:59,353 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:39:59,355 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:39:59,356 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:39:59,356 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:39:59,366 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:39:59,367 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork1_thidvar0=0} Honda state: {thread1Thread1of1ForFork1_thidvar0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:39:59,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:59,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:59,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:59,373 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:39:59,374 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:39:59,375 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:39:59,375 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:39:59,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:59,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:59,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:59,404 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:39:59,405 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:39:59,405 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:39:59,406 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:39:59,484 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:39:59,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 18:39:59,489 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:59,489 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:59,489 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:59,489 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:59,489 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:59,489 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:59,489 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:59,489 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:59,489 INFO L132 ssoRankerPreferences]: Filename of dumped script: exp1x3.wvr.bpl_petrified1_Iteration3_Lasso [2025-04-26 18:39:59,489 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:59,490 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:59,490 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:59,496 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:59,501 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:59,519 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:59,571 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:59,571 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:59,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:59,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:59,574 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:39:59,576 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:39:59,577 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:39:59,587 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:59,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:59,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:59,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:59,590 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:59,590 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:59,592 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:59,598 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:39:59,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:59,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:59,600 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:39:59,602 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:39:59,603 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:39:59,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:59,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:59,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:59,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:59,617 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:59,617 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:59,620 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:59,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:59,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:59,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:59,627 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:39:59,629 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:39:59,630 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:39:59,639 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:59,640 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:59,640 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:59,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:59,643 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:59,643 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:59,649 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:59,655 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 18:39:59,655 INFO L437 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 18:39:59,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:59,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:59,657 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:39:59,659 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:39:59,660 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:59,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:59,675 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 18:39:59,675 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:59,675 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x2, n) = -1*x2 + 1*n Supporting invariants [1*x2 - 1 >= 0] [2025-04-26 18:39:59,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 18:39:59,686 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:39:59,710 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:59,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:39:59,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:39:59,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:59,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:59,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:59,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:59,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:59,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:59,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:59,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:59,772 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 18:39:59,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:59,791 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:39:59,792 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2025-04-26 18:39:59,792 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 28 transitions. cyclomatic complexity: 14 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 3 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:39:59,834 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 28 transitions. cyclomatic complexity: 14. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 38 states and 55 transitions. Complement of second has 7 states. [2025-04-26 18:39:59,834 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:39:59,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 3 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:39:59,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2025-04-26 18:39:59,835 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 18:39:59,835 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:59,835 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 18:39:59,835 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:59,835 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 6 letters. Loop has 4 letters. [2025-04-26 18:39:59,835 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:59,836 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 55 transitions. [2025-04-26 18:39:59,836 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:39:59,836 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 0 states and 0 transitions. [2025-04-26 18:39:59,836 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:39:59,836 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:39:59,836 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:39:59,837 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:39:59,837 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:39:59,837 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:39:59,837 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:39:59,837 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:39:59,837 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:39:59,837 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:39:59,837 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:39:59,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:59,847 INFO L201 PluginConnector]: Adding new model exp1x3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:39:59 BoogieIcfgContainer [2025-04-26 18:39:59,847 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:39:59,848 INFO L158 Benchmark]: Toolchain (without parser) took 2125.28ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 87.0MB in the beginning and 47.3MB in the end (delta: 39.7MB). Peak memory consumption was 29.1MB. Max. memory is 8.0GB. [2025-04-26 18:39:59,848 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.20ms. Allocated memory is still 155.2MB. Free memory is still 87.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:39:59,848 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.00ms. Allocated memory is still 155.2MB. Free memory was 87.0MB in the beginning and 85.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:39:59,848 INFO L158 Benchmark]: Boogie Preprocessor took 20.90ms. Allocated memory is still 155.2MB. Free memory was 85.0MB in the beginning and 84.2MB in the end (delta: 863.7kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:39:59,848 INFO L158 Benchmark]: RCFGBuilder took 162.26ms. Allocated memory is still 155.2MB. Free memory was 84.1MB in the beginning and 75.5MB in the end (delta: 8.6MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:39:59,849 INFO L158 Benchmark]: BuchiAutomizer took 1905.59ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 75.3MB in the beginning and 47.3MB in the end (delta: 28.1MB). Peak memory consumption was 20.7MB. Max. memory is 8.0GB. [2025-04-26 18:39:59,850 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.20ms. Allocated memory is still 155.2MB. Free memory is still 87.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.00ms. Allocated memory is still 155.2MB. Free memory was 87.0MB in the beginning and 85.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 20.90ms. Allocated memory is still 155.2MB. Free memory was 85.0MB in the beginning and 84.2MB in the end (delta: 863.7kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 162.26ms. Allocated memory is still 155.2MB. Free memory was 84.1MB in the beginning and 75.5MB in the end (delta: 8.6MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1905.59ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 75.3MB in the beginning and 47.3MB in the end (delta: 28.1MB). Peak memory consumption was 20.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.8s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 40 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 40 mSDsluCounter, 32 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 63 IncrementalHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 17 mSDtfsCounter, 63 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital29 mio100 ax100 hnf100 lsp80 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq156 hnf93 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 94ms VariablesStem: 2 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 3 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 136, Number of transitions in reduction automaton: 45, Number of states in reduction automaton: 31, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x1 + n and consists of 6 locations. One deterministic module has affine ranking function n + -1 * x2 and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:39:59,860 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...