./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/NO_22.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-restricted-15/NO_22.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 2aebec197cf7bd355d2eb5f718c983de149eae8f5ff2da107813d58a220d4744 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 14:15:41,849 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 14:15:41,911 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-19 14:15:41,915 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 14:15:41,915 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 14:15:41,950 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 14:15:41,950 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 14:15:41,951 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 14:15:41,951 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 14:15:41,952 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 14:15:41,952 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 14:15:41,953 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 14:15:41,953 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 14:15:41,954 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-19 14:15:41,954 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-19 14:15:41,954 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-19 14:15:41,955 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-19 14:15:41,955 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-19 14:15:41,955 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-19 14:15:41,956 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 14:15:41,956 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-19 14:15:41,957 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 14:15:41,957 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 14:15:41,957 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-19 14:15:41,957 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-19 14:15:41,958 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-19 14:15:41,958 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 14:15:41,958 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 14:15:41,959 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 14:15:41,959 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-19 14:15:41,959 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 14:15:41,960 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 14:15:41,960 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 14:15:41,960 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 14:15:41,961 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 14:15:41,961 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-19 14:15:41,961 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2aebec197cf7bd355d2eb5f718c983de149eae8f5ff2da107813d58a220d4744 [2024-11-19 14:15:42,212 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 14:15:42,235 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 14:15:42,238 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 14:15:42,239 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 14:15:42,241 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 14:15:42,242 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/NO_22.c [2024-11-19 14:15:43,676 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 14:15:43,853 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 14:15:43,854 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/NO_22.c [2024-11-19 14:15:43,859 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33a2cf11e/fdc80fa808244cdaaf1ea56072455c9a/FLAG6b2a48295 [2024-11-19 14:15:44,246 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33a2cf11e/fdc80fa808244cdaaf1ea56072455c9a [2024-11-19 14:15:44,249 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 14:15:44,250 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 14:15:44,251 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 14:15:44,251 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 14:15:44,256 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 14:15:44,256 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:15:44" (1/1) ... [2024-11-19 14:15:44,257 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c3bb9af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:15:44, skipping insertion in model container [2024-11-19 14:15:44,257 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:15:44" (1/1) ... [2024-11-19 14:15:44,279 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 14:15:44,444 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:15:44,452 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 14:15:44,466 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:15:44,481 INFO L204 MainTranslator]: Completed translation [2024-11-19 14:15:44,481 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:15:44 WrapperNode [2024-11-19 14:15:44,482 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 14:15:44,483 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 14:15:44,483 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 14:15:44,483 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 14:15:44,489 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:15:44" (1/1) ... [2024-11-19 14:15:44,493 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:15:44" (1/1) ... [2024-11-19 14:15:44,507 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 13 [2024-11-19 14:15:44,508 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 14:15:44,509 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 14:15:44,509 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 14:15:44,509 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 14:15:44,518 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:15:44" (1/1) ... [2024-11-19 14:15:44,519 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:15:44" (1/1) ... [2024-11-19 14:15:44,520 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:15:44" (1/1) ... [2024-11-19 14:15:44,525 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-19 14:15:44,525 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:15:44" (1/1) ... [2024-11-19 14:15:44,526 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:15:44" (1/1) ... [2024-11-19 14:15:44,527 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:15:44" (1/1) ... [2024-11-19 14:15:44,530 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:15:44" (1/1) ... [2024-11-19 14:15:44,531 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:15:44" (1/1) ... [2024-11-19 14:15:44,532 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:15:44" (1/1) ... [2024-11-19 14:15:44,532 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 14:15:44,534 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 14:15:44,534 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 14:15:44,534 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 14:15:44,535 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:15:44" (1/1) ... [2024-11-19 14:15:44,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:44,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:44,569 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:44,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-19 14:15:44,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 14:15:44,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 14:15:44,671 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 14:15:44,673 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 14:15:44,715 INFO L? ?]: Removed 3 outVars from TransFormulas that were not future-live. [2024-11-19 14:15:44,716 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 14:15:44,726 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 14:15:44,727 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 14:15:44,727 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:15:44 BoogieIcfgContainer [2024-11-19 14:15:44,727 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 14:15:44,728 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-19 14:15:44,728 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-19 14:15:44,732 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-19 14:15:44,733 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:15:44,733 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 02:15:44" (1/3) ... [2024-11-19 14:15:44,734 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7f27df06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:15:44, skipping insertion in model container [2024-11-19 14:15:44,734 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:15:44,734 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:15:44" (2/3) ... [2024-11-19 14:15:44,735 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7f27df06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:15:44, skipping insertion in model container [2024-11-19 14:15:44,735 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:15:44,735 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:15:44" (3/3) ... [2024-11-19 14:15:44,736 INFO L332 chiAutomizerObserver]: Analyzing ICFG NO_22.c [2024-11-19 14:15:44,777 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-19 14:15:44,778 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-19 14:15:44,778 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-19 14:15:44,778 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-19 14:15:44,778 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-19 14:15:44,778 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-19 14:15:44,778 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-19 14:15:44,779 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-19 14:15:44,783 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:44,795 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:15:44,796 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:15:44,796 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:15:44,799 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:15:44,799 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:15:44,800 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-19 14:15:44,800 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:44,801 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:15:44,801 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:15:44,801 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:15:44,801 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:15:44,802 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:15:44,807 INFO L745 eck$LassoCheckResult]: Stem: 6#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; 3#L10-2true [2024-11-19 14:15:44,808 INFO L747 eck$LassoCheckResult]: Loop: 3#L10-2true assume !!(main_~i~0#1 < 100); 5#L10true assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1; 3#L10-2true [2024-11-19 14:15:44,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:44,813 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-19 14:15:44,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:44,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917605674] [2024-11-19 14:15:44,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:15:44,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:44,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:44,908 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:44,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:44,929 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:44,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:44,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1318, now seen corresponding path program 1 times [2024-11-19 14:15:44,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:44,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612846859] [2024-11-19 14:15:44,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:15:44,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:44,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:44,947 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:44,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:44,956 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:44,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:44,959 INFO L85 PathProgramCache]: Analyzing trace with hash 925800, now seen corresponding path program 1 times [2024-11-19 14:15:44,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:44,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871751662] [2024-11-19 14:15:44,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:15:44,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:44,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:45,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:15:45,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:15:45,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871751662] [2024-11-19 14:15:45,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871751662] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:15:45,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:15:45,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 14:15:45,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228691988] [2024-11-19 14:15:45,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:15:45,126 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:15:45,126 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:15:45,127 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:15:45,127 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:15:45,128 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:15:45,128 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:45,128 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:15:45,128 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:15:45,128 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration1_Loop [2024-11-19 14:15:45,128 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:15:45,129 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:15:45,146 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:45,158 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:45,163 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:45,233 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:15:45,234 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:15:45,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:45,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:45,240 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:45,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-19 14:15:45,243 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:45,244 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:45,274 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:45,274 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:15:45,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:45,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:45,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:45,288 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:45,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-19 14:15:45,290 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:45,291 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:45,310 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:45,310 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:15:45,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:45,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:45,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:45,328 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:45,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-19 14:15:45,331 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:45,331 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:45,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:45,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:45,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:45,364 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:45,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-19 14:15:45,366 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:15:45,366 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:45,381 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:15:45,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-19 14:15:45,397 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:15:45,399 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:15:45,399 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:15:45,399 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:15:45,399 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:15:45,399 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:45,399 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:15:45,399 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:15:45,400 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration1_Loop [2024-11-19 14:15:45,400 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:15:45,400 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:15:45,402 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:45,406 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:45,412 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:45,481 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:15:45,485 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:15:45,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:45,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:45,489 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:45,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-19 14:15:45,492 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 [2024-11-19 14:15:45,506 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:45,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:45,507 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:45,507 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:45,513 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:15:45,513 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:15:45,525 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:15:45,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-19 14:15:45,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:45,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:45,542 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:45,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-19 14:15:45,543 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 [2024-11-19 14:15:45,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:45,554 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:45,554 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:45,554 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:45,557 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:15:45,557 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:15:45,564 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:15:45,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-19 14:15:45,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:45,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:45,581 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:45,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-19 14:15:45,583 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 [2024-11-19 14:15:45,593 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:45,593 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:15:45,594 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:45,594 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:45,594 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:45,596 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:15:45,596 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:15:45,601 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:15:45,606 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 14:15:45,606 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-19 14:15:45,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:45,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:45,627 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:45,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-19 14:15:45,630 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:15:45,630 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:15:45,630 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:15:45,631 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2024-11-19 14:15:45,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:45,645 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:15:45,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:45,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:45,674 INFO L255 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:15:45,675 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:45,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:45,702 WARN L253 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:15:45,703 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:45,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:15:45,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-19 14:15:45,749 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2024-11-19 14:15:45,751 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:45,785 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 17 states and 24 transitions. Complement of second has 6 states. [2024-11-19 14:15:45,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-19 14:15:45,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:45,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2024-11-19 14:15:45,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 2 letters. [2024-11-19 14:15:45,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:45,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 4 letters. Loop has 2 letters. [2024-11-19 14:15:45,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:45,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 4 letters. [2024-11-19 14:15:45,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:45,794 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 24 transitions. [2024-11-19 14:15:45,796 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:15:45,798 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 8 states and 11 transitions. [2024-11-19 14:15:45,799 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2024-11-19 14:15:45,799 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2024-11-19 14:15:45,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 11 transitions. [2024-11-19 14:15:45,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:15:45,800 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8 states and 11 transitions. [2024-11-19 14:15:45,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 11 transitions. [2024-11-19 14:15:45,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2024-11-19 14:15:45,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:45,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2024-11-19 14:15:45,821 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 11 transitions. [2024-11-19 14:15:45,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:15:45,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:15:45,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:15:45,824 INFO L87 Difference]: Start difference. First operand 8 states and 11 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:45,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:15:45,836 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2024-11-19 14:15:45,836 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7 states and 8 transitions. [2024-11-19 14:15:45,836 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:15:45,836 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7 states to 6 states and 7 transitions. [2024-11-19 14:15:45,837 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2024-11-19 14:15:45,837 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2024-11-19 14:15:45,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 7 transitions. [2024-11-19 14:15:45,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:15:45,837 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6 states and 7 transitions. [2024-11-19 14:15:45,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 7 transitions. [2024-11-19 14:15:45,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2024-11-19 14:15:45,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:45,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2024-11-19 14:15:45,838 INFO L240 hiAutomatonCegarLoop]: Abstraction has 6 states and 7 transitions. [2024-11-19 14:15:45,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:15:45,841 INFO L425 stractBuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2024-11-19 14:15:45,841 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-19 14:15:45,842 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 7 transitions. [2024-11-19 14:15:45,842 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:15:45,842 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:15:45,842 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:15:45,842 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-19 14:15:45,843 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:15:45,843 INFO L745 eck$LassoCheckResult]: Stem: 79#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 80#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; 81#L10-2 assume !!(main_~i~0#1 < 100); 78#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 76#L10-2 [2024-11-19 14:15:45,843 INFO L747 eck$LassoCheckResult]: Loop: 76#L10-2 assume !!(main_~i~0#1 < 100); 77#L10 assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1; 76#L10-2 [2024-11-19 14:15:45,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:45,845 INFO L85 PathProgramCache]: Analyzing trace with hash 925798, now seen corresponding path program 1 times [2024-11-19 14:15:45,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:45,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433585856] [2024-11-19 14:15:45,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:15:45,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:45,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:45,851 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:45,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:45,858 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:45,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:45,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1318, now seen corresponding path program 2 times [2024-11-19 14:15:45,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:45,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565570008] [2024-11-19 14:15:45,860 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:15:45,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:45,868 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:15:45,869 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:15:45,869 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:45,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:45,874 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:45,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:45,877 INFO L85 PathProgramCache]: Analyzing trace with hash 889692235, now seen corresponding path program 1 times [2024-11-19 14:15:45,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:45,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522109624] [2024-11-19 14:15:45,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:15:45,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:45,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:45,961 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:15:45,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:15:45,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522109624] [2024-11-19 14:15:45,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522109624] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:15:45,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192528217] [2024-11-19 14:15:45,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:15:45,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:15:45,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:45,967 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:15:45,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-19 14:15:46,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:46,003 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 14:15:46,004 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:46,032 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:15:46,033 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:15:46,062 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:15:46,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192528217] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:15:46,066 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:15:46,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-11-19 14:15:46,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855992905] [2024-11-19 14:15:46,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:15:46,100 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:15:46,100 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:15:46,100 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:15:46,100 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:15:46,100 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:15:46,100 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:46,100 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:15:46,100 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:15:46,100 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration2_Loop [2024-11-19 14:15:46,100 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:15:46,100 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:15:46,102 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:46,105 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:46,113 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:46,151 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:15:46,152 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:15:46,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:46,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:46,154 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:46,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-19 14:15:46,156 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:46,156 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:46,178 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:46,178 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:15:46,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-11-19 14:15:46,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:46,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:46,192 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:46,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-19 14:15:46,194 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:46,194 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:46,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:46,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:46,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:46,219 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:46,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-19 14:15:46,221 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:15:46,221 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:46,235 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:15:46,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:46,250 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:15:46,250 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:15:46,250 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:15:46,250 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:15:46,250 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:15:46,250 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:46,250 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:15:46,250 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:15:46,250 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration2_Loop [2024-11-19 14:15:46,250 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:15:46,250 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:15:46,252 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:46,257 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:46,264 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:46,304 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:15:46,304 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:15:46,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:46,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:46,306 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:46,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-19 14:15:46,307 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 [2024-11-19 14:15:46,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:46,317 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:46,317 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:46,317 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:46,319 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:15:46,319 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:15:46,325 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:15:46,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:46,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:46,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:46,342 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:46,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-19 14:15:46,344 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 [2024-11-19 14:15:46,356 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:46,356 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:15:46,357 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:46,357 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:46,357 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:46,359 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:15:46,359 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:15:46,363 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:15:46,366 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 14:15:46,366 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-19 14:15:46,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:46,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:46,368 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:46,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-19 14:15:46,370 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:15:46,370 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:15:46,370 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:15:46,370 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2024-11-19 14:15:46,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-11-19 14:15:46,386 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:15:46,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:46,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:46,412 INFO L255 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:15:46,412 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:46,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:46,424 WARN L253 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:15:46,424 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:46,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:15:46,427 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2024-11-19 14:15:46,428 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 7 transitions. cyclomatic complexity: 2 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:46,441 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 7 transitions. cyclomatic complexity: 2. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 10 states and 13 transitions. Complement of second has 5 states. [2024-11-19 14:15:46,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-19 14:15:46,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:46,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2024-11-19 14:15:46,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 4 letters. Loop has 2 letters. [2024-11-19 14:15:46,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:46,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 6 letters. Loop has 2 letters. [2024-11-19 14:15:46,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:46,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 4 letters. Loop has 4 letters. [2024-11-19 14:15:46,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:46,444 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 13 transitions. [2024-11-19 14:15:46,445 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:15:46,445 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 13 transitions. [2024-11-19 14:15:46,445 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2024-11-19 14:15:46,445 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-11-19 14:15:46,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2024-11-19 14:15:46,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:15:46,446 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 13 transitions. [2024-11-19 14:15:46,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2024-11-19 14:15:46,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2024-11-19 14:15:46,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:46,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2024-11-19 14:15:46,450 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 13 transitions. [2024-11-19 14:15:46,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:15:46,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 14:15:46,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 14:15:46,452 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:46,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:15:46,476 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2024-11-19 14:15:46,476 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2024-11-19 14:15:46,477 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:15:46,478 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 12 states and 13 transitions. [2024-11-19 14:15:46,478 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-11-19 14:15:46,478 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-19 14:15:46,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. [2024-11-19 14:15:46,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:15:46,479 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 13 transitions. [2024-11-19 14:15:46,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. [2024-11-19 14:15:46,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-11-19 14:15:46,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:46,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2024-11-19 14:15:46,481 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 13 transitions. [2024-11-19 14:15:46,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 14:15:46,483 INFO L425 stractBuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2024-11-19 14:15:46,484 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-19 14:15:46,484 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. [2024-11-19 14:15:46,484 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:15:46,484 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:15:46,485 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:15:46,485 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1] [2024-11-19 14:15:46,486 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:15:46,486 INFO L745 eck$LassoCheckResult]: Stem: 189#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 190#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; 191#L10-2 assume !!(main_~i~0#1 < 100); 188#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 186#L10-2 assume !!(main_~i~0#1 < 100); 187#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 197#L10-2 assume !!(main_~i~0#1 < 100); 196#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 195#L10-2 assume !!(main_~i~0#1 < 100); 194#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 193#L10-2 [2024-11-19 14:15:46,486 INFO L747 eck$LassoCheckResult]: Loop: 193#L10-2 assume !!(main_~i~0#1 < 100); 192#L10 assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1; 193#L10-2 [2024-11-19 14:15:46,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:46,487 INFO L85 PathProgramCache]: Analyzing trace with hash 742492623, now seen corresponding path program 2 times [2024-11-19 14:15:46,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:46,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188684321] [2024-11-19 14:15:46,487 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:15:46,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:46,498 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:15:46,501 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:15:46,501 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:46,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:46,511 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:46,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:46,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1318, now seen corresponding path program 3 times [2024-11-19 14:15:46,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:46,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387044899] [2024-11-19 14:15:46,513 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:15:46,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:46,516 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 14:15:46,516 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:15:46,517 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:46,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:46,519 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:46,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:46,519 INFO L85 PathProgramCache]: Analyzing trace with hash 570839924, now seen corresponding path program 2 times [2024-11-19 14:15:46,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:46,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991168449] [2024-11-19 14:15:46,519 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:15:46,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:46,534 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:15:46,534 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:15:46,641 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:15:46,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:15:46,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991168449] [2024-11-19 14:15:46,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991168449] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:15:46,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180969390] [2024-11-19 14:15:46,642 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:15:46,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:15:46,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:46,644 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:15:46,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-19 14:15:46,675 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:15:46,675 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:15:46,676 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 14:15:46,677 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:46,708 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:15:46,708 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:15:46,788 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:15:46,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180969390] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:15:46,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:15:46,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-19 14:15:46,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243689112] [2024-11-19 14:15:46,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:15:46,808 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:15:46,808 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:15:46,808 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:15:46,809 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:15:46,809 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:15:46,809 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:46,809 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:15:46,809 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:15:46,809 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration3_Loop [2024-11-19 14:15:46,809 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:15:46,809 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:15:46,810 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:46,819 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:46,822 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:46,860 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:15:46,861 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:15:46,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:46,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:46,865 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:46,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-19 14:15:46,868 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:46,868 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:46,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-11-19 14:15:46,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:46,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:46,898 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:46,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-19 14:15:46,901 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:15:46,901 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:46,917 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:15:46,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:46,933 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:15:46,933 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:15:46,933 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:15:46,933 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:15:46,934 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:15:46,934 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:46,934 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:15:46,934 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:15:46,934 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration3_Loop [2024-11-19 14:15:46,934 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:15:46,934 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:15:46,935 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:46,943 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:46,946 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:46,983 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:15:46,983 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:15:46,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:46,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:46,985 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:46,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-19 14:15:46,988 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 [2024-11-19 14:15:47,001 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:47,001 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:15:47,001 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:47,001 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:47,001 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:47,002 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:15:47,003 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:15:47,005 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:15:47,008 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 14:15:47,008 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-19 14:15:47,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:47,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:47,010 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:47,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-19 14:15:47,013 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:15:47,013 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:15:47,013 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:15:47,013 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2024-11-19 14:15:47,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:47,028 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:15:47,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:47,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:47,050 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:15:47,050 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:47,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:47,067 WARN L253 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:15:47,067 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:47,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:15:47,070 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2024-11-19 14:15:47,070 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:47,077 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 13 states and 14 transitions. Complement of second has 5 states. [2024-11-19 14:15:47,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-19 14:15:47,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:47,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2024-11-19 14:15:47,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 10 letters. Loop has 2 letters. [2024-11-19 14:15:47,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:47,079 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:15:47,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:47,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:47,104 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:15:47,104 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:47,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:47,122 WARN L253 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:15:47,122 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:47,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:15:47,125 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2024-11-19 14:15:47,125 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:47,130 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 13 states and 14 transitions. Complement of second has 5 states. [2024-11-19 14:15:47,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-19 14:15:47,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:47,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2024-11-19 14:15:47,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 10 letters. Loop has 2 letters. [2024-11-19 14:15:47,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:47,131 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:15:47,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:47,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:47,149 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:15:47,149 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:47,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:47,165 WARN L253 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:15:47,165 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:47,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:15:47,168 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2024-11-19 14:15:47,168 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:47,176 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 17 states and 19 transitions. Complement of second has 4 states. [2024-11-19 14:15:47,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-19 14:15:47,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:47,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2024-11-19 14:15:47,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 10 letters. Loop has 2 letters. [2024-11-19 14:15:47,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:47,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 12 letters. Loop has 2 letters. [2024-11-19 14:15:47,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:47,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 10 letters. Loop has 4 letters. [2024-11-19 14:15:47,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:47,178 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2024-11-19 14:15:47,178 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-19 14:15:47,179 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 14 states and 16 transitions. [2024-11-19 14:15:47,179 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-11-19 14:15:47,179 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-19 14:15:47,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2024-11-19 14:15:47,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:15:47,179 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 16 transitions. [2024-11-19 14:15:47,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2024-11-19 14:15:47,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2024-11-19 14:15:47,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:47,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2024-11-19 14:15:47,182 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 15 transitions. [2024-11-19 14:15:47,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:15:47,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 14:15:47,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-11-19 14:15:47,183 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:47,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:15:47,229 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2024-11-19 14:15:47,229 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 34 transitions. [2024-11-19 14:15:47,231 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-19 14:15:47,232 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 26 states and 28 transitions. [2024-11-19 14:15:47,232 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2024-11-19 14:15:47,232 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-11-19 14:15:47,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 28 transitions. [2024-11-19 14:15:47,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:15:47,233 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 28 transitions. [2024-11-19 14:15:47,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 28 transitions. [2024-11-19 14:15:47,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2024-11-19 14:15:47,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.08) internal successors, (27), 24 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:47,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2024-11-19 14:15:47,238 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 27 transitions. [2024-11-19 14:15:47,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 14:15:47,239 INFO L425 stractBuchiCegarLoop]: Abstraction has 25 states and 27 transitions. [2024-11-19 14:15:47,240 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-19 14:15:47,240 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 27 transitions. [2024-11-19 14:15:47,240 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-19 14:15:47,241 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:15:47,241 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:15:47,241 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 9, 1, 1] [2024-11-19 14:15:47,243 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:15:47,243 INFO L745 eck$LassoCheckResult]: Stem: 502#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 503#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; 504#L10-2 assume !!(main_~i~0#1 < 100); 501#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 496#L10-2 assume !!(main_~i~0#1 < 100); 497#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 520#L10-2 assume !!(main_~i~0#1 < 100); 519#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 518#L10-2 assume !!(main_~i~0#1 < 100); 517#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 516#L10-2 assume !!(main_~i~0#1 < 100); 515#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 514#L10-2 assume !!(main_~i~0#1 < 100); 513#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 512#L10-2 assume !!(main_~i~0#1 < 100); 511#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 510#L10-2 assume !!(main_~i~0#1 < 100); 509#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 508#L10-2 assume !!(main_~i~0#1 < 100); 507#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 506#L10-2 assume !!(main_~i~0#1 < 100); 500#L10 [2024-11-19 14:15:47,243 INFO L747 eck$LassoCheckResult]: Loop: 500#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 505#L10-2 assume !!(main_~i~0#1 < 100); 500#L10 [2024-11-19 14:15:47,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:47,244 INFO L85 PathProgramCache]: Analyzing trace with hash -926509747, now seen corresponding path program 3 times [2024-11-19 14:15:47,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:47,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191258770] [2024-11-19 14:15:47,244 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:15:47,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:47,260 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2024-11-19 14:15:47,261 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:15:47,261 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:47,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:47,275 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:47,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:47,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1406, now seen corresponding path program 1 times [2024-11-19 14:15:47,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:47,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496630823] [2024-11-19 14:15:47,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:15:47,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:47,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:47,282 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:47,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:47,284 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:47,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:47,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1317636150, now seen corresponding path program 4 times [2024-11-19 14:15:47,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:47,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371257763] [2024-11-19 14:15:47,285 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:15:47,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:47,312 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:15:47,320 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:15:47,321 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:47,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:47,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:47,333 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:47,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:47,363 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:15:47,364 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:15:47,364 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:15:47,364 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:15:47,364 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:15:47,364 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:47,364 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:15:47,364 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:15:47,364 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration4_Loop [2024-11-19 14:15:47,364 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:15:47,364 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:15:47,365 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:47,369 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:47,374 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:47,407 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:15:47,407 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:15:47,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:47,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:47,409 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:47,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-19 14:15:47,411 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:47,412 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:47,435 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:47,435 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:15:47,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:47,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:47,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:47,451 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:47,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-19 14:15:47,455 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:47,455 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:47,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:47,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:47,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:47,478 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:47,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-19 14:15:47,480 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:15:47,480 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:47,512 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:15:47,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:47,517 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:15:47,517 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:15:47,518 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:15:47,518 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:15:47,518 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:15:47,518 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:47,518 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:15:47,518 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:15:47,518 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration4_Loop [2024-11-19 14:15:47,519 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:15:47,519 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:15:47,520 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:47,526 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:47,529 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:47,561 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:15:47,562 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:15:47,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:47,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:47,564 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:47,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-11-19 14:15:47,565 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 [2024-11-19 14:15:47,575 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:47,575 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:15:47,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:47,575 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:47,576 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:47,577 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:15:47,577 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:15:47,579 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:15:47,582 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 14:15:47,582 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-19 14:15:47,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:47,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:47,585 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:47,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-11-19 14:15:47,587 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:15:47,587 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:15:47,587 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:15:47,587 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 99 Supporting invariants [] [2024-11-19 14:15:47,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:47,602 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:15:47,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:47,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:47,638 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:15:47,639 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:47,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:47,681 WARN L253 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:15:47,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:47,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:15:47,703 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 [2024-11-19 14:15:47,704 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 27 transitions. cyclomatic complexity: 3 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:47,716 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 27 transitions. cyclomatic complexity: 3. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 38 states and 42 transitions. Complement of second has 5 states. [2024-11-19 14:15:47,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-19 14:15:47,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:47,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2024-11-19 14:15:47,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 21 letters. Loop has 2 letters. [2024-11-19 14:15:47,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:47,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 23 letters. Loop has 2 letters. [2024-11-19 14:15:47,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:47,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 21 letters. Loop has 4 letters. [2024-11-19 14:15:47,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:47,718 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 42 transitions. [2024-11-19 14:15:47,719 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-19 14:15:47,722 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 28 states and 31 transitions. [2024-11-19 14:15:47,723 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2024-11-19 14:15:47,723 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2024-11-19 14:15:47,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 31 transitions. [2024-11-19 14:15:47,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:15:47,723 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 31 transitions. [2024-11-19 14:15:47,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 31 transitions. [2024-11-19 14:15:47,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2024-11-19 14:15:47,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:47,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2024-11-19 14:15:47,727 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 30 transitions. [2024-11-19 14:15:47,727 INFO L425 stractBuchiCegarLoop]: Abstraction has 27 states and 30 transitions. [2024-11-19 14:15:47,727 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-19 14:15:47,727 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 30 transitions. [2024-11-19 14:15:47,728 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-11-19 14:15:47,728 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:15:47,728 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:15:47,728 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 10, 1, 1, 1] [2024-11-19 14:15:47,729 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:15:47,729 INFO L745 eck$LassoCheckResult]: Stem: 656#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 657#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; 658#L10-2 assume !!(main_~i~0#1 < 100); 653#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 654#L10-2 assume !!(main_~i~0#1 < 100); 655#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 651#L10-2 assume !!(main_~i~0#1 < 100); 652#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 674#L10-2 assume !!(main_~i~0#1 < 100); 673#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 672#L10-2 assume !!(main_~i~0#1 < 100); 671#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 670#L10-2 assume !!(main_~i~0#1 < 100); 669#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 668#L10-2 assume !!(main_~i~0#1 < 100); 667#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 666#L10-2 assume !!(main_~i~0#1 < 100); 665#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 664#L10-2 assume !!(main_~i~0#1 < 100); 663#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 662#L10-2 assume !!(main_~i~0#1 < 100); 661#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 660#L10-2 assume !!(main_~i~0#1 < 100); 649#L10 assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1; 659#L10-2 assume !!(main_~i~0#1 < 100); 650#L10 [2024-11-19 14:15:47,729 INFO L747 eck$LassoCheckResult]: Loop: 650#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 648#L10-2 assume !!(main_~i~0#1 < 100); 650#L10 [2024-11-19 14:15:47,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:47,729 INFO L85 PathProgramCache]: Analyzing trace with hash 767012677, now seen corresponding path program 3 times [2024-11-19 14:15:47,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:47,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463080367] [2024-11-19 14:15:47,730 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:15:47,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:47,748 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2024-11-19 14:15:47,748 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:15:47,939 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:15:47,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:15:47,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463080367] [2024-11-19 14:15:47,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463080367] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:15:47,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727633789] [2024-11-19 14:15:47,940 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:15:47,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:15:47,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:47,943 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:15:47,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-11-19 14:15:47,981 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2024-11-19 14:15:47,981 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:15:47,983 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 14:15:47,985 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:48,038 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:15:48,038 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:15:48,265 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:15:48,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727633789] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:15:48,266 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:15:48,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2024-11-19 14:15:48,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224153395] [2024-11-19 14:15:48,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:15:48,266 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:15:48,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:48,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1406, now seen corresponding path program 2 times [2024-11-19 14:15:48,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:48,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577317036] [2024-11-19 14:15:48,267 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:15:48,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:48,270 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:15:48,270 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:15:48,270 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:48,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:48,271 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:48,290 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:15:48,290 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:15:48,290 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:15:48,290 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:15:48,290 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:15:48,290 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:48,291 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:15:48,291 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:15:48,291 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration5_Loop [2024-11-19 14:15:48,291 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:15:48,291 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:15:48,291 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:48,294 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:48,296 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:48,330 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:15:48,330 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:15:48,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:48,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:48,332 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:48,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-11-19 14:15:48,334 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:48,334 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:48,358 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:48,358 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_9=1} Honda state: {v_rep~unnamed0~0~true_9=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:15:48,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:48,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:48,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:48,375 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:48,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-11-19 14:15:48,377 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:48,377 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:48,403 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:15:48,403 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_9=0} Honda state: {v_rep~unnamed0~0~false_9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:15:48,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2024-11-19 14:15:48,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:48,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:48,420 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:48,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-11-19 14:15:48,422 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:15:48,422 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:48,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2024-11-19 14:15:48,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:48,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:48,445 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:48,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-11-19 14:15:48,447 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:15:48,447 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:15:48,484 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:15:48,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:48,489 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:15:48,489 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:15:48,489 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:15:48,490 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:15:48,490 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:15:48,490 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:48,490 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:15:48,490 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:15:48,490 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration5_Loop [2024-11-19 14:15:48,490 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:15:48,490 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:15:48,492 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:48,494 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:48,498 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:15:48,530 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:15:48,530 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:15:48,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:48,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:48,532 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:48,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-11-19 14:15:48,533 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 [2024-11-19 14:15:48,543 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:48,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:48,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:48,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:48,545 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:15:48,545 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:15:48,548 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:15:48,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:48,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:48,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:48,565 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:48,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-11-19 14:15:48,567 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 [2024-11-19 14:15:48,579 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:48,580 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:48,580 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:48,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:48,582 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:15:48,582 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:15:48,585 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:15:48,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2024-11-19 14:15:48,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:48,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:48,601 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:48,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-11-19 14:15:48,603 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:15:48,615 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:15:48,615 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:15:48,615 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:15:48,616 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:15:48,616 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:15:48,617 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:15:48,617 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:15:48,619 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:15:48,621 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 14:15:48,621 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-19 14:15:48,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:15:48,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:48,623 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:15:48,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-11-19 14:15:48,625 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:15:48,625 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:15:48,625 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:15:48,625 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 99 Supporting invariants [] [2024-11-19 14:15:48,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:48,641 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:15:48,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:48,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:48,674 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:15:48,675 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:48,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:48,710 WARN L253 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:15:48,710 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:48,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:15:48,722 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 [2024-11-19 14:15:48,722 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:48,732 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 38 states and 42 transitions. Complement of second has 5 states. [2024-11-19 14:15:48,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-19 14:15:48,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:48,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2024-11-19 14:15:48,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 25 letters. Loop has 2 letters. [2024-11-19 14:15:48,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:48,734 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:15:48,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:48,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:48,755 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:15:48,756 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:48,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:48,781 WARN L253 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:15:48,781 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:48,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:15:48,796 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-19 14:15:48,796 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:48,811 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 39 states and 43 transitions. Complement of second has 5 states. [2024-11-19 14:15:48,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-19 14:15:48,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:48,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2024-11-19 14:15:48,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 25 letters. Loop has 2 letters. [2024-11-19 14:15:48,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:48,812 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:15:48,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:48,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:48,837 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:15:48,838 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:48,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:15:48,873 WARN L253 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:15:48,873 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:48,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:15:48,888 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-19 14:15:48,888 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:48,902 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 40 states and 45 transitions. Complement of second has 4 states. [2024-11-19 14:15:48,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-19 14:15:48,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:48,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2024-11-19 14:15:48,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 25 letters. Loop has 2 letters. [2024-11-19 14:15:48,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:48,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 27 letters. Loop has 2 letters. [2024-11-19 14:15:48,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:48,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 25 letters. Loop has 4 letters. [2024-11-19 14:15:48,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:15:48,906 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 45 transitions. [2024-11-19 14:15:48,907 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-11-19 14:15:48,907 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 29 states and 32 transitions. [2024-11-19 14:15:48,908 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2024-11-19 14:15:48,908 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2024-11-19 14:15:48,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 32 transitions. [2024-11-19 14:15:48,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:15:48,908 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 32 transitions. [2024-11-19 14:15:48,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 32 transitions. [2024-11-19 14:15:48,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2024-11-19 14:15:48,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 25 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:48,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2024-11-19 14:15:48,910 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 28 transitions. [2024-11-19 14:15:48,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:15:48,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-19 14:15:48,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2024-11-19 14:15:48,912 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 24 states, 24 states have (on average 2.0) internal successors, (48), 24 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:48,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:15:48,988 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2024-11-19 14:15:48,988 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 65 transitions. [2024-11-19 14:15:48,990 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-19 14:15:48,992 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 51 states and 53 transitions. [2024-11-19 14:15:48,993 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2024-11-19 14:15:48,993 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2024-11-19 14:15:48,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 53 transitions. [2024-11-19 14:15:48,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:15:48,993 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 53 transitions. [2024-11-19 14:15:48,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 53 transitions. [2024-11-19 14:15:48,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2024-11-19 14:15:48,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.04) internal successors, (52), 49 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:48,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2024-11-19 14:15:48,998 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 52 transitions. [2024-11-19 14:15:48,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-19 14:15:48,999 INFO L425 stractBuchiCegarLoop]: Abstraction has 50 states and 52 transitions. [2024-11-19 14:15:48,999 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-19 14:15:49,000 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 52 transitions. [2024-11-19 14:15:49,000 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-19 14:15:49,001 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:15:49,001 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:15:49,002 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [24, 22, 1, 1, 1] [2024-11-19 14:15:49,003 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2024-11-19 14:15:49,003 INFO L745 eck$LassoCheckResult]: Stem: 1323#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 1324#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; 1317#L10-2 assume !!(main_~i~0#1 < 100); 1318#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1321#L10-2 assume !!(main_~i~0#1 < 100); 1322#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1319#L10-2 assume !!(main_~i~0#1 < 100); 1320#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1366#L10-2 assume !!(main_~i~0#1 < 100); 1365#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1364#L10-2 assume !!(main_~i~0#1 < 100); 1363#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1362#L10-2 assume !!(main_~i~0#1 < 100); 1361#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1360#L10-2 assume !!(main_~i~0#1 < 100); 1359#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1358#L10-2 assume !!(main_~i~0#1 < 100); 1357#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1356#L10-2 assume !!(main_~i~0#1 < 100); 1355#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1354#L10-2 assume !!(main_~i~0#1 < 100); 1353#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1352#L10-2 assume !!(main_~i~0#1 < 100); 1351#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1350#L10-2 assume !!(main_~i~0#1 < 100); 1349#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1348#L10-2 assume !!(main_~i~0#1 < 100); 1347#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1346#L10-2 assume !!(main_~i~0#1 < 100); 1345#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1344#L10-2 assume !!(main_~i~0#1 < 100); 1343#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1342#L10-2 assume !!(main_~i~0#1 < 100); 1341#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1340#L10-2 assume !!(main_~i~0#1 < 100); 1339#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1338#L10-2 assume !!(main_~i~0#1 < 100); 1337#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1336#L10-2 assume !!(main_~i~0#1 < 100); 1335#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1334#L10-2 assume !!(main_~i~0#1 < 100); 1333#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1332#L10-2 assume !!(main_~i~0#1 < 100); 1331#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1330#L10-2 assume !!(main_~i~0#1 < 100); 1329#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1328#L10-2 assume !!(main_~i~0#1 < 100); 1326#L10 assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1; 1325#L10-2 assume !!(main_~i~0#1 < 100); 1327#L10 [2024-11-19 14:15:49,003 INFO L747 eck$LassoCheckResult]: Loop: 1327#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1328#L10-2 assume !!(main_~i~0#1 < 100); 1326#L10 assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1; 1325#L10-2 assume !!(main_~i~0#1 < 100); 1327#L10 [2024-11-19 14:15:49,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:49,004 INFO L85 PathProgramCache]: Analyzing trace with hash -694298463, now seen corresponding path program 4 times [2024-11-19 14:15:49,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:49,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898694083] [2024-11-19 14:15:49,004 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:15:49,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:49,023 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:15:49,023 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:15:49,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2024-11-19 14:15:49,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2024-11-19 14:15:49,543 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 23 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:15:49,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:15:49,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898694083] [2024-11-19 14:15:49,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898694083] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:15:49,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139414510] [2024-11-19 14:15:49,543 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:15:49,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:15:49,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:49,545 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:15:49,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2024-11-19 14:15:49,595 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:15:49,595 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:15:49,596 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-19 14:15:49,598 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:49,690 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 23 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:15:49,690 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:15:50,431 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 23 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:15:50,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139414510] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:15:50,432 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:15:50,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 48 [2024-11-19 14:15:50,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384884255] [2024-11-19 14:15:50,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:15:50,432 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:15:50,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:50,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1351673, now seen corresponding path program 1 times [2024-11-19 14:15:50,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:50,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715342329] [2024-11-19 14:15:50,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:15:50,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:50,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:50,436 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:50,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:50,437 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:50,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:15:50,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-19 14:15:50,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2024-11-19 14:15:50,467 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. cyclomatic complexity: 3 Second operand has 48 states, 48 states have (on average 2.0) internal successors, (96), 48 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:50,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:15:50,597 INFO L93 Difference]: Finished difference Result 123 states and 125 transitions. [2024-11-19 14:15:50,597 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 125 transitions. [2024-11-19 14:15:50,599 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-19 14:15:50,600 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 99 states and 101 transitions. [2024-11-19 14:15:50,600 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2024-11-19 14:15:50,600 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2024-11-19 14:15:50,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 101 transitions. [2024-11-19 14:15:50,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:15:50,600 INFO L218 hiAutomatonCegarLoop]: Abstraction has 99 states and 101 transitions. [2024-11-19 14:15:50,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 101 transitions. [2024-11-19 14:15:50,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2024-11-19 14:15:50,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 98 states have (on average 1.0204081632653061) internal successors, (100), 97 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:50,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2024-11-19 14:15:50,613 INFO L240 hiAutomatonCegarLoop]: Abstraction has 98 states and 100 transitions. [2024-11-19 14:15:50,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-11-19 14:15:50,614 INFO L425 stractBuchiCegarLoop]: Abstraction has 98 states and 100 transitions. [2024-11-19 14:15:50,616 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-19 14:15:50,616 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 98 states and 100 transitions. [2024-11-19 14:15:50,617 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-19 14:15:50,620 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:15:50,620 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:15:50,622 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [48, 46, 1, 1, 1] [2024-11-19 14:15:50,622 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2024-11-19 14:15:50,622 INFO L745 eck$LassoCheckResult]: Stem: 1835#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 1836#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; 1829#L10-2 assume !!(main_~i~0#1 < 100); 1830#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1833#L10-2 assume !!(main_~i~0#1 < 100); 1834#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1831#L10-2 assume !!(main_~i~0#1 < 100); 1832#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1926#L10-2 assume !!(main_~i~0#1 < 100); 1925#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1924#L10-2 assume !!(main_~i~0#1 < 100); 1923#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1922#L10-2 assume !!(main_~i~0#1 < 100); 1921#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1920#L10-2 assume !!(main_~i~0#1 < 100); 1919#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1918#L10-2 assume !!(main_~i~0#1 < 100); 1917#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1916#L10-2 assume !!(main_~i~0#1 < 100); 1915#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1914#L10-2 assume !!(main_~i~0#1 < 100); 1913#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1912#L10-2 assume !!(main_~i~0#1 < 100); 1911#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1910#L10-2 assume !!(main_~i~0#1 < 100); 1909#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1908#L10-2 assume !!(main_~i~0#1 < 100); 1907#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1906#L10-2 assume !!(main_~i~0#1 < 100); 1905#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1904#L10-2 assume !!(main_~i~0#1 < 100); 1903#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1902#L10-2 assume !!(main_~i~0#1 < 100); 1901#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1900#L10-2 assume !!(main_~i~0#1 < 100); 1899#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1898#L10-2 assume !!(main_~i~0#1 < 100); 1897#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1896#L10-2 assume !!(main_~i~0#1 < 100); 1895#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1894#L10-2 assume !!(main_~i~0#1 < 100); 1893#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1892#L10-2 assume !!(main_~i~0#1 < 100); 1891#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1890#L10-2 assume !!(main_~i~0#1 < 100); 1889#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1888#L10-2 assume !!(main_~i~0#1 < 100); 1887#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1886#L10-2 assume !!(main_~i~0#1 < 100); 1885#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1884#L10-2 assume !!(main_~i~0#1 < 100); 1883#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1882#L10-2 assume !!(main_~i~0#1 < 100); 1881#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1880#L10-2 assume !!(main_~i~0#1 < 100); 1879#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1878#L10-2 assume !!(main_~i~0#1 < 100); 1877#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1876#L10-2 assume !!(main_~i~0#1 < 100); 1875#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1874#L10-2 assume !!(main_~i~0#1 < 100); 1873#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1872#L10-2 assume !!(main_~i~0#1 < 100); 1871#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1870#L10-2 assume !!(main_~i~0#1 < 100); 1869#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1868#L10-2 assume !!(main_~i~0#1 < 100); 1867#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1866#L10-2 assume !!(main_~i~0#1 < 100); 1865#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1864#L10-2 assume !!(main_~i~0#1 < 100); 1863#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1862#L10-2 assume !!(main_~i~0#1 < 100); 1861#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1860#L10-2 assume !!(main_~i~0#1 < 100); 1859#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1858#L10-2 assume !!(main_~i~0#1 < 100); 1857#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1856#L10-2 assume !!(main_~i~0#1 < 100); 1855#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1854#L10-2 assume !!(main_~i~0#1 < 100); 1853#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1852#L10-2 assume !!(main_~i~0#1 < 100); 1851#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1850#L10-2 assume !!(main_~i~0#1 < 100); 1849#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1848#L10-2 assume !!(main_~i~0#1 < 100); 1847#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1846#L10-2 assume !!(main_~i~0#1 < 100); 1845#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1844#L10-2 assume !!(main_~i~0#1 < 100); 1843#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1842#L10-2 assume !!(main_~i~0#1 < 100); 1841#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1840#L10-2 assume !!(main_~i~0#1 < 100); 1838#L10 assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1; 1837#L10-2 assume !!(main_~i~0#1 < 100); 1839#L10 [2024-11-19 14:15:50,625 INFO L747 eck$LassoCheckResult]: Loop: 1839#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1840#L10-2 assume !!(main_~i~0#1 < 100); 1838#L10 assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1; 1837#L10-2 assume !!(main_~i~0#1 < 100); 1839#L10 [2024-11-19 14:15:50,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:50,625 INFO L85 PathProgramCache]: Analyzing trace with hash -818401447, now seen corresponding path program 5 times [2024-11-19 14:15:50,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:50,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19753694] [2024-11-19 14:15:50,626 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:15:50,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:50,706 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2024-11-19 14:15:50,709 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:15:52,145 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 47 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:15:52,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:15:52,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19753694] [2024-11-19 14:15:52,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19753694] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:15:52,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984285995] [2024-11-19 14:15:52,146 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:15:52,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:15:52,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:15:52,148 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:15:52,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2024-11-19 14:15:52,220 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2024-11-19 14:15:52,220 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:15:52,222 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-19 14:15:52,228 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:15:52,395 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 47 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:15:52,395 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:15:53,552 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 47 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:15:53,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984285995] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:15:53,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:15:53,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 52 [2024-11-19 14:15:53,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440177464] [2024-11-19 14:15:53,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:15:53,553 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:15:53,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:53,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1351673, now seen corresponding path program 2 times [2024-11-19 14:15:53,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:53,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603200027] [2024-11-19 14:15:53,554 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:15:53,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:53,557 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:15:53,557 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:15:53,557 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:53,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:53,559 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:53,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:15:53,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-19 14:15:53,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2024-11-19 14:15:53,586 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. cyclomatic complexity: 3 Second operand has 52 states, 52 states have (on average 2.019230769230769) internal successors, (105), 52 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:53,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:15:53,704 INFO L93 Difference]: Finished difference Result 111 states and 113 transitions. [2024-11-19 14:15:53,705 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111 states and 113 transitions. [2024-11-19 14:15:53,706 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-19 14:15:53,706 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111 states to 107 states and 109 transitions. [2024-11-19 14:15:53,706 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2024-11-19 14:15:53,707 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2024-11-19 14:15:53,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 109 transitions. [2024-11-19 14:15:53,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:15:53,707 INFO L218 hiAutomatonCegarLoop]: Abstraction has 107 states and 109 transitions. [2024-11-19 14:15:53,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 109 transitions. [2024-11-19 14:15:53,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2024-11-19 14:15:53,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 106 states have (on average 1.0188679245283019) internal successors, (108), 105 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:15:53,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 108 transitions. [2024-11-19 14:15:53,716 INFO L240 hiAutomatonCegarLoop]: Abstraction has 106 states and 108 transitions. [2024-11-19 14:15:53,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-11-19 14:15:53,717 INFO L425 stractBuchiCegarLoop]: Abstraction has 106 states and 108 transitions. [2024-11-19 14:15:53,717 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-19 14:15:53,717 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 108 transitions. [2024-11-19 14:15:53,718 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-19 14:15:53,718 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:15:53,718 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:15:53,720 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [52, 50, 1, 1, 1] [2024-11-19 14:15:53,721 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2024-11-19 14:15:53,723 INFO L745 eck$LassoCheckResult]: Stem: 2675#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 2676#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; 2669#L10-2 assume !!(main_~i~0#1 < 100); 2670#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2673#L10-2 assume !!(main_~i~0#1 < 100); 2674#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2671#L10-2 assume !!(main_~i~0#1 < 100); 2672#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2774#L10-2 assume !!(main_~i~0#1 < 100); 2773#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2772#L10-2 assume !!(main_~i~0#1 < 100); 2771#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2770#L10-2 assume !!(main_~i~0#1 < 100); 2769#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2768#L10-2 assume !!(main_~i~0#1 < 100); 2767#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2766#L10-2 assume !!(main_~i~0#1 < 100); 2765#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2764#L10-2 assume !!(main_~i~0#1 < 100); 2763#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2762#L10-2 assume !!(main_~i~0#1 < 100); 2761#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2760#L10-2 assume !!(main_~i~0#1 < 100); 2759#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2758#L10-2 assume !!(main_~i~0#1 < 100); 2757#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2756#L10-2 assume !!(main_~i~0#1 < 100); 2755#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2754#L10-2 assume !!(main_~i~0#1 < 100); 2753#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2752#L10-2 assume !!(main_~i~0#1 < 100); 2751#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2750#L10-2 assume !!(main_~i~0#1 < 100); 2749#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2748#L10-2 assume !!(main_~i~0#1 < 100); 2747#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2746#L10-2 assume !!(main_~i~0#1 < 100); 2745#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2744#L10-2 assume !!(main_~i~0#1 < 100); 2743#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2742#L10-2 assume !!(main_~i~0#1 < 100); 2741#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2740#L10-2 assume !!(main_~i~0#1 < 100); 2739#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2738#L10-2 assume !!(main_~i~0#1 < 100); 2737#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2736#L10-2 assume !!(main_~i~0#1 < 100); 2735#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2734#L10-2 assume !!(main_~i~0#1 < 100); 2733#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2732#L10-2 assume !!(main_~i~0#1 < 100); 2731#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2730#L10-2 assume !!(main_~i~0#1 < 100); 2729#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2728#L10-2 assume !!(main_~i~0#1 < 100); 2727#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2726#L10-2 assume !!(main_~i~0#1 < 100); 2725#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2724#L10-2 assume !!(main_~i~0#1 < 100); 2723#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2722#L10-2 assume !!(main_~i~0#1 < 100); 2721#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2720#L10-2 assume !!(main_~i~0#1 < 100); 2719#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2718#L10-2 assume !!(main_~i~0#1 < 100); 2717#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2716#L10-2 assume !!(main_~i~0#1 < 100); 2715#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2714#L10-2 assume !!(main_~i~0#1 < 100); 2713#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2712#L10-2 assume !!(main_~i~0#1 < 100); 2711#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2710#L10-2 assume !!(main_~i~0#1 < 100); 2709#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2708#L10-2 assume !!(main_~i~0#1 < 100); 2707#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2706#L10-2 assume !!(main_~i~0#1 < 100); 2705#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2704#L10-2 assume !!(main_~i~0#1 < 100); 2703#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2702#L10-2 assume !!(main_~i~0#1 < 100); 2701#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2700#L10-2 assume !!(main_~i~0#1 < 100); 2699#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2698#L10-2 assume !!(main_~i~0#1 < 100); 2697#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2696#L10-2 assume !!(main_~i~0#1 < 100); 2695#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2694#L10-2 assume !!(main_~i~0#1 < 100); 2693#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2692#L10-2 assume !!(main_~i~0#1 < 100); 2691#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2690#L10-2 assume !!(main_~i~0#1 < 100); 2689#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2688#L10-2 assume !!(main_~i~0#1 < 100); 2687#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2686#L10-2 assume !!(main_~i~0#1 < 100); 2685#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2684#L10-2 assume !!(main_~i~0#1 < 100); 2683#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2682#L10-2 assume !!(main_~i~0#1 < 100); 2681#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2680#L10-2 assume !!(main_~i~0#1 < 100); 2678#L10 assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1; 2677#L10-2 assume !!(main_~i~0#1 < 100); 2679#L10 [2024-11-19 14:15:53,724 INFO L747 eck$LassoCheckResult]: Loop: 2679#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2680#L10-2 assume !!(main_~i~0#1 < 100); 2678#L10 assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1; 2677#L10-2 assume !!(main_~i~0#1 < 100); 2679#L10 [2024-11-19 14:15:53,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:53,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1468745677, now seen corresponding path program 6 times [2024-11-19 14:15:53,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:53,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538466087] [2024-11-19 14:15:53,724 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 14:15:53,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:53,758 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 52 check-sat command(s) [2024-11-19 14:15:53,758 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:15:53,758 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:53,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:53,781 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:53,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:53,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1351673, now seen corresponding path program 3 times [2024-11-19 14:15:53,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:53,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710865641] [2024-11-19 14:15:53,782 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:15:53,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:53,785 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-19 14:15:53,785 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:15:53,785 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:53,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:53,787 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:53,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:15:53,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1914756667, now seen corresponding path program 7 times [2024-11-19 14:15:53,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:15:53,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402068417] [2024-11-19 14:15:53,788 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-19 14:15:53,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:15:53,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:53,808 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:53,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:53,831 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:15:55,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:55,106 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:15:55,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:15:55,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.11 02:15:55 BoogieIcfgContainer [2024-11-19 14:15:55,191 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-19 14:15:55,192 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 14:15:55,192 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 14:15:55,192 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 14:15:55,193 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:15:44" (3/4) ... [2024-11-19 14:15:55,194 INFO L139 WitnessPrinter]: Generating witness for non-termination counterexample [2024-11-19 14:15:55,248 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 14:15:55,248 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 14:15:55,248 INFO L158 Benchmark]: Toolchain (without parser) took 10998.44ms. Allocated memory was 174.1MB in the beginning and 270.5MB in the end (delta: 96.5MB). Free memory was 125.7MB in the beginning and 202.2MB in the end (delta: -76.5MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. [2024-11-19 14:15:55,249 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 174.1MB. Free memory is still 142.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 14:15:55,249 INFO L158 Benchmark]: CACSL2BoogieTranslator took 230.72ms. Allocated memory is still 174.1MB. Free memory was 125.7MB in the beginning and 114.5MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-19 14:15:55,249 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.53ms. Allocated memory is still 174.1MB. Free memory was 114.5MB in the beginning and 113.3MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 14:15:55,249 INFO L158 Benchmark]: Boogie Preprocessor took 23.99ms. Allocated memory is still 174.1MB. Free memory was 113.3MB in the beginning and 111.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 14:15:55,250 INFO L158 Benchmark]: RCFGBuilder took 193.32ms. Allocated memory is still 174.1MB. Free memory was 111.7MB in the beginning and 103.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-19 14:15:55,250 INFO L158 Benchmark]: BuchiAutomizer took 10463.20ms. Allocated memory was 174.1MB in the beginning and 270.5MB in the end (delta: 96.5MB). Free memory was 103.0MB in the beginning and 206.4MB in the end (delta: -103.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 14:15:55,250 INFO L158 Benchmark]: Witness Printer took 56.16ms. Allocated memory is still 270.5MB. Free memory was 206.4MB in the beginning and 202.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 14:15:55,252 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.42ms. Allocated memory is still 174.1MB. Free memory is still 142.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 230.72ms. Allocated memory is still 174.1MB. Free memory was 125.7MB in the beginning and 114.5MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.53ms. Allocated memory is still 174.1MB. Free memory was 114.5MB in the beginning and 113.3MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.99ms. Allocated memory is still 174.1MB. Free memory was 113.3MB in the beginning and 111.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 193.32ms. Allocated memory is still 174.1MB. Free memory was 111.7MB in the beginning and 103.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 10463.20ms. Allocated memory was 174.1MB in the beginning and 270.5MB in the end (delta: 96.5MB). Free memory was 103.0MB in the beginning and 206.4MB in the end (delta: -103.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 56.16ms. Allocated memory is still 270.5MB. Free memory was 206.4MB in the beginning and 202.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (6 trivial, 3 deterministic, 2 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function i and consists of 3 locations. One deterministic module has affine ranking function (((long) -2 * i) + 99) and consists of 3 locations. One nondeterministic module has affine ranking function i and consists of 3 locations. One nondeterministic module has affine ranking function (((long) -2 * i) + 99) and consists of 3 locations. 6 modules have a trivial ranking function, the largest among these consists of 52 locations. The remainder module has 106 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.3s and 8 iterations. TraceHistogramMax:52. Analysis of lassos took 9.0s. Construction of modules took 0.3s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 9. Automata minimization 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 9 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 44 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 35 mSDsluCounter, 73 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22 mSDsCounter, 62 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 352 IncrementalHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62 mSolverCounterUnsat, 51 mSDtfsCounter, 352 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT1 conc0 concLT3 SILN2 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital11 mio100 ax203 hnf100 lsp49 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq151 hnf94 smp100 dnf100 smp100 tf112 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 38ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 10]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L6] int i; [L7] i = 0 VAL [i=0] [L9] COND TRUE i < 100 VAL [i=0] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=1] [L9] COND TRUE i < 100 VAL [i=1] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=2] [L9] COND TRUE i < 100 VAL [i=2] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=3] [L9] COND TRUE i < 100 VAL [i=3] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=4] [L9] COND TRUE i < 100 VAL [i=4] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=5] [L9] COND TRUE i < 100 VAL [i=5] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=6] [L9] COND TRUE i < 100 VAL [i=6] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=7] [L9] COND TRUE i < 100 VAL [i=7] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=8] [L9] COND TRUE i < 100 VAL [i=8] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=9] [L9] COND TRUE i < 100 VAL [i=9] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=10] [L9] COND TRUE i < 100 VAL [i=10] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=11] [L9] COND TRUE i < 100 VAL [i=11] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=12] [L9] COND TRUE i < 100 VAL [i=12] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=13] [L9] COND TRUE i < 100 VAL [i=13] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=14] [L9] COND TRUE i < 100 VAL [i=14] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=15] [L9] COND TRUE i < 100 VAL [i=15] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=16] [L9] COND TRUE i < 100 VAL [i=16] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=17] [L9] COND TRUE i < 100 VAL [i=17] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=18] [L9] COND TRUE i < 100 VAL [i=18] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=19] [L9] COND TRUE i < 100 VAL [i=19] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=20] [L9] COND TRUE i < 100 VAL [i=20] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=21] [L9] COND TRUE i < 100 VAL [i=21] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=22] [L9] COND TRUE i < 100 VAL [i=22] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=23] [L9] COND TRUE i < 100 VAL [i=23] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=24] [L9] COND TRUE i < 100 VAL [i=24] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=25] [L9] COND TRUE i < 100 VAL [i=25] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=26] [L9] COND TRUE i < 100 VAL [i=26] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=27] [L9] COND TRUE i < 100 VAL [i=27] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=28] [L9] COND TRUE i < 100 VAL [i=28] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=29] [L9] COND TRUE i < 100 VAL [i=29] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=30] [L9] COND TRUE i < 100 VAL [i=30] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=31] [L9] COND TRUE i < 100 VAL [i=31] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=32] [L9] COND TRUE i < 100 VAL [i=32] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=33] [L9] COND TRUE i < 100 VAL [i=33] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=34] [L9] COND TRUE i < 100 VAL [i=34] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=35] [L9] COND TRUE i < 100 VAL [i=35] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=36] [L9] COND TRUE i < 100 VAL [i=36] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=37] [L9] COND TRUE i < 100 VAL [i=37] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=38] [L9] COND TRUE i < 100 VAL [i=38] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=39] [L9] COND TRUE i < 100 VAL [i=39] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=40] [L9] COND TRUE i < 100 VAL [i=40] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=41] [L9] COND TRUE i < 100 VAL [i=41] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=42] [L9] COND TRUE i < 100 VAL [i=42] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=43] [L9] COND TRUE i < 100 VAL [i=43] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=44] [L9] COND TRUE i < 100 VAL [i=44] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=45] [L9] COND TRUE i < 100 VAL [i=45] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=46] [L9] COND TRUE i < 100 VAL [i=46] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=47] [L9] COND TRUE i < 100 VAL [i=47] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=48] [L9] COND TRUE i < 100 VAL [i=48] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=49] [L9] COND TRUE i < 100 VAL [i=49] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=50] [L9] COND TRUE i < 100 VAL [i=50] [L10] COND FALSE !(i < 50) [L11] i = i-1 VAL [i=49] [L9] COND TRUE i < 100 VAL [i=49] Loop: [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND FALSE !(i < 50) [L11] i = i-1 [L9] COND TRUE i < 100 End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 10]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] i = 0 VAL [i=0] [L9] COND TRUE i < 100 VAL [i=0] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=1] [L9] COND TRUE i < 100 VAL [i=1] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=2] [L9] COND TRUE i < 100 VAL [i=2] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=3] [L9] COND TRUE i < 100 VAL [i=3] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=4] [L9] COND TRUE i < 100 VAL [i=4] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=5] [L9] COND TRUE i < 100 VAL [i=5] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=6] [L9] COND TRUE i < 100 VAL [i=6] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=7] [L9] COND TRUE i < 100 VAL [i=7] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=8] [L9] COND TRUE i < 100 VAL [i=8] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=9] [L9] COND TRUE i < 100 VAL [i=9] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=10] [L9] COND TRUE i < 100 VAL [i=10] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=11] [L9] COND TRUE i < 100 VAL [i=11] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=12] [L9] COND TRUE i < 100 VAL [i=12] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=13] [L9] COND TRUE i < 100 VAL [i=13] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=14] [L9] COND TRUE i < 100 VAL [i=14] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=15] [L9] COND TRUE i < 100 VAL [i=15] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=16] [L9] COND TRUE i < 100 VAL [i=16] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=17] [L9] COND TRUE i < 100 VAL [i=17] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=18] [L9] COND TRUE i < 100 VAL [i=18] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=19] [L9] COND TRUE i < 100 VAL [i=19] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=20] [L9] COND TRUE i < 100 VAL [i=20] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=21] [L9] COND TRUE i < 100 VAL [i=21] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=22] [L9] COND TRUE i < 100 VAL [i=22] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=23] [L9] COND TRUE i < 100 VAL [i=23] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=24] [L9] COND TRUE i < 100 VAL [i=24] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=25] [L9] COND TRUE i < 100 VAL [i=25] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=26] [L9] COND TRUE i < 100 VAL [i=26] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=27] [L9] COND TRUE i < 100 VAL [i=27] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=28] [L9] COND TRUE i < 100 VAL [i=28] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=29] [L9] COND TRUE i < 100 VAL [i=29] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=30] [L9] COND TRUE i < 100 VAL [i=30] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=31] [L9] COND TRUE i < 100 VAL [i=31] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=32] [L9] COND TRUE i < 100 VAL [i=32] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=33] [L9] COND TRUE i < 100 VAL [i=33] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=34] [L9] COND TRUE i < 100 VAL [i=34] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=35] [L9] COND TRUE i < 100 VAL [i=35] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=36] [L9] COND TRUE i < 100 VAL [i=36] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=37] [L9] COND TRUE i < 100 VAL [i=37] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=38] [L9] COND TRUE i < 100 VAL [i=38] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=39] [L9] COND TRUE i < 100 VAL [i=39] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=40] [L9] COND TRUE i < 100 VAL [i=40] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=41] [L9] COND TRUE i < 100 VAL [i=41] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=42] [L9] COND TRUE i < 100 VAL [i=42] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=43] [L9] COND TRUE i < 100 VAL [i=43] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=44] [L9] COND TRUE i < 100 VAL [i=44] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=45] [L9] COND TRUE i < 100 VAL [i=45] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=46] [L9] COND TRUE i < 100 VAL [i=46] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=47] [L9] COND TRUE i < 100 VAL [i=47] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=48] [L9] COND TRUE i < 100 VAL [i=48] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=49] [L9] COND TRUE i < 100 VAL [i=49] [L10] COND TRUE i < 50 [L10] i = i+1 VAL [i=50] [L9] COND TRUE i < 100 VAL [i=50] [L10] COND FALSE !(i < 50) [L11] i = i-1 VAL [i=49] [L9] COND TRUE i < 100 VAL [i=49] Loop: [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND FALSE !(i < 50) [L11] i = i-1 [L9] COND TRUE i < 100 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-11-19 14:15:55,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:55,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:55,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2024-11-19 14:15:55,878 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-19 14:15:56,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-19 14:15:56,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)