/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i /storage/cav23-termute-examples/4_plus_thr/m9.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:58:52,016 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:58:52,070 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:58:52,074 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:58:52,074 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:58:52,074 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:58:52,074 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:58:52,095 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:58:52,096 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:58:52,096 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:58:52,097 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:58:52,097 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:58:52,097 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:58:52,097 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:58:52,097 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:58:52,097 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:58:52,097 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:58:52,097 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:58:52,097 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:58:52,097 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:58:52,098 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:58:52,098 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:58:52,098 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:58:52,098 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:58:52,098 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:58:52,098 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:58:52,098 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:58:52,098 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:58:52,098 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:58:52,098 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:58:52,098 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:58:52,098 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:58:52,098 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:58:52,098 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:58:52,098 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:58:52,098 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:58:52,099 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:58:52,099 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:58:52,099 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:58:52,099 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:58:52,099 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:58:52,099 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:58:52,099 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:58:52,363 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:58:52,370 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:58:52,372 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:58:52,373 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:58:52,373 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:58:52,375 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/4_plus_thr/m9.c.bpl [2025-04-26 16:58:52,375 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/4_plus_thr/m9.c.bpl' [2025-04-26 16:58:52,388 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:58:52,390 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:58:52,391 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:58:52,391 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:58:52,391 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:58:52,398 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "m9.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:52" (1/1) ... [2025-04-26 16:58:52,416 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "m9.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:52" (1/1) ... [2025-04-26 16:58:52,420 INFO L138 Inliner]: procedures = 6, calls = 5, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:58:52,421 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:58:52,422 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:58:52,422 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:58:52,422 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:58:52,429 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "m9.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:52" (1/1) ... [2025-04-26 16:58:52,429 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "m9.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:52" (1/1) ... [2025-04-26 16:58:52,430 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "m9.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:52" (1/1) ... [2025-04-26 16:58:52,430 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "m9.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:52" (1/1) ... [2025-04-26 16:58:52,432 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "m9.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:52" (1/1) ... [2025-04-26 16:58:52,432 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "m9.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:52" (1/1) ... [2025-04-26 16:58:52,435 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "m9.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:52" (1/1) ... [2025-04-26 16:58:52,435 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "m9.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:52" (1/1) ... [2025-04-26 16:58:52,436 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "m9.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:52" (1/1) ... [2025-04-26 16:58:52,445 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:58:52,447 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:58:52,447 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:58:52,447 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:58:52,448 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "m9.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:52" (1/1) ... [2025-04-26 16:58:52,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:58:52,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:52,467 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:58:52,471 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:58:52,488 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:58:52,488 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:58:52,488 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:58:52,489 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:58:52,489 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:58:52,489 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:58:52,489 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:58:52,489 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:58:52,489 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:58:52,489 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:58:52,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:58:52,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:58:52,489 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 16:58:52,489 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 16:58:52,489 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 16:58:52,489 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2025-04-26 16:58:52,489 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-04-26 16:58:52,489 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-04-26 16:58:52,490 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:58:52,528 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:58:52,529 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:58:52,625 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:58:52,625 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:58:52,636 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:58:52,636 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:58:52,637 INFO L201 PluginConnector]: Adding new model m9.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:58:52 BoogieIcfgContainer [2025-04-26 16:58:52,637 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:58:52,638 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:58:52,638 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:58:52,644 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:58:52,644 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:58:52,644 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "m9.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:52" (1/2) ... [2025-04-26 16:58:52,645 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@19c11a91 and model type m9.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:58:52, skipping insertion in model container [2025-04-26 16:58:52,646 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:58:52,646 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "m9.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:58:52" (2/2) ... [2025-04-26 16:58:52,647 INFO L376 chiAutomizerObserver]: Analyzing ICFG m9.c.bpl [2025-04-26 16:58:52,703 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2025-04-26 16:58:52,733 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:58:52,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:58:52,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:52,736 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:58:52,738 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:58:52,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 44 transitions, 123 flow [2025-04-26 16:58:52,810 INFO L116 PetriNetUnfolderBase]: 5/34 cut-off events. [2025-04-26 16:58:52,811 INFO L117 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-04-26 16:58:52,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 34 events. 5/34 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 70 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2025-04-26 16:58:52,815 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 44 transitions, 123 flow [2025-04-26 16:58:52,821 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 34 transitions, 98 flow [2025-04-26 16:58:52,821 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 45 places, 34 transitions, 98 flow [2025-04-26 16:58:52,827 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:58:53,396 WARN L140 AmpleReduction]: Number of pruned transitions: 4721 [2025-04-26 16:58:53,397 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:58:53,397 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 1036 [2025-04-26 16:58:53,397 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:36 [2025-04-26 16:58:53,398 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:1361 [2025-04-26 16:58:53,398 WARN L145 AmpleReduction]: Times succ was already a loop node:2431 [2025-04-26 16:58:53,398 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:284 [2025-04-26 16:58:53,398 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:58:53,414 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 2434 states, 2433 states have (on average 2.979038224414303) internal successors, (in total 7248), 2433 states have internal predecessors, (7248), 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:58:53,422 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:58:53,422 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:58:53,422 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:58:53,422 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:58:53,422 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:58:53,422 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:58:53,422 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:58:53,422 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:58:53,429 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 2434 states, 2433 states have (on average 2.979038224414303) internal successors, (in total 7248), 2433 states have internal predecessors, (7248), 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:58:53,503 INFO L131 ngComponentsAnalysis]: Automaton has 515 accepting balls. 2090 [2025-04-26 16:58:53,503 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:53,503 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:53,508 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:58:53,508 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:58:53,508 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:58:53,514 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 2434 states, 2433 states have (on average 2.979038224414303) internal successors, (in total 7248), 2433 states have internal predecessors, (7248), 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:58:53,556 INFO L131 ngComponentsAnalysis]: Automaton has 515 accepting balls. 2090 [2025-04-26 16:58:53,556 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:53,556 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:53,556 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:58:53,557 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:58:53,561 INFO L752 eck$LassoCheckResult]: Stem: "[80] $Ultimate##0-->L14: Formula: (= v_f_1 0) InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[108] L14-->L29: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:58:53,561 INFO L754 eck$LassoCheckResult]: Loop: "[85] L29-->L31: Formula: (< v_x4_1 v_w_1) InVars {x4=v_x4_1, w=v_w_1} OutVars{x4=v_x4_1, w=v_w_1} AuxVars[] AssignedVars[]" "[87] L31-->L29: Formula: (= (+ v_x4_3 1) v_x4_2) InVars {x4=v_x4_3} OutVars{x4=v_x4_2} AuxVars[] AssignedVars[x4]" [2025-04-26 16:58:53,565 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:53,566 INFO L85 PathProgramCache]: Analyzing trace with hash 3549, now seen corresponding path program 1 times [2025-04-26 16:58:53,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:53,572 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48288815] [2025-04-26 16:58:53,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:53,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:53,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:53,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:53,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:53,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:53,621 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:53,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:53,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:53,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:53,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:53,640 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:53,643 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:53,643 INFO L85 PathProgramCache]: Analyzing trace with hash 3683, now seen corresponding path program 1 times [2025-04-26 16:58:53,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:53,643 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31086950] [2025-04-26 16:58:53,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:53,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:53,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:53,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:53,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:53,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:53,678 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:53,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:53,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:53,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:53,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:53,685 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:53,687 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:53,687 INFO L85 PathProgramCache]: Analyzing trace with hash 3413311, now seen corresponding path program 1 times [2025-04-26 16:58:53,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:53,687 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63509201] [2025-04-26 16:58:53,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:53,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:53,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:58:53,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:58:53,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:53,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:53,694 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:53,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:58:53,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:58:53,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:53,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:53,702 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:53,776 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:53,778 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:53,778 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:53,778 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:53,779 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:58:53,779 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:53,779 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:53,779 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:53,779 INFO L132 ssoRankerPreferences]: Filename of dumped script: m9.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:58:53,779 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:53,780 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:53,793 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:53,858 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:53,858 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:58:53,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:53,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:53,862 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:58:53,863 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:58:53,865 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:53,865 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:53,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:58:53,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:53,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:53,891 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:58:53,893 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:58:53,895 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:53,895 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:53,963 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:58:53,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 16:58:53,968 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:53,968 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:53,968 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:53,968 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:53,968 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:58:53,968 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:53,970 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:53,970 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:53,970 INFO L132 ssoRankerPreferences]: Filename of dumped script: m9.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:58:53,971 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:53,971 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:53,971 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:53,996 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:53,999 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:58:54,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:54,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:54,003 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:58:54,004 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:58:54,006 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:58:54,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:54,017 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:54,017 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:54,017 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:54,017 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:54,021 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:54,021 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:54,023 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:58:54,028 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:58:54,028 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:58:54,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:54,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:54,031 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:58:54,033 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:58:54,034 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:58:54,038 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:58:54,038 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:58:54,038 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:58:54,039 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(w, x4) = 1*w - 1*x4 Supporting invariants [] [2025-04-26 16:58:54,044 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:58:54,047 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:58:54,066 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:54,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:54,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:54,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:54,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:54,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:58:54,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:54,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:54,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:54,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:54,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:54,091 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:58:54,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:54,110 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:58:54,128 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:58:54,133 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 2434 states, 2433 states have (on average 2.979038224414303) internal successors, (in total 7248), 2433 states have internal predecessors, (7248), 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:58:54,334 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 2434 states, 2433 states have (on average 2.979038224414303) internal successors, (in total 7248), 2433 states have internal predecessors, (7248), 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 5922 states and 17769 transitions. Complement of second has 6 states. [2025-04-26 16:58:54,335 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:58:54,338 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:58:54,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2025-04-26 16:58:54,341 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 79 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 16:58:54,341 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:54,341 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 79 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:58:54,342 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:54,342 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 79 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 16:58:54,342 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:54,342 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5922 states and 17769 transitions. [2025-04-26 16:58:54,406 INFO L131 ngComponentsAnalysis]: Automaton has 340 accepting balls. 1152 [2025-04-26 16:58:54,452 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5922 states to 3302 states and 9827 transitions. [2025-04-26 16:58:54,453 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1419 [2025-04-26 16:58:54,466 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2130 [2025-04-26 16:58:54,467 INFO L74 IsDeterministic]: Start isDeterministic. Operand 3302 states and 9827 transitions. [2025-04-26 16:58:54,467 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:58:54,467 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3302 states and 9827 transitions. [2025-04-26 16:58:54,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3302 states and 9827 transitions. [2025-04-26 16:58:54,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3302 to 2809. [2025-04-26 16:58:54,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2809 states, 2809 states have (on average 3.0167319330722675) internal successors, (in total 8474), 2808 states have internal predecessors, (8474), 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:58:54,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2809 states to 2809 states and 8474 transitions. [2025-04-26 16:58:54,643 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2809 states and 8474 transitions. [2025-04-26 16:58:54,643 INFO L438 stractBuchiCegarLoop]: Abstraction has 2809 states and 8474 transitions. [2025-04-26 16:58:54,643 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:58:54,643 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2809 states and 8474 transitions. [2025-04-26 16:58:54,657 INFO L131 ngComponentsAnalysis]: Automaton has 340 accepting balls. 1152 [2025-04-26 16:58:54,657 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:54,657 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:54,658 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:58:54,658 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:58:54,659 INFO L752 eck$LassoCheckResult]: Stem: "[80] $Ultimate##0-->L14: Formula: (= v_f_1 0) InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[108] L14-->L29: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[84] L29-->thread1FINAL: Formula: (<= v_w_2 v_x4_4) InVars {x4=v_x4_4, w=v_w_2} OutVars{x4=v_x4_4, w=v_w_2} AuxVars[] AssignedVars[]" "[86] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[111] L14-1-->L38: 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:58:54,659 INFO L754 eck$LassoCheckResult]: Loop: "[89] L38-->L40: Formula: (< v_x2_1 v_w_3) InVars {x2=v_x2_1, w=v_w_3} OutVars{x2=v_x2_1, w=v_w_3} AuxVars[] AssignedVars[]" "[91] L40-->L38: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-04-26 16:58:54,659 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:54,659 INFO L85 PathProgramCache]: Analyzing trace with hash 105811760, now seen corresponding path program 1 times [2025-04-26 16:58:54,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:54,659 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476640159] [2025-04-26 16:58:54,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:54,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:54,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:58:54,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:58:54,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:54,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:54,666 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:54,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:58:54,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:58:54,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:54,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:54,671 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:54,671 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:54,671 INFO L85 PathProgramCache]: Analyzing trace with hash 3811, now seen corresponding path program 1 times [2025-04-26 16:58:54,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:54,672 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564820604] [2025-04-26 16:58:54,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:54,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:54,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:54,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:54,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:54,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:54,676 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:54,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:54,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:54,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:54,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:54,680 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:54,680 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:54,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1394110894, now seen corresponding path program 1 times [2025-04-26 16:58:54,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:54,680 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248013304] [2025-04-26 16:58:54,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:54,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:54,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:58:54,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:58:54,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:54,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:54,686 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:54,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:58:54,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:58:54,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:54,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:54,693 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:54,708 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:54,709 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:54,709 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:54,709 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:54,709 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:58:54,709 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:54,709 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:54,709 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:54,709 INFO L132 ssoRankerPreferences]: Filename of dumped script: m9.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:58:54,709 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:54,709 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:54,709 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:54,739 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:54,739 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:58:54,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:54,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:54,741 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:58:54,742 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:58:54,743 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:54,743 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:54,759 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 16:58:54,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:54,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:54,761 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:58:54,762 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:58:54,763 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:54,764 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:54,827 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:58:54,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 16:58:54,831 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:54,832 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:54,832 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:54,832 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:54,832 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:58:54,832 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:54,832 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:54,832 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:54,832 INFO L132 ssoRankerPreferences]: Filename of dumped script: m9.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:58:54,832 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:54,832 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:54,835 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:54,857 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:54,857 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:58:54,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:54,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:54,859 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:58:54,859 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:58:54,860 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:58:54,870 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:54,870 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:54,870 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:54,870 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:54,870 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:54,871 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:54,871 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:54,873 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:58:54,876 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:58:54,876 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:58:54,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:54,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:54,878 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:58:54,880 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:58:54,882 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:58:54,885 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:58:54,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:54,886 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:58:54,886 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:58:54,886 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x2, w) = -1*x2 + 1*w Supporting invariants [] [2025-04-26 16:58:54,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 16:58:54,893 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:58:54,907 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:54,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:58:54,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:58:54,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:54,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:54,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:58:54,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:54,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:54,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:54,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:54,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:54,927 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:58:54,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:54,941 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:58:54,942 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:58:54,942 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2809 states and 8474 transitions. cyclomatic complexity: 6156 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:55,109 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2809 states and 8474 transitions. cyclomatic complexity: 6156. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 7435 states and 22470 transitions. Complement of second has 6 states. [2025-04-26 16:58:55,109 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:58:55,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:55,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2025-04-26 16:58:55,110 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:58:55,110 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:55,110 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 16:58:55,110 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:55,110 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 16:58:55,111 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:55,111 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7435 states and 22470 transitions. [2025-04-26 16:58:55,169 INFO L131 ngComponentsAnalysis]: Automaton has 182 accepting balls. 500 [2025-04-26 16:58:55,208 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7435 states to 4456 states and 13179 transitions. [2025-04-26 16:58:55,208 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1529 [2025-04-26 16:58:55,214 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2083 [2025-04-26 16:58:55,214 INFO L74 IsDeterministic]: Start isDeterministic. Operand 4456 states and 13179 transitions. [2025-04-26 16:58:55,215 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:58:55,215 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4456 states and 13179 transitions. [2025-04-26 16:58:55,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4456 states and 13179 transitions. [2025-04-26 16:58:55,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4456 to 3912. [2025-04-26 16:58:55,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3912 states, 3912 states have (on average 3.01840490797546) internal successors, (in total 11808), 3911 states have internal predecessors, (11808), 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:58:55,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3912 states to 3912 states and 11808 transitions. [2025-04-26 16:58:55,347 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3912 states and 11808 transitions. [2025-04-26 16:58:55,347 INFO L438 stractBuchiCegarLoop]: Abstraction has 3912 states and 11808 transitions. [2025-04-26 16:58:55,348 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:58:55,348 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3912 states and 11808 transitions. [2025-04-26 16:58:55,372 INFO L131 ngComponentsAnalysis]: Automaton has 182 accepting balls. 500 [2025-04-26 16:58:55,372 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:55,372 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:55,373 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:58:55,373 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:58:55,373 INFO L752 eck$LassoCheckResult]: Stem: "[80] $Ultimate##0-->L14: Formula: (= v_f_1 0) InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[108] L14-->L29: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[84] L29-->thread1FINAL: Formula: (<= v_w_2 v_x4_4) InVars {x4=v_x4_4, w=v_w_2} OutVars{x4=v_x4_4, w=v_w_2} AuxVars[] AssignedVars[]" "[86] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[111] L14-1-->L38: 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]" "[88] L38-->thread2FINAL: Formula: (<= v_w_4 v_x2_4) InVars {x2=v_x2_4, w=v_w_4} OutVars{x2=v_x2_4, w=v_w_4} AuxVars[] AssignedVars[]" "[90] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[114] L15-->L47: 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:58:55,373 INFO L754 eck$LassoCheckResult]: Loop: "[93] L47-->L49: Formula: (< v_x3_1 v_w_5) InVars {w=v_w_5, x3=v_x3_1} OutVars{w=v_w_5, x3=v_x3_1} AuxVars[] AssignedVars[]" "[95] L49-->L47: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" [2025-04-26 16:58:55,374 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:55,374 INFO L85 PathProgramCache]: Analyzing trace with hash -267765632, now seen corresponding path program 1 times [2025-04-26 16:58:55,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:55,374 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913819038] [2025-04-26 16:58:55,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:55,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:55,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:58:55,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:58:55,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:55,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:55,378 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:55,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:58:55,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:58:55,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:55,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:55,382 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:55,382 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:55,382 INFO L85 PathProgramCache]: Analyzing trace with hash 3939, now seen corresponding path program 1 times [2025-04-26 16:58:55,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:55,383 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684193110] [2025-04-26 16:58:55,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:55,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:55,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:55,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:55,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:55,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:55,385 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:55,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:55,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:55,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:55,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:55,387 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:55,388 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:55,388 INFO L85 PathProgramCache]: Analyzing trace with hash 375268386, now seen corresponding path program 1 times [2025-04-26 16:58:55,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:55,388 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907964517] [2025-04-26 16:58:55,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:55,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:55,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:58:55,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:58:55,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:55,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:55,393 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:55,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:58:55,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:58:55,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:55,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:55,400 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:55,414 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:55,415 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:55,415 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:55,415 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:55,415 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:58:55,415 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:55,415 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:55,415 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:55,415 INFO L132 ssoRankerPreferences]: Filename of dumped script: m9.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:58:55,415 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:55,415 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:55,416 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:55,436 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:55,436 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:58:55,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:55,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:55,438 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:58:55,440 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:58:55,441 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:55,441 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:55,458 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:58:55,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:55,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:55,460 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:58:55,461 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:58:55,463 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:55,463 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:55,530 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:58:55,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:55,535 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:55,535 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:55,535 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:55,535 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:55,535 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:58:55,536 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:55,536 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:55,536 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:55,536 INFO L132 ssoRankerPreferences]: Filename of dumped script: m9.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:58:55,536 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:55,536 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:55,536 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:55,554 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:55,554 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:58:55,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:55,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:55,556 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:58:55,558 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:58:55,559 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:58:55,569 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:55,570 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:55,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:55,570 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:55,570 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:55,571 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:55,571 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:55,573 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:58:55,577 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:58:55,577 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:58:55,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:55,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:55,579 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:58:55,581 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:58:55,582 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:58:55,585 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:58:55,585 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:58:55,586 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:58:55,586 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x3, w) = -1*x3 + 1*w Supporting invariants [] [2025-04-26 16:58:55,591 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:58:55,592 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:58:55,604 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:55,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:58:55,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:58:55,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:55,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:55,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:58:55,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:55,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:55,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:55,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:55,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:55,628 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:58:55,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:55,640 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:58:55,640 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:58:55,640 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3912 states and 11808 transitions. cyclomatic complexity: 8385 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:58:55,796 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3912 states and 11808 transitions. cyclomatic complexity: 8385. 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 10518 states and 31490 transitions. Complement of second has 6 states. [2025-04-26 16:58:55,797 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:58:55,797 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:58:55,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2025-04-26 16:58:55,797 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 86 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 16:58:55,797 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:55,797 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 86 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 16:58:55,798 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:55,798 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 86 transitions. Stem has 8 letters. Loop has 4 letters. [2025-04-26 16:58:55,798 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:55,798 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10518 states and 31490 transitions. [2025-04-26 16:58:55,942 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 130 [2025-04-26 16:58:55,985 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10518 states to 5789 states and 17000 transitions. [2025-04-26 16:58:55,985 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1633 [2025-04-26 16:58:55,989 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1926 [2025-04-26 16:58:55,990 INFO L74 IsDeterministic]: Start isDeterministic. Operand 5789 states and 17000 transitions. [2025-04-26 16:58:55,990 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:58:55,990 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5789 states and 17000 transitions. [2025-04-26 16:58:55,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5789 states and 17000 transitions. [2025-04-26 16:58:56,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5789 to 5425. [2025-04-26 16:58:56,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5425 states, 5425 states have (on average 2.927741935483871) internal successors, (in total 15883), 5424 states have internal predecessors, (15883), 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:58:56,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5425 states to 5425 states and 15883 transitions. [2025-04-26 16:58:56,112 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5425 states and 15883 transitions. [2025-04-26 16:58:56,112 INFO L438 stractBuchiCegarLoop]: Abstraction has 5425 states and 15883 transitions. [2025-04-26 16:58:56,112 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:58:56,112 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5425 states and 15883 transitions. [2025-04-26 16:58:56,131 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 130 [2025-04-26 16:58:56,131 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:56,131 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:56,132 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:58:56,132 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:58:56,132 INFO L752 eck$LassoCheckResult]: Stem: "[80] $Ultimate##0-->L14: Formula: (= v_f_1 0) InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[108] L14-->L29: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[84] L29-->thread1FINAL: Formula: (<= v_w_2 v_x4_4) InVars {x4=v_x4_4, w=v_w_2} OutVars{x4=v_x4_4, w=v_w_2} AuxVars[] AssignedVars[]" "[86] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[111] L14-1-->L38: 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]" "[88] L38-->thread2FINAL: Formula: (<= v_w_4 v_x2_4) InVars {x2=v_x2_4, w=v_w_4} OutVars{x2=v_x2_4, w=v_w_4} AuxVars[] AssignedVars[]" "[90] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[114] L15-->L47: 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]" "[92] L47-->thread3FINAL: Formula: (<= v_w_6 v_x3_4) InVars {w=v_w_6, x3=v_x3_4} OutVars{w=v_w_6, x3=v_x3_4} AuxVars[] AssignedVars[]" "[94] thread3FINAL-->thread3EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[117] L16-->L56: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" [2025-04-26 16:58:56,132 INFO L754 eck$LassoCheckResult]: Loop: "[97] L56-->L58: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[99] L58-->L56: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" [2025-04-26 16:58:56,132 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:56,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1251582797, now seen corresponding path program 1 times [2025-04-26 16:58:56,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:56,133 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141687602] [2025-04-26 16:58:56,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:56,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:56,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:58:56,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:58:56,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:56,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:56,137 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:56,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:58:56,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:58:56,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:56,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:56,142 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:56,143 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:56,143 INFO L85 PathProgramCache]: Analyzing trace with hash 4067, now seen corresponding path program 1 times [2025-04-26 16:58:56,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:56,143 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953080148] [2025-04-26 16:58:56,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:56,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:56,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:56,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:56,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:56,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:56,145 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:56,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:56,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:56,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:56,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:56,152 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:56,152 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:56,152 INFO L85 PathProgramCache]: Analyzing trace with hash -180221931, now seen corresponding path program 1 times [2025-04-26 16:58:56,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:56,153 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826205950] [2025-04-26 16:58:56,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:56,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:56,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:58:56,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:58:56,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:56,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:56,162 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:56,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:58:56,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:58:56,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:56,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:56,171 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:56,186 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:56,186 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:56,186 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:56,186 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:56,186 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:58:56,186 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:56,186 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:56,186 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:56,186 INFO L132 ssoRankerPreferences]: Filename of dumped script: m9.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:58:56,186 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:56,186 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:56,187 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:56,203 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:56,203 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:58:56,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:56,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:56,206 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:58:56,208 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:58:56,209 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:56,209 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:56,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 16:58:56,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:56,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:56,228 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:58:56,229 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:58:56,231 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:56,231 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:56,299 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:58:56,304 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:58:56,305 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:56,305 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:56,305 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:56,305 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:56,305 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:58:56,305 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:56,305 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:56,305 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:56,305 INFO L132 ssoRankerPreferences]: Filename of dumped script: m9.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:58:56,305 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:56,305 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:56,306 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:56,327 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:56,327 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:58:56,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:56,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:56,330 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:56,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 16:58:56,333 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:58:56,343 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:56,343 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:56,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:56,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:56,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:56,344 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:56,344 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:56,346 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:58:56,349 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:58:56,350 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:58:56,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:56,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:56,352 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:58:56,353 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:58:56,354 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:58:56,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:56,358 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:58:56,358 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:58:56,358 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x1) = 1*z - 1*x1 Supporting invariants [] [2025-04-26 16:58:56,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:56,365 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:58:56,376 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:56,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:58:56,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:58:56,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:56,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:56,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:58:56,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:56,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:56,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:56,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:56,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:56,401 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:58:56,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:56,413 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:58:56,413 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:58:56,414 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 5425 states and 15883 transitions. cyclomatic complexity: 10983 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:56,601 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 5425 states and 15883 transitions. cyclomatic complexity: 10983. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 16918 states and 48494 transitions. Complement of second has 7 states. [2025-04-26 16:58:56,602 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:58:56,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:56,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2025-04-26 16:58:56,603 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 84 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 16:58:56,603 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:56,603 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 84 transitions. Stem has 13 letters. Loop has 2 letters. [2025-04-26 16:58:56,603 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:56,603 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 84 transitions. Stem has 11 letters. Loop has 4 letters. [2025-04-26 16:58:56,603 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:56,603 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16918 states and 48494 transitions. [2025-04-26 16:58:56,795 INFO L131 ngComponentsAnalysis]: Automaton has 62 accepting balls. 126 [2025-04-26 16:58:56,869 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16918 states to 10895 states and 31524 transitions. [2025-04-26 16:58:56,869 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2967 [2025-04-26 16:58:56,876 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3013 [2025-04-26 16:58:56,876 INFO L74 IsDeterministic]: Start isDeterministic. Operand 10895 states and 31524 transitions. [2025-04-26 16:58:56,876 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:58:56,876 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10895 states and 31524 transitions. [2025-04-26 16:58:56,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10895 states and 31524 transitions. [2025-04-26 16:58:57,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10895 to 9238. [2025-04-26 16:58:57,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9238 states, 9238 states have (on average 2.8459623295085517) internal successors, (in total 26291), 9237 states have internal predecessors, (26291), 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:58:57,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9238 states to 9238 states and 26291 transitions. [2025-04-26 16:58:57,257 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9238 states and 26291 transitions. [2025-04-26 16:58:57,257 INFO L438 stractBuchiCegarLoop]: Abstraction has 9238 states and 26291 transitions. [2025-04-26 16:58:57,257 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:58:57,257 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9238 states and 26291 transitions. [2025-04-26 16:58:57,304 INFO L131 ngComponentsAnalysis]: Automaton has 62 accepting balls. 126 [2025-04-26 16:58:57,304 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:57,304 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:57,305 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:58:57,305 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:58:57,306 INFO L752 eck$LassoCheckResult]: Stem: "[80] $Ultimate##0-->L14: Formula: (= v_f_1 0) InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[108] L14-->L29: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[84] L29-->thread1FINAL: Formula: (<= v_w_2 v_x4_4) InVars {x4=v_x4_4, w=v_w_2} OutVars{x4=v_x4_4, w=v_w_2} AuxVars[] AssignedVars[]" "[86] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[111] L14-1-->L38: 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]" "[88] L38-->thread2FINAL: Formula: (<= v_w_4 v_x2_4) InVars {x2=v_x2_4, w=v_w_4} OutVars{x2=v_x2_4, w=v_w_4} AuxVars[] AssignedVars[]" "[90] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[114] L15-->L47: 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]" "[92] L47-->thread3FINAL: Formula: (<= v_w_6 v_x3_4) InVars {w=v_w_6, x3=v_x3_4} OutVars{w=v_w_6, x3=v_x3_4} AuxVars[] AssignedVars[]" "[94] thread3FINAL-->thread3EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[117] L16-->L56: 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]" "[96] L56-->L60: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" "[98] L60-->thread4FINAL: Formula: (= v_f_2 (+ v_f_3 1)) InVars {f=v_f_3} OutVars{f=v_f_2} AuxVars[] AssignedVars[f]" "[100] thread4FINAL-->thread4EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[120] L17-->$Ultimate##0: Formula: (and (= v_thread5Thread1of1ForFork4_thidvar4_2 5) (= v_thread5Thread1of1ForFork4_thidvar1_2 5) (= v_thread5Thread1of1ForFork4_thidvar0_2 5) (= v_thread5Thread1of1ForFork4_thidvar3_2 5) (= v_thread5Thread1of1ForFork4_thidvar2_2 5)) InVars {} OutVars{thread5Thread1of1ForFork4_thidvar0=v_thread5Thread1of1ForFork4_thidvar0_2, thread5Thread1of1ForFork4_thidvar1=v_thread5Thread1of1ForFork4_thidvar1_2, thread5Thread1of1ForFork4_thidvar2=v_thread5Thread1of1ForFork4_thidvar2_2, thread5Thread1of1ForFork4_thidvar3=v_thread5Thread1of1ForFork4_thidvar3_2, thread5Thread1of1ForFork4_thidvar4=v_thread5Thread1of1ForFork4_thidvar4_2} AuxVars[] AssignedVars[thread5Thread1of1ForFork4_thidvar0, thread5Thread1of1ForFork4_thidvar1, thread5Thread1of1ForFork4_thidvar2, thread5Thread1of1ForFork4_thidvar3, thread5Thread1of1ForFork4_thidvar4]" "[101] $Ultimate##0-->L67-1: Formula: (< 0 v_f_4) InVars {f=v_f_4} OutVars{f=v_f_4} AuxVars[] AssignedVars[]" [2025-04-26 16:58:57,306 INFO L754 eck$LassoCheckResult]: Loop: "[103] L67-1-->L69: Formula: (< v_y_2 v_x1_6) InVars {y=v_y_2, x1=v_x1_6} OutVars{y=v_y_2, x1=v_x1_6} AuxVars[] AssignedVars[]" "[105] L69-->L67-1: Formula: (= (+ v_x1_7 1) v_x1_8) InVars {x1=v_x1_8} OutVars{x1=v_x1_7} AuxVars[] AssignedVars[x1]" [2025-04-26 16:58:57,306 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:57,306 INFO L85 PathProgramCache]: Analyzing trace with hash -283279812, now seen corresponding path program 1 times [2025-04-26 16:58:57,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:57,307 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126731158] [2025-04-26 16:58:57,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:57,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:57,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:58:57,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:58:57,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:57,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:57,313 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:57,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:58:57,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:58:57,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:57,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:57,318 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:57,318 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:57,318 INFO L85 PathProgramCache]: Analyzing trace with hash 4259, now seen corresponding path program 1 times [2025-04-26 16:58:57,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:57,319 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986239638] [2025-04-26 16:58:57,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:57,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:57,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:57,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:57,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:57,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:57,321 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:57,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:57,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:57,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:57,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:57,323 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:57,323 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:57,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1648956386, now seen corresponding path program 1 times [2025-04-26 16:58:57,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:57,323 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091666056] [2025-04-26 16:58:57,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:57,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:57,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:58:57,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:58:57,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:57,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:57,329 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:57,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:58:57,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:58:57,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:57,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:57,334 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:57,353 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:57,353 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:57,353 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:57,353 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:57,353 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:58:57,353 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:57,353 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:57,353 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:57,353 INFO L132 ssoRankerPreferences]: Filename of dumped script: m9.c.bpl_petrified1_Iteration5_Loop [2025-04-26 16:58:57,354 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:57,354 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:57,354 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:57,378 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:57,378 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:58:57,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:57,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:57,380 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:58:57,381 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:58:57,383 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:57,383 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:57,399 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:58:57,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:57,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:57,401 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:58:57,403 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:58:57,404 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:57,404 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:57,477 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:58:57,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:57,481 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:57,481 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:57,481 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:57,481 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:57,481 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:58:57,481 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:57,481 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:57,481 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:57,481 INFO L132 ssoRankerPreferences]: Filename of dumped script: m9.c.bpl_petrified1_Iteration5_Loop [2025-04-26 16:58:57,481 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:57,481 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:57,482 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:57,501 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:57,501 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:58:57,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:57,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:57,504 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:58:57,505 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:58:57,507 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:58:57,517 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:57,517 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:57,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:57,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:57,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:57,518 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:57,519 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:57,521 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:58:57,523 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:58:57,523 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:58:57,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:57,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:57,526 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:58:57,528 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:58:57,529 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:58:57,532 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:58:57,533 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:58:57,533 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:58:57,533 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(y, x1) = -1*y + 1*x1 Supporting invariants [] [2025-04-26 16:58:57,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:57,539 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:58:57,558 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:57,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:58:57,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:58:57,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:57,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:57,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:58:57,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:57,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:57,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:57,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:57,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:57,598 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:58:57,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:57,613 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:58:57,614 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:58:57,615 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9238 states and 26291 transitions. cyclomatic complexity: 18013 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (in total 18), 3 states have internal predecessors, (18), 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:58:57,830 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9238 states and 26291 transitions. cyclomatic complexity: 18013. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (in total 18), 3 states have internal predecessors, (18), 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 23808 states and 67019 transitions. Complement of second has 7 states. [2025-04-26 16:58:57,830 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:58:57,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (in total 18), 3 states have internal predecessors, (18), 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:58:57,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2025-04-26 16:58:57,831 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 90 transitions. Stem has 16 letters. Loop has 2 letters. [2025-04-26 16:58:57,831 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:57,831 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 90 transitions. Stem has 18 letters. Loop has 2 letters. [2025-04-26 16:58:57,831 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:57,831 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 90 transitions. Stem has 16 letters. Loop has 4 letters. [2025-04-26 16:58:57,831 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:57,831 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23808 states and 67019 transitions. [2025-04-26 16:58:58,061 INFO L131 ngComponentsAnalysis]: Automaton has 62 accepting balls. 126 [2025-04-26 16:58:58,145 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23808 states to 14734 states and 41127 transitions. [2025-04-26 16:58:58,145 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3731 [2025-04-26 16:58:58,153 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3755 [2025-04-26 16:58:58,153 INFO L74 IsDeterministic]: Start isDeterministic. Operand 14734 states and 41127 transitions. [2025-04-26 16:58:58,153 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:58:58,153 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14734 states and 41127 transitions. [2025-04-26 16:58:58,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14734 states and 41127 transitions. [2025-04-26 16:58:58,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14734 to 10732. [2025-04-26 16:58:58,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10732 states, 10732 states have (on average 2.8355385762206486) internal successors, (in total 30431), 10731 states have internal predecessors, (30431), 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:58:58,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10732 states to 10732 states and 30431 transitions. [2025-04-26 16:58:58,384 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10732 states and 30431 transitions. [2025-04-26 16:58:58,384 INFO L438 stractBuchiCegarLoop]: Abstraction has 10732 states and 30431 transitions. [2025-04-26 16:58:58,384 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:58:58,384 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10732 states and 30431 transitions. [2025-04-26 16:58:58,500 INFO L131 ngComponentsAnalysis]: Automaton has 62 accepting balls. 126 [2025-04-26 16:58:58,500 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:58,500 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:58,501 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:58:58,501 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:58:58,501 INFO L752 eck$LassoCheckResult]: Stem: "[80] $Ultimate##0-->L14: Formula: (= v_f_1 0) InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[108] L14-->L29: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[84] L29-->thread1FINAL: Formula: (<= v_w_2 v_x4_4) InVars {x4=v_x4_4, w=v_w_2} OutVars{x4=v_x4_4, w=v_w_2} AuxVars[] AssignedVars[]" "[86] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[111] L14-1-->L38: 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]" "[88] L38-->thread2FINAL: Formula: (<= v_w_4 v_x2_4) InVars {x2=v_x2_4, w=v_w_4} OutVars{x2=v_x2_4, w=v_w_4} AuxVars[] AssignedVars[]" "[90] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[114] L15-->L47: 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]" "[92] L47-->thread3FINAL: Formula: (<= v_w_6 v_x3_4) InVars {w=v_w_6, x3=v_x3_4} OutVars{w=v_w_6, x3=v_x3_4} AuxVars[] AssignedVars[]" "[94] thread3FINAL-->thread3EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[117] L16-->L56: 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]" "[120] L17-->$Ultimate##0: Formula: (and (= v_thread5Thread1of1ForFork4_thidvar4_2 5) (= v_thread5Thread1of1ForFork4_thidvar1_2 5) (= v_thread5Thread1of1ForFork4_thidvar0_2 5) (= v_thread5Thread1of1ForFork4_thidvar3_2 5) (= v_thread5Thread1of1ForFork4_thidvar2_2 5)) InVars {} OutVars{thread5Thread1of1ForFork4_thidvar0=v_thread5Thread1of1ForFork4_thidvar0_2, thread5Thread1of1ForFork4_thidvar1=v_thread5Thread1of1ForFork4_thidvar1_2, thread5Thread1of1ForFork4_thidvar2=v_thread5Thread1of1ForFork4_thidvar2_2, thread5Thread1of1ForFork4_thidvar3=v_thread5Thread1of1ForFork4_thidvar3_2, thread5Thread1of1ForFork4_thidvar4=v_thread5Thread1of1ForFork4_thidvar4_2} AuxVars[] AssignedVars[thread5Thread1of1ForFork4_thidvar0, thread5Thread1of1ForFork4_thidvar1, thread5Thread1of1ForFork4_thidvar2, thread5Thread1of1ForFork4_thidvar3, thread5Thread1of1ForFork4_thidvar4]" "[121] thread1EXIT-->L19: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_4 1) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[]" "[122] thread2EXIT-->L20: 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[]" "[123] thread3EXIT-->L21: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar2_4) (= 3 v_thread3Thread1of1ForFork2_thidvar1_4) (= 3 v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[]" "[101] $Ultimate##0-->L67-1: Formula: (< 0 v_f_4) InVars {f=v_f_4} OutVars{f=v_f_4} AuxVars[] AssignedVars[]" "[103] L67-1-->L69: Formula: (< v_y_2 v_x1_6) InVars {y=v_y_2, x1=v_x1_6} OutVars{y=v_y_2, x1=v_x1_6} AuxVars[] AssignedVars[]" "[105] L69-->L67-1: Formula: (= (+ v_x1_7 1) v_x1_8) InVars {x1=v_x1_8} OutVars{x1=v_x1_7} AuxVars[] AssignedVars[x1]" "[102] L67-1-->thread5FINAL: Formula: (<= v_x1_5 v_y_1) InVars {y=v_y_1, x1=v_x1_5} OutVars{y=v_y_1, x1=v_x1_5} AuxVars[] AssignedVars[]" [2025-04-26 16:58:58,501 INFO L754 eck$LassoCheckResult]: Loop: "[97] L56-->L58: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[99] L58-->L56: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" [2025-04-26 16:58:58,502 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:58,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1129905164, now seen corresponding path program 1 times [2025-04-26 16:58:58,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:58,502 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525599025] [2025-04-26 16:58:58,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:58,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:58,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:58:58,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:58:58,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:58,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:58,554 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:58:58,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:58:58,555 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525599025] [2025-04-26 16:58:58,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525599025] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:58:58,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:58:58,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:58:58,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710058902] [2025-04-26 16:58:58,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:58:58,558 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:58:58,559 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:58,559 INFO L85 PathProgramCache]: Analyzing trace with hash 4067, now seen corresponding path program 2 times [2025-04-26 16:58:58,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:58,559 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492037849] [2025-04-26 16:58:58,559 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:58:58,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:58,561 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:58,562 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:58,562 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:58:58,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:58,562 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:58,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:58,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:58,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:58,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:58,564 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:58,579 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:58,579 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:58,579 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:58,579 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:58,579 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:58:58,579 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:58,579 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:58,579 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:58,579 INFO L132 ssoRankerPreferences]: Filename of dumped script: m9.c.bpl_petrified1_Iteration6_Loop [2025-04-26 16:58:58,579 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:58,579 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:58,579 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:58,596 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:58,596 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:58:58,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:58,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:58,598 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:58:58,598 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:58:58,599 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:58,599 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:58,617 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:58:58,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:58,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:58,619 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:58,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 16:58:58,621 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:58,621 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:58,684 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:58:58,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-04-26 16:58:58,688 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:58,688 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:58,688 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:58,688 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:58,688 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:58:58,688 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:58,688 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:58,688 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:58,688 INFO L132 ssoRankerPreferences]: Filename of dumped script: m9.c.bpl_petrified1_Iteration6_Loop [2025-04-26 16:58:58,688 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:58,688 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:58,689 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:58,709 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:58,710 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:58:58,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:58,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:58,712 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:58,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-04-26 16:58:58,715 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:58:58,726 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:58,726 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:58,726 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:58,726 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:58,726 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:58,730 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:58,730 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:58,733 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:58:58,736 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:58:58,736 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:58:58,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:58,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:58,739 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:58,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-04-26 16:58:58,742 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:58:58,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:58,746 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:58:58,746 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:58:58,746 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, z) = -1*x1 + 1*z Supporting invariants [] [2025-04-26 16:58:58,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-04-26 16:58:58,752 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:58:58,762 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:58,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:58:58,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:58:58,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:58,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:58,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:58:58,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:58,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:58,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:58,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:58,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:58,807 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:58:58,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:58,817 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:58:58,818 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:58:58,818 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10732 states and 30431 transitions. cyclomatic complexity: 20799 Second operand has 3 states, 3 states have (on average 7.0) internal successors, (in total 21), 3 states have internal predecessors, (21), 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:58:58,918 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10732 states and 30431 transitions. cyclomatic complexity: 20799. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (in total 21), 3 states have internal predecessors, (21), 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 13613 states and 38216 transitions. Complement of second has 6 states. [2025-04-26 16:58:58,918 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:58:58,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (in total 21), 3 states have internal predecessors, (21), 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:58:58,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2025-04-26 16:58:58,919 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 84 transitions. Stem has 19 letters. Loop has 2 letters. [2025-04-26 16:58:58,919 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:58,919 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 84 transitions. Stem has 21 letters. Loop has 2 letters. [2025-04-26 16:58:58,919 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:58,919 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 84 transitions. Stem has 19 letters. Loop has 4 letters. [2025-04-26 16:58:58,919 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:58,919 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13613 states and 38216 transitions. [2025-04-26 16:58:58,996 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 66 [2025-04-26 16:58:59,046 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13613 states to 9792 states and 27371 transitions. [2025-04-26 16:58:59,047 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2542 [2025-04-26 16:58:59,051 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2542 [2025-04-26 16:58:59,051 INFO L74 IsDeterministic]: Start isDeterministic. Operand 9792 states and 27371 transitions. [2025-04-26 16:58:59,051 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:58:59,052 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9792 states and 27371 transitions. [2025-04-26 16:58:59,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9792 states and 27371 transitions. [2025-04-26 16:58:59,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9792 to 9792. [2025-04-26 16:58:59,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9792 states, 9792 states have (on average 2.7952410130718954) internal successors, (in total 27371), 9791 states have internal predecessors, (27371), 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:58:59,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9792 states to 9792 states and 27371 transitions. [2025-04-26 16:58:59,311 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9792 states and 27371 transitions. [2025-04-26 16:58:59,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:58:59,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:58:59,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:58:59,315 INFO L87 Difference]: Start difference. First operand 9792 states and 27371 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (in total 19), 2 states have internal predecessors, (19), 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:58:59,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:58:59,336 INFO L93 Difference]: Finished difference Result 2404 states and 6119 transitions. [2025-04-26 16:58:59,336 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2404 states and 6119 transitions. [2025-04-26 16:58:59,345 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:58:59,345 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2404 states to 0 states and 0 transitions. [2025-04-26 16:58:59,346 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:58:59,346 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:58:59,346 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:58:59,346 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:58:59,346 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:58:59,346 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:58:59,346 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:58:59,347 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:58:59,347 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 16:58:59,347 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:58:59,347 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:58:59,347 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:58:59,356 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:58:59,358 INFO L201 PluginConnector]: Adding new model m9.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:58:59 BoogieIcfgContainer [2025-04-26 16:58:59,358 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:58:59,358 INFO L158 Benchmark]: Toolchain (without parser) took 6968.14ms. Allocated memory was 159.4MB in the beginning and 520.1MB in the end (delta: 360.7MB). Free memory was 86.4MB in the beginning and 160.8MB in the end (delta: -74.4MB). Peak memory consumption was 287.0MB. Max. memory is 8.0GB. [2025-04-26 16:58:59,359 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.16ms. Allocated memory is still 159.4MB. Free memory was 87.4MB in the beginning and 87.2MB in the end (delta: 199.4kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:58:59,359 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.08ms. Allocated memory is still 159.4MB. Free memory was 86.4MB in the beginning and 84.5MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:58:59,359 INFO L158 Benchmark]: Boogie Preprocessor took 23.70ms. Allocated memory is still 159.4MB. Free memory was 84.5MB in the beginning and 83.4MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:58:59,359 INFO L158 Benchmark]: RCFGBuilder took 190.86ms. Allocated memory is still 159.4MB. Free memory was 83.4MB in the beginning and 74.0MB in the end (delta: 9.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:58:59,359 INFO L158 Benchmark]: BuchiAutomizer took 6719.51ms. Allocated memory was 159.4MB in the beginning and 520.1MB in the end (delta: 360.7MB). Free memory was 74.0MB in the beginning and 160.8MB in the end (delta: -86.8MB). Peak memory consumption was 278.6MB. Max. memory is 8.0GB. [2025-04-26 16:58:59,360 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.16ms. Allocated memory is still 159.4MB. Free memory was 87.4MB in the beginning and 87.2MB in the end (delta: 199.4kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.08ms. Allocated memory is still 159.4MB. Free memory was 86.4MB in the beginning and 84.5MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 23.70ms. Allocated memory is still 159.4MB. Free memory was 84.5MB in the beginning and 83.4MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 190.86ms. Allocated memory is still 159.4MB. Free memory was 83.4MB in the beginning and 74.0MB in the end (delta: 9.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * BuchiAutomizer took 6719.51ms. Allocated memory was 159.4MB in the beginning and 520.1MB in the end (delta: 360.7MB). Free memory was 74.0MB in the beginning and 160.8MB in the end (delta: -86.8MB). Peak memory consumption was 278.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.6s and 7 iterations. TraceHistogramMax:1. Analysis of lassos took 1.6s. Construction of modules took 0.2s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 6. Automata minimization 1.3s AutomataMinimizationTime, 6 MinimizatonAttempts, 7060 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 1.1s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [6, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 372 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 366 mSDsluCounter, 520 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 263 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 306 IncrementalHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 257 mSDtfsCounter, 306 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT5 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 38ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s InitialAbstractionConstructionTime: 0.6s InitialAbstraction: Time to compute Ample Reduction [ms]: 669, Number of transitions in reduction automaton: 7248, Number of states in reduction automaton: 2434, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (1 trivial, 6 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x4 + w and consists of 4 locations. One deterministic module has affine ranking function w + -1 * x2 and consists of 4 locations. One deterministic module has affine ranking function -1 * x3 + w and consists of 4 locations. One deterministic module has affine ranking function -1 * x1 + z and consists of 4 locations. One deterministic module has affine ranking function x1 + -1 * y and consists of 4 locations. One deterministic module has affine ranking function -1 * x1 + z and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:58:59,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...