/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/test/hard1.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:56:22,690 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:56:22,742 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:56:22,745 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:56:22,745 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:56:22,746 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:56:22,746 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:56:22,761 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:56:22,761 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:56:22,761 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:56:22,761 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:56:22,762 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:56:22,762 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:56:22,762 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:56:22,762 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:56:22,762 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:56:22,762 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:56:22,762 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:56:22,762 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:56:22,762 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:56:22,762 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:56:22,762 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:56:22,762 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:56:22,762 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:56:22,762 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:56:22,762 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:56:22,762 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:56:22,763 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:56:22,763 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:56:22,763 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:56:22,763 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:56:22,763 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:56:22,763 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:56:22,763 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:56:22,763 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:56:22,763 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:56:22,763 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:56:22,763 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:56:22,763 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:56:22,763 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:56:22,763 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:56:22,763 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:56:22,764 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:56:22,971 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:56:22,978 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:56:22,979 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:56:22,980 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:56:22,984 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:56:22,985 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/test/hard1.wvr.bpl [2025-04-26 16:56:22,985 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/test/hard1.wvr.bpl' [2025-04-26 16:56:23,004 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:56:23,005 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:56:23,005 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:56:23,005 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:56:23,005 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:56:23,014 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "hard1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:23" (1/1) ... [2025-04-26 16:56:23,031 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "hard1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:23" (1/1) ... [2025-04-26 16:56:23,037 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:56:23,038 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:56:23,039 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:56:23,039 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:56:23,039 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:56:23,044 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "hard1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:23" (1/1) ... [2025-04-26 16:56:23,044 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "hard1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:23" (1/1) ... [2025-04-26 16:56:23,046 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "hard1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:23" (1/1) ... [2025-04-26 16:56:23,046 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "hard1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:23" (1/1) ... [2025-04-26 16:56:23,048 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "hard1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:23" (1/1) ... [2025-04-26 16:56:23,048 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "hard1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:23" (1/1) ... [2025-04-26 16:56:23,052 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "hard1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:23" (1/1) ... [2025-04-26 16:56:23,052 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "hard1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:23" (1/1) ... [2025-04-26 16:56:23,053 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "hard1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:23" (1/1) ... [2025-04-26 16:56:23,059 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:56:23,060 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:56:23,060 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:56:23,060 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:56:23,063 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "hard1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:23" (1/1) ... [2025-04-26 16:56:23,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:56:23,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:23,090 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:23,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 16:56:23,111 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:56:23,111 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:56:23,111 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:56:23,111 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:56:23,112 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:56:23,112 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:56:23,112 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:56:23,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:56:23,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:56:23,112 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:56:23,112 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:56:23,112 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:56:23,112 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 16:56:23,112 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 16:56:23,112 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 16:56:23,113 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:56:23,143 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:56:23,145 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:56:23,218 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:56:23,219 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:56:23,236 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:56:23,236 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:56:23,238 INFO L201 PluginConnector]: Adding new model hard1.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:56:23 BoogieIcfgContainer [2025-04-26 16:56:23,239 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:56:23,240 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:56:23,240 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:56:23,244 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:56:23,245 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:56:23,245 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "hard1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:23" (1/2) ... [2025-04-26 16:56:23,246 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@54c84c3d and model type hard1.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:56:23, skipping insertion in model container [2025-04-26 16:56:23,246 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:56:23,246 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "hard1.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:56:23" (2/2) ... [2025-04-26 16:56:23,247 INFO L376 chiAutomizerObserver]: Analyzing ICFG hard1.wvr.bpl [2025-04-26 16:56:23,307 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-26 16:56:23,350 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:56:23,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:56:23,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:23,353 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:23,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 16:56:23,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 37 transitions, 102 flow [2025-04-26 16:56:23,430 INFO L116 PetriNetUnfolderBase]: 4/29 cut-off events. [2025-04-26 16:56:23,431 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-26 16:56:23,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 29 events. 4/29 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 38 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2025-04-26 16:56:23,436 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 37 transitions, 102 flow [2025-04-26 16:56:23,441 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 29 transitions, 82 flow [2025-04-26 16:56:23,441 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 38 places, 29 transitions, 82 flow [2025-04-26 16:56:23,448 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:56:23,749 WARN L140 AmpleReduction]: Number of pruned transitions: 591 [2025-04-26 16:56:23,750 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:56:23,750 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 157 [2025-04-26 16:56:23,750 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:37 [2025-04-26 16:56:23,751 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:234 [2025-04-26 16:56:23,751 WARN L145 AmpleReduction]: Times succ was already a loop node:353 [2025-04-26 16:56:23,751 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:26 [2025-04-26 16:56:23,751 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:56:23,755 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 429 states, 427 states have (on average 2.468384074941452) internal successors, (in total 1054), 428 states have internal predecessors, (1054), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:23,763 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:56:23,763 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:56:23,763 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:56:23,763 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:56:23,764 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:56:23,764 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:56:23,764 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:56:23,764 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:56:23,768 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 429 states, 427 states have (on average 2.468384074941452) internal successors, (in total 1054), 428 states have internal predecessors, (1054), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:23,800 INFO L131 ngComponentsAnalysis]: Automaton has 102 accepting balls. 334 [2025-04-26 16:56:23,800 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:23,800 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:23,806 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:56:23,806 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:56:23,806 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:56:23,807 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 429 states, 427 states have (on average 2.468384074941452) internal successors, (in total 1054), 428 states have internal predecessors, (1054), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:23,819 INFO L131 ngComponentsAnalysis]: Automaton has 102 accepting balls. 334 [2025-04-26 16:56:23,819 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:23,824 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:23,825 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:56:23,825 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:56:23,829 INFO L752 eck$LassoCheckResult]: Stem: "[71] $Ultimate##0-->L63: Formula: (and (= v_n2_1 v_n1_11) (= v_p1_5 v_p2_1)) InVars {p1=v_p1_5, n2=v_n2_1, p2=v_p2_1, n1=v_n1_11} OutVars{p1=v_p1_5, n2=v_n2_1, p2=v_p2_1, n1=v_n1_11} AuxVars[] AssignedVars[]" "[96] L63-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:56:23,829 INFO L754 eck$LassoCheckResult]: Loop: "[79] L19-1-->L19: Formula: (< 0 v_n1_1) InVars {n1=v_n1_1} OutVars{n1=v_n1_1} AuxVars[] AssignedVars[]" "[81] L19-->L19-1: Formula: (let ((.cse0 (< 0 v_n1_13))) (and (= v_p1_7 (ite .cse0 (+ v_p1_8 v_m_5) v_p1_8)) (= v_n1_12 (ite .cse0 (+ (- 1) v_n1_13) v_n1_13)))) InVars {m=v_m_5, p1=v_p1_8, n1=v_n1_13} OutVars{m=v_m_5, p1=v_p1_7, n1=v_n1_12} AuxVars[] AssignedVars[p1, n1]" [2025-04-26 16:56:23,833 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:23,833 INFO L85 PathProgramCache]: Analyzing trace with hash 3258, now seen corresponding path program 1 times [2025-04-26 16:56:23,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:23,838 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81751606] [2025-04-26 16:56:23,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:23,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:23,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:23,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:23,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:23,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:23,890 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:23,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:23,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:23,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:23,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:23,906 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:23,909 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:23,909 INFO L85 PathProgramCache]: Analyzing trace with hash 3491, now seen corresponding path program 1 times [2025-04-26 16:56:23,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:23,909 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692447267] [2025-04-26 16:56:23,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:23,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:23,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:23,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:23,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:23,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:23,921 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:23,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:23,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:23,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:23,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:23,929 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:23,930 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:23,930 INFO L85 PathProgramCache]: Analyzing trace with hash 3133468, now seen corresponding path program 1 times [2025-04-26 16:56:23,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:23,930 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239321713] [2025-04-26 16:56:23,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:23,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:23,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:23,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:23,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:23,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:23,941 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:23,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:23,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:23,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:23,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:23,949 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:24,024 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:24,024 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:24,025 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:24,025 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:24,025 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:56:24,025 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:24,025 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:24,025 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:24,025 INFO L132 ssoRankerPreferences]: Filename of dumped script: hard1.wvr.bpl_petrified1_Iteration1_Loop [2025-04-26 16:56:24,025 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:24,025 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:24,047 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:24,073 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:24,137 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:24,138 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:56:24,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:24,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:24,141 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:24,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:56:24,144 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:24,144 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:24,163 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 16:56:24,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:24,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:24,165 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:24,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:56:24,168 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:56:24,168 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:24,191 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:56:24,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:24,195 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:24,195 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:24,195 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:24,196 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:24,196 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:24,196 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:24,196 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:24,196 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:24,196 INFO L132 ssoRankerPreferences]: Filename of dumped script: hard1.wvr.bpl_petrified1_Iteration1_Loop [2025-04-26 16:56:24,196 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:24,196 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:24,197 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:24,210 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:24,237 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:24,239 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:24,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:24,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:24,243 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:24,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:56:24,249 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:24,259 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:24,260 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:56:24,260 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:24,260 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:24,260 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:24,265 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:56:24,265 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:56:24,269 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:24,274 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:56:24,274 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:56:24,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:24,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:24,279 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:24,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:56:24,281 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:24,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:24,285 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:56:24,285 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:24,286 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(n1) = 1*n1 Supporting invariants [] [2025-04-26 16:56:24,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:24,293 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:24,310 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:24,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:24,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:24,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:24,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:24,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:24,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:24,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:24,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:24,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:24,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:24,333 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:24,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:24,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:24,362 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:56:24,364 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 429 states, 427 states have (on average 2.468384074941452) internal successors, (in total 1054), 428 states have internal predecessors, (1054), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:24,488 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 429 states, 427 states have (on average 2.468384074941452) internal successors, (in total 1054), 428 states have internal predecessors, (1054), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 1510 states and 3807 transitions. Complement of second has 7 states. [2025-04-26 16:56:24,489 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:56:24,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:24,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2025-04-26 16:56:24,495 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 88 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 16:56:24,496 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:24,496 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 88 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:56:24,496 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:24,496 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 88 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 16:56:24,496 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:24,497 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1510 states and 3807 transitions. [2025-04-26 16:56:24,513 INFO L131 ngComponentsAnalysis]: Automaton has 79 accepting balls. 273 [2025-04-26 16:56:24,530 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1510 states to 815 states and 2103 transitions. [2025-04-26 16:56:24,531 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 420 [2025-04-26 16:56:24,532 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 551 [2025-04-26 16:56:24,533 INFO L74 IsDeterministic]: Start isDeterministic. Operand 815 states and 2103 transitions. [2025-04-26 16:56:24,533 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:24,533 INFO L218 hiAutomatonCegarLoop]: Abstraction has 815 states and 2103 transitions. [2025-04-26 16:56:24,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states and 2103 transitions. [2025-04-26 16:56:24,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 643. [2025-04-26 16:56:24,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 643 states have (on average 2.650077760497667) internal successors, (in total 1704), 642 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:24,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 1704 transitions. [2025-04-26 16:56:24,589 INFO L240 hiAutomatonCegarLoop]: Abstraction has 643 states and 1704 transitions. [2025-04-26 16:56:24,589 INFO L438 stractBuchiCegarLoop]: Abstraction has 643 states and 1704 transitions. [2025-04-26 16:56:24,589 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:56:24,589 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 643 states and 1704 transitions. [2025-04-26 16:56:24,593 INFO L131 ngComponentsAnalysis]: Automaton has 79 accepting balls. 273 [2025-04-26 16:56:24,593 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:24,593 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:24,593 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:56:24,593 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:56:24,594 INFO L752 eck$LassoCheckResult]: Stem: "[71] $Ultimate##0-->L63: Formula: (and (= v_n2_1 v_n1_11) (= v_p1_5 v_p2_1)) InVars {p1=v_p1_5, n2=v_n2_1, p2=v_p2_1, n1=v_n1_11} OutVars{p1=v_p1_5, n2=v_n2_1, p2=v_p2_1, n1=v_n1_11} AuxVars[] AssignedVars[]" "[96] L63-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[99] L63-1-->L30-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-04-26 16:56:24,594 INFO L754 eck$LassoCheckResult]: Loop: "[83] L30-1-->L30: Formula: (< 1 v_n1_6) InVars {n1=v_n1_6} OutVars{n1=v_n1_6} AuxVars[] AssignedVars[]" "[85] L30-->L30-1: Formula: (let ((.cse0 (< 1 v_n1_17))) (and (= v_n1_16 (ite .cse0 (+ (- 2) v_n1_17) v_n1_17)) (= (ite .cse0 (+ v_p1_12 (* 2 v_m_7)) v_p1_12) v_p1_11))) InVars {m=v_m_7, p1=v_p1_12, n1=v_n1_17} OutVars{m=v_m_7, p1=v_p1_11, n1=v_n1_16} AuxVars[] AssignedVars[p1, n1]" [2025-04-26 16:56:24,595 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:24,595 INFO L85 PathProgramCache]: Analyzing trace with hash 101097, now seen corresponding path program 1 times [2025-04-26 16:56:24,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:24,595 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401702027] [2025-04-26 16:56:24,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:24,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:24,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:24,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:24,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:24,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:24,600 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:24,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:24,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:24,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:24,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:24,606 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:24,606 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:24,607 INFO L85 PathProgramCache]: Analyzing trace with hash 3619, now seen corresponding path program 1 times [2025-04-26 16:56:24,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:24,607 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705391741] [2025-04-26 16:56:24,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:24,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:24,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:24,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:24,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:24,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:24,613 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:24,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:24,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:24,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:24,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:24,619 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:24,619 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:24,619 INFO L85 PathProgramCache]: Analyzing trace with hash 97156875, now seen corresponding path program 1 times [2025-04-26 16:56:24,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:24,619 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615536375] [2025-04-26 16:56:24,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:24,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:24,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:24,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:24,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:24,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:24,626 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:24,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:24,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:24,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:24,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:24,630 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:24,656 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:24,656 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:24,656 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:24,656 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:24,656 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:56:24,656 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:24,656 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:24,656 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:24,656 INFO L132 ssoRankerPreferences]: Filename of dumped script: hard1.wvr.bpl_petrified1_Iteration2_Loop [2025-04-26 16:56:24,656 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:24,656 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:24,657 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:24,660 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:24,687 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:24,687 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:56:24,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:24,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:24,690 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:24,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:56:24,692 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:24,692 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:24,704 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:56:24,704 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {m=0, p1=0} Honda state: {m=0, p1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:56:24,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:24,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:24,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:24,712 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:24,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:56:24,715 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:24,715 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:24,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:24,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:24,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:24,736 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:24,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:56:24,739 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:56:24,739 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:24,768 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:56:24,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:24,772 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:24,772 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:24,772 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:24,772 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:24,773 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:24,773 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:24,773 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:24,773 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:24,773 INFO L132 ssoRankerPreferences]: Filename of dumped script: hard1.wvr.bpl_petrified1_Iteration2_Loop [2025-04-26 16:56:24,773 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:24,773 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:24,774 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:24,778 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:24,804 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:24,804 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:24,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:24,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:24,806 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:24,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:56:24,808 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:24,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:24,818 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:56:24,818 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:24,818 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:24,818 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:24,818 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:56:24,818 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:56:24,820 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:24,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 16:56:24,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:24,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:24,828 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:24,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:56:24,831 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:24,841 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:24,841 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:56:24,841 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:24,841 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:24,841 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:24,844 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:56:24,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:56:24,846 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:24,848 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:56:24,848 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:56:24,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:24,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:24,850 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:24,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:56:24,852 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:24,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 16:56:24,854 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:56:24,855 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:24,855 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(n1) = 1*n1 Supporting invariants [] [2025-04-26 16:56:24,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:24,861 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:24,877 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:24,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:24,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:24,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:24,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:24,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:24,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:24,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:24,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:24,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:24,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:24,894 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:24,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:24,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:24,904 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:56:24,905 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 643 states and 1704 transitions. cyclomatic complexity: 1168 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:24,975 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 643 states and 1704 transitions. cyclomatic complexity: 1168. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 1913 states and 5254 transitions. Complement of second has 6 states. [2025-04-26 16:56:24,976 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:56:24,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:24,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2025-04-26 16:56:24,976 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 61 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 16:56:24,977 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:24,977 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 61 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:56:24,977 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:24,977 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 61 transitions. Stem has 3 letters. Loop has 4 letters. [2025-04-26 16:56:24,977 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:24,977 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1913 states and 5254 transitions. [2025-04-26 16:56:25,004 INFO L131 ngComponentsAnalysis]: Automaton has 59 accepting balls. 120 [2025-04-26 16:56:25,015 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1913 states to 1218 states and 3364 transitions. [2025-04-26 16:56:25,015 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 398 [2025-04-26 16:56:25,017 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 532 [2025-04-26 16:56:25,017 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1218 states and 3364 transitions. [2025-04-26 16:56:25,017 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:25,017 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1218 states and 3364 transitions. [2025-04-26 16:56:25,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states and 3364 transitions. [2025-04-26 16:56:25,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 1083. [2025-04-26 16:56:25,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 1083 states have (on average 2.8337950138504153) internal successors, (in total 3069), 1082 states have internal predecessors, (3069), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:25,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 3069 transitions. [2025-04-26 16:56:25,041 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1083 states and 3069 transitions. [2025-04-26 16:56:25,041 INFO L438 stractBuchiCegarLoop]: Abstraction has 1083 states and 3069 transitions. [2025-04-26 16:56:25,041 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:56:25,041 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1083 states and 3069 transitions. [2025-04-26 16:56:25,045 INFO L131 ngComponentsAnalysis]: Automaton has 59 accepting balls. 120 [2025-04-26 16:56:25,046 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:25,046 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:25,046 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:56:25,046 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:56:25,046 INFO L752 eck$LassoCheckResult]: Stem: "[71] $Ultimate##0-->L63: Formula: (and (= v_n2_1 v_n1_11) (= v_p1_5 v_p2_1)) InVars {p1=v_p1_5, n2=v_n2_1, p2=v_p2_1, n1=v_n1_11} OutVars{p1=v_p1_5, n2=v_n2_1, p2=v_p2_1, n1=v_n1_11} AuxVars[] AssignedVars[]" "[96] L63-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[99] L63-1-->L30-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[82] L30-1-->thread2FINAL: Formula: (<= v_n1_10 1) InVars {n1=v_n1_10} OutVars{n1=v_n1_10} AuxVars[] AssignedVars[]" "[78] L19-1-->thread1FINAL: Formula: (<= v_n1_5 0) InVars {n1=v_n1_5} OutVars{n1=v_n1_5} AuxVars[] AssignedVars[]" "[80] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[84] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[102] L64-->L41-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-04-26 16:56:25,046 INFO L754 eck$LassoCheckResult]: Loop: "[87] L41-1-->L41: Formula: (< 0 v_n2_6) InVars {n2=v_n2_6} OutVars{n2=v_n2_6} AuxVars[] AssignedVars[]" "[89] L41-->L41-1: Formula: (let ((.cse0 (< 0 v_n2_13))) (and (= v_n2_12 (ite .cse0 (+ (- 1) v_n2_13) v_n2_13)) (= (ite .cse0 (+ v_p2_8 v_m_9) v_p2_8) v_p2_7))) InVars {m=v_m_9, n2=v_n2_13, p2=v_p2_8} OutVars{m=v_m_9, n2=v_n2_12, p2=v_p2_7} AuxVars[] AssignedVars[n2, p2]" [2025-04-26 16:56:25,047 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:25,047 INFO L85 PathProgramCache]: Analyzing trace with hash -408546851, now seen corresponding path program 1 times [2025-04-26 16:56:25,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:25,047 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62701916] [2025-04-26 16:56:25,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:25,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:25,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:56:25,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:56:25,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:25,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:25,050 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:25,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:56:25,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:56:25,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:25,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:25,053 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:25,053 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:25,054 INFO L85 PathProgramCache]: Analyzing trace with hash 3747, now seen corresponding path program 1 times [2025-04-26 16:56:25,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:25,054 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147610458] [2025-04-26 16:56:25,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:25,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:25,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:25,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:25,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:25,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:25,057 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:25,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:25,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:25,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:25,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:25,063 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:25,063 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:25,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1771497089, now seen corresponding path program 1 times [2025-04-26 16:56:25,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:25,063 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028853072] [2025-04-26 16:56:25,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:25,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:25,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:56:25,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:56:25,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:25,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:25,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:25,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:56:25,140 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028853072] [2025-04-26 16:56:25,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028853072] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:56:25,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:56:25,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:56:25,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439748581] [2025-04-26 16:56:25,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:56:25,165 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:25,166 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:25,166 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:25,166 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:25,166 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:56:25,166 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:25,166 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:25,166 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:25,166 INFO L132 ssoRankerPreferences]: Filename of dumped script: hard1.wvr.bpl_petrified1_Iteration3_Loop [2025-04-26 16:56:25,166 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:25,166 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:25,166 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:25,172 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:25,194 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:25,194 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:56:25,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:25,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:25,196 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:25,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:56:25,199 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:25,199 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:25,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:25,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:25,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:25,218 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:25,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 16:56:25,221 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:56:25,221 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:25,244 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:56:25,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:25,248 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:25,249 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:25,249 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:25,249 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:25,249 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:25,249 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:25,249 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:25,249 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:25,249 INFO L132 ssoRankerPreferences]: Filename of dumped script: hard1.wvr.bpl_petrified1_Iteration3_Loop [2025-04-26 16:56:25,249 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:25,249 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:25,250 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:25,257 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:25,281 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:25,281 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:25,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:25,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:25,284 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:25,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 16:56:25,288 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:25,298 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:25,298 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:56:25,298 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:25,298 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:25,298 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:25,299 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:56:25,299 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:56:25,301 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:25,302 INFO L436 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-04-26 16:56:25,302 INFO L437 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:56:25,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:25,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:25,305 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:25,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 16:56:25,307 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:25,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:25,311 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:56:25,311 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:25,311 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(n2) = 1*n2 Supporting invariants [] [2025-04-26 16:56:25,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:25,317 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:25,328 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:25,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:56:25,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:56:25,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:25,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:25,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:25,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:25,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:25,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:25,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:25,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:25,349 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:25,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:25,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:25,360 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:56:25,361 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1083 states and 3069 transitions. cyclomatic complexity: 2131 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:25,467 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1083 states and 3069 transitions. cyclomatic complexity: 2131. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 3774 states and 10433 transitions. Complement of second has 7 states. [2025-04-26 16:56:25,468 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:56:25,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:25,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2025-04-26 16:56:25,469 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 83 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 16:56:25,469 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:25,469 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 83 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 16:56:25,469 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:25,470 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 83 transitions. Stem has 8 letters. Loop has 4 letters. [2025-04-26 16:56:25,470 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:25,470 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3774 states and 10433 transitions. [2025-04-26 16:56:25,515 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 63 [2025-04-26 16:56:25,530 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3774 states to 1943 states and 5788 transitions. [2025-04-26 16:56:25,530 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 558 [2025-04-26 16:56:25,531 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 593 [2025-04-26 16:56:25,531 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1943 states and 5788 transitions. [2025-04-26 16:56:25,531 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:25,531 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1943 states and 5788 transitions. [2025-04-26 16:56:25,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1943 states and 5788 transitions. [2025-04-26 16:56:25,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1943 to 1732. [2025-04-26 16:56:25,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1732 states, 1732 states have (on average 2.9601616628175518) internal successors, (in total 5127), 1731 states have internal predecessors, (5127), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:25,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1732 states to 1732 states and 5127 transitions. [2025-04-26 16:56:25,568 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1732 states and 5127 transitions. [2025-04-26 16:56:25,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:56:25,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:56:25,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:56:25,570 INFO L87 Difference]: Start difference. First operand 1732 states and 5127 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (in total 10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:25,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:56:25,649 INFO L93 Difference]: Finished difference Result 1911 states and 5275 transitions. [2025-04-26 16:56:25,649 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1911 states and 5275 transitions. [2025-04-26 16:56:25,661 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-04-26 16:56:25,670 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1911 states to 1462 states and 4355 transitions. [2025-04-26 16:56:25,670 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 376 [2025-04-26 16:56:25,671 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 376 [2025-04-26 16:56:25,671 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1462 states and 4355 transitions. [2025-04-26 16:56:25,671 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:25,671 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1462 states and 4355 transitions. [2025-04-26 16:56:25,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states and 4355 transitions. [2025-04-26 16:56:25,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 1305. [2025-04-26 16:56:25,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1305 states, 1305 states have (on average 3.010727969348659) internal successors, (in total 3929), 1304 states have internal predecessors, (3929), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:25,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1305 states to 1305 states and 3929 transitions. [2025-04-26 16:56:25,695 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1305 states and 3929 transitions. [2025-04-26 16:56:25,695 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 16:56:25,696 INFO L438 stractBuchiCegarLoop]: Abstraction has 1305 states and 3929 transitions. [2025-04-26 16:56:25,696 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:56:25,696 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1305 states and 3929 transitions. [2025-04-26 16:56:25,712 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-04-26 16:56:25,713 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:25,713 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:25,713 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:56:25,713 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:56:25,714 INFO L752 eck$LassoCheckResult]: Stem: "[71] $Ultimate##0-->L63: Formula: (and (= v_n2_1 v_n1_11) (= v_p1_5 v_p2_1)) InVars {p1=v_p1_5, n2=v_n2_1, p2=v_p2_1, n1=v_n1_11} OutVars{p1=v_p1_5, n2=v_n2_1, p2=v_p2_1, n1=v_n1_11} AuxVars[] AssignedVars[]" "[96] L63-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[99] L63-1-->L30-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[82] L30-1-->thread2FINAL: Formula: (<= v_n1_10 1) InVars {n1=v_n1_10} OutVars{n1=v_n1_10} AuxVars[] AssignedVars[]" "[79] L19-1-->L19: Formula: (< 0 v_n1_1) InVars {n1=v_n1_1} OutVars{n1=v_n1_1} AuxVars[] AssignedVars[]" "[81] L19-->L19-1: Formula: (let ((.cse0 (< 0 v_n1_13))) (and (= v_p1_7 (ite .cse0 (+ v_p1_8 v_m_5) v_p1_8)) (= v_n1_12 (ite .cse0 (+ (- 1) v_n1_13) v_n1_13)))) InVars {m=v_m_5, p1=v_p1_8, n1=v_n1_13} OutVars{m=v_m_5, p1=v_p1_7, n1=v_n1_12} AuxVars[] AssignedVars[p1, n1]" "[78] L19-1-->thread1FINAL: Formula: (<= v_n1_5 0) InVars {n1=v_n1_5} OutVars{n1=v_n1_5} AuxVars[] AssignedVars[]" "[80] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[84] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[102] L64-->L41-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[105] L65-->L52-1: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" "[106] thread1EXIT-->L67: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_4 1) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[]" "[107] thread2EXIT-->L68: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar0_4) (= 2 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[]" [2025-04-26 16:56:25,714 INFO L754 eck$LassoCheckResult]: Loop: "[91] L52-1-->L52: Formula: (< 1 v_n2_7) InVars {n2=v_n2_7} OutVars{n2=v_n2_7} AuxVars[] AssignedVars[]" "[93] L52-->L52-1: Formula: (let ((.cse0 (< 1 v_n2_17))) (and (= v_n2_16 (ite .cse0 (+ (- 2) v_n2_17) v_n2_17)) (= v_p2_11 (ite .cse0 (+ (* v_m_11 2) v_p2_12) v_p2_12)))) InVars {m=v_m_11, n2=v_n2_17, p2=v_p2_12} OutVars{m=v_m_11, n2=v_n2_16, p2=v_p2_11} AuxVars[] AssignedVars[n2, p2]" [2025-04-26 16:56:25,714 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:25,714 INFO L85 PathProgramCache]: Analyzing trace with hash 161535627, now seen corresponding path program 1 times [2025-04-26 16:56:25,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:25,714 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713117630] [2025-04-26 16:56:25,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:25,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:25,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:56:25,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:56:25,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:25,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:25,719 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:25,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:56:25,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:56:25,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:25,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:25,724 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:25,724 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:25,724 INFO L85 PathProgramCache]: Analyzing trace with hash 3875, now seen corresponding path program 1 times [2025-04-26 16:56:25,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:25,725 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343938768] [2025-04-26 16:56:25,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:25,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:25,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:25,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:25,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:25,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:25,728 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:25,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:25,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:25,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:25,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:25,731 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:25,731 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:25,731 INFO L85 PathProgramCache]: Analyzing trace with hash 616917805, now seen corresponding path program 1 times [2025-04-26 16:56:25,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:25,731 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445739619] [2025-04-26 16:56:25,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:25,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:25,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:56:25,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:56:25,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:25,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:25,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:25,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:56:25,792 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445739619] [2025-04-26 16:56:25,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445739619] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 16:56:25,792 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809547906] [2025-04-26 16:56:25,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:25,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 16:56:25,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:25,794 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-26 16:56:25,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-26 16:56:25,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:56:25,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:56:25,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:25,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:25,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-26 16:56:25,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:25,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-26 16:56:25,856 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-26 16:56:25,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809547906] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:56:25,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-26 16:56:25,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-04-26 16:56:25,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443877741] [2025-04-26 16:56:25,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:56:25,873 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:25,873 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:25,873 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:25,873 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:25,873 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:56:25,873 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:25,873 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:25,873 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:25,873 INFO L132 ssoRankerPreferences]: Filename of dumped script: hard1.wvr.bpl_petrified1_Iteration4_Loop [2025-04-26 16:56:25,873 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:25,873 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:25,874 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:25,877 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:25,897 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:25,897 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:56:25,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:25,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:25,900 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:25,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 16:56:25,902 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:25,902 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:25,915 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:56:25,915 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {m=0, p2=0} Honda state: {m=0, p2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:56:25,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 16:56:25,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:25,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:25,923 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:25,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 16:56:25,925 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:25,925 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:25,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-04-26 16:56:25,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:25,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:25,944 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:25,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 16:56:25,945 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:56:25,945 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:25,969 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:56:25,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-04-26 16:56:25,973 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:25,973 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:25,973 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:25,973 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:25,973 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:25,973 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:25,973 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:25,973 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:25,973 INFO L132 ssoRankerPreferences]: Filename of dumped script: hard1.wvr.bpl_petrified1_Iteration4_Loop [2025-04-26 16:56:25,973 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:25,973 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:25,974 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:25,976 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:25,999 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:25,999 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:25,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:26,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:26,007 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:26,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 16:56:26,011 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:26,021 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:26,021 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:56:26,021 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:26,021 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:26,022 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:26,023 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:56:26,023 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:56:26,024 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:26,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-04-26 16:56:26,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:26,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:26,031 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:26,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 16:56:26,033 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:26,043 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:26,043 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:56:26,043 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:26,043 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:26,043 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:26,044 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:56:26,044 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:56:26,047 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:26,050 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:56:26,050 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:56:26,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:26,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:26,052 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:26,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 16:56:26,053 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:26,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-04-26 16:56:26,056 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:56:26,056 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:26,056 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(n2) = 1*n2 Supporting invariants [] [2025-04-26 16:56:26,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:26,062 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:26,070 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:26,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:56:26,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:56:26,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:26,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:26,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:26,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:26,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:26,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:26,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:26,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:26,095 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:26,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:26,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:26,105 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:56:26,105 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1305 states and 3929 transitions. cyclomatic complexity: 2685 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:26,142 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1305 states and 3929 transitions. cyclomatic complexity: 2685. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 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 1344 states and 4021 transitions. Complement of second has 6 states. [2025-04-26 16:56:26,142 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:56:26,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:26,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2025-04-26 16:56:26,143 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 13 letters. Loop has 2 letters. [2025-04-26 16:56:26,143 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:26,143 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 15 letters. Loop has 2 letters. [2025-04-26 16:56:26,143 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:26,143 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 13 letters. Loop has 4 letters. [2025-04-26 16:56:26,143 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:26,143 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1344 states and 4021 transitions. [2025-04-26 16:56:26,152 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:56:26,152 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1344 states to 0 states and 0 transitions. [2025-04-26 16:56:26,152 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:56:26,152 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:56:26,152 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:56:26,152 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:56:26,152 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:26,152 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:26,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:56:26,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:56:26,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-26 16:56:26,153 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (in total 15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:26,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:56:26,153 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2025-04-26 16:56:26,153 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2025-04-26 16:56:26,153 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:56:26,153 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2025-04-26 16:56:26,153 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:56:26,153 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:56:26,153 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:56:26,153 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:56:26,153 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:26,153 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:26,153 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-26 16:56:26,154 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:26,154 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:56:26,154 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:56:26,154 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:56:26,154 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:56:26,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:26,167 INFO L201 PluginConnector]: Adding new model hard1.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:56:26 BoogieIcfgContainer [2025-04-26 16:56:26,167 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:56:26,168 INFO L158 Benchmark]: Toolchain (without parser) took 3163.09ms. Allocated memory was 155.2MB in the beginning and 125.8MB in the end (delta: -29.4MB). Free memory was 87.8MB in the beginning and 45.6MB in the end (delta: 42.2MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. [2025-04-26 16:56:26,168 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.20ms. Allocated memory is still 155.2MB. Free memory is still 88.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:26,168 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.07ms. Allocated memory is still 155.2MB. Free memory was 87.7MB in the beginning and 85.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:26,168 INFO L158 Benchmark]: Boogie Preprocessor took 20.34ms. Allocated memory is still 155.2MB. Free memory was 85.8MB in the beginning and 84.9MB in the end (delta: 924.8kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:26,169 INFO L158 Benchmark]: RCFGBuilder took 178.51ms. Allocated memory is still 155.2MB. Free memory was 84.7MB in the beginning and 74.2MB in the end (delta: 10.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:56:26,169 INFO L158 Benchmark]: BuchiAutomizer took 2927.53ms. Allocated memory was 155.2MB in the beginning and 125.8MB in the end (delta: -29.4MB). Free memory was 74.0MB in the beginning and 45.6MB in the end (delta: 28.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:26,171 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 88.7MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.07ms. Allocated memory is still 155.2MB. Free memory was 87.7MB in the beginning and 85.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 20.34ms. Allocated memory is still 155.2MB. Free memory was 85.8MB in the beginning and 84.9MB in the end (delta: 924.8kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 178.51ms. Allocated memory is still 155.2MB. Free memory was 84.7MB in the beginning and 74.2MB in the end (delta: 10.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 2927.53ms. Allocated memory was 155.2MB in the beginning and 125.8MB in the end (delta: -29.4MB). Free memory was 74.0MB in the beginning and 45.6MB in the end (delta: 28.4MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.8s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.3s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 675 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 182 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 178 mSDsluCounter, 149 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 77 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 268 IncrementalHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 72 mSDtfsCounter, 268 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT2 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital16 mio100 ax100 hnf100 lsp62 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf96 smp100 dnf100 smp100 tf112 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 45ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s InitialAbstractionConstructionTime: 0.4s InitialAbstraction: Time to compute Ample Reduction [ms]: 405, Number of transitions in reduction automaton: 1054, Number of states in reduction automaton: 429, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (2 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function n1 and consists of 5 locations. One deterministic module has affine ranking function n1 and consists of 4 locations. One deterministic module has affine ranking function n2 and consists of 5 locations. One deterministic module has affine ranking function n2 and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 4 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:56:26,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:26,387 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...