./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/loop-lit/mcmillan2006_true-unreach-call_true-termination.c.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_74195b60-c9e8-4438-9d41-6b835b260381/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_74195b60-c9e8-4438-9d41-6b835b260381/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_74195b60-c9e8-4438-9d41-6b835b260381/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_74195b60-c9e8-4438-9d41-6b835b260381/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loop-lit/mcmillan2006_true-unreach-call_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_74195b60-c9e8-4438-9d41-6b835b260381/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_74195b60-c9e8-4438-9d41-6b835b260381/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --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 32bit --witnessprinter.graph.data.programhash 025e0289c8e9b33528493c96bf0a22ba3200731b ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 03:46:13,617 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 03:46:13,618 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 03:46:13,626 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 03:46:13,627 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 03:46:13,627 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 03:46:13,628 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 03:46:13,629 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 03:46:13,631 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 03:46:13,631 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 03:46:13,632 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 03:46:13,632 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 03:46:13,633 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 03:46:13,633 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 03:46:13,634 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 03:46:13,635 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 03:46:13,635 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 03:46:13,636 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 03:46:13,638 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 03:46:13,639 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 03:46:13,639 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 03:46:13,640 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 03:46:13,642 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 03:46:13,642 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 03:46:13,642 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 03:46:13,643 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 03:46:13,643 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 03:46:13,644 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 03:46:13,644 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 03:46:13,645 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 03:46:13,645 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 03:46:13,646 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 03:46:13,646 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 03:46:13,646 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 03:46:13,647 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 03:46:13,647 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 03:46:13,647 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_74195b60-c9e8-4438-9d41-6b835b260381/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 03:46:13,658 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 03:46:13,658 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 03:46:13,659 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 03:46:13,659 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 03:46:13,659 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 03:46:13,660 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 03:46:13,660 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 03:46:13,660 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 03:46:13,660 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 03:46:13,660 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 03:46:13,660 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 03:46:13,660 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 03:46:13,661 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 03:46:13,661 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 03:46:13,661 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 03:46:13,661 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 03:46:13,661 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 03:46:13,661 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 03:46:13,661 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 03:46:13,662 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 03:46:13,662 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 03:46:13,662 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 03:46:13,662 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 03:46:13,662 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 03:46:13,662 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 03:46:13,662 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 03:46:13,663 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 03:46:13,663 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 03:46:13,663 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 03:46:13,663 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 03:46:13,664 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 03:46:13,664 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_74195b60-c9e8-4438-9d41-6b835b260381/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 025e0289c8e9b33528493c96bf0a22ba3200731b [2018-11-10 03:46:13,686 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 03:46:13,695 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 03:46:13,697 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 03:46:13,699 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 03:46:13,699 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 03:46:13,699 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_74195b60-c9e8-4438-9d41-6b835b260381/bin-2019/uautomizer/../../sv-benchmarks/c/loop-lit/mcmillan2006_true-unreach-call_true-termination.c.i [2018-11-10 03:46:13,742 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_74195b60-c9e8-4438-9d41-6b835b260381/bin-2019/uautomizer/data/6373b3dbf/c83a346196a0412383c76db6a2312828/FLAGab535cccc [2018-11-10 03:46:14,066 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 03:46:14,066 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_74195b60-c9e8-4438-9d41-6b835b260381/sv-benchmarks/c/loop-lit/mcmillan2006_true-unreach-call_true-termination.c.i [2018-11-10 03:46:14,070 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_74195b60-c9e8-4438-9d41-6b835b260381/bin-2019/uautomizer/data/6373b3dbf/c83a346196a0412383c76db6a2312828/FLAGab535cccc [2018-11-10 03:46:14,078 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_74195b60-c9e8-4438-9d41-6b835b260381/bin-2019/uautomizer/data/6373b3dbf/c83a346196a0412383c76db6a2312828 [2018-11-10 03:46:14,080 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 03:46:14,081 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 03:46:14,081 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 03:46:14,081 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 03:46:14,083 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 03:46:14,084 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:46:14" (1/1) ... [2018-11-10 03:46:14,085 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@769b41f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:14, skipping insertion in model container [2018-11-10 03:46:14,085 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:46:14" (1/1) ... [2018-11-10 03:46:14,091 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 03:46:14,101 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 03:46:14,190 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:46:14,196 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 03:46:14,205 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:46:14,216 INFO L193 MainTranslator]: Completed translation [2018-11-10 03:46:14,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:14 WrapperNode [2018-11-10 03:46:14,216 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 03:46:14,217 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 03:46:14,217 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 03:46:14,217 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 03:46:14,221 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:14" (1/1) ... [2018-11-10 03:46:14,228 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:14" (1/1) ... [2018-11-10 03:46:14,238 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 03:46:14,239 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 03:46:14,239 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 03:46:14,239 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 03:46:14,244 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:14" (1/1) ... [2018-11-10 03:46:14,244 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:14" (1/1) ... [2018-11-10 03:46:14,245 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:14" (1/1) ... [2018-11-10 03:46:14,245 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:14" (1/1) ... [2018-11-10 03:46:14,248 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:14" (1/1) ... [2018-11-10 03:46:14,251 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:14" (1/1) ... [2018-11-10 03:46:14,252 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:14" (1/1) ... [2018-11-10 03:46:14,253 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 03:46:14,253 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 03:46:14,253 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 03:46:14,254 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 03:46:14,254 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74195b60-c9e8-4438-9d41-6b835b260381/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:46:14,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 03:46:14,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 03:46:14,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 03:46:14,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 03:46:14,475 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 03:46:14,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:46:14 BoogieIcfgContainer [2018-11-10 03:46:14,476 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 03:46:14,476 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 03:46:14,476 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 03:46:14,478 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 03:46:14,479 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 03:46:14,479 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 03:46:14" (1/3) ... [2018-11-10 03:46:14,480 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@bceb914 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 03:46:14, skipping insertion in model container [2018-11-10 03:46:14,480 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 03:46:14,480 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:14" (2/3) ... [2018-11-10 03:46:14,480 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@bceb914 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 03:46:14, skipping insertion in model container [2018-11-10 03:46:14,480 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 03:46:14,480 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:46:14" (3/3) ... [2018-11-10 03:46:14,482 INFO L375 chiAutomizerObserver]: Analyzing ICFG mcmillan2006_true-unreach-call_true-termination.c.i [2018-11-10 03:46:14,525 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 03:46:14,525 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 03:46:14,525 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 03:46:14,525 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 03:46:14,525 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 03:46:14,525 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 03:46:14,525 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 03:46:14,526 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 03:46:14,526 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 03:46:14,534 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2018-11-10 03:46:14,548 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-11-10 03:46:14,548 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:46:14,548 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:46:14,552 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-10 03:46:14,552 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 03:46:14,552 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 03:46:14,552 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2018-11-10 03:46:14,553 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-11-10 03:46:14,554 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:46:14,554 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:46:14,554 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-10 03:46:14,554 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 03:46:14,559 INFO L793 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet1, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~post3, main_~i~0, main_#t~mem5, main_#t~post4, main_~i~1, main_~n~0, main_~x~0.base, main_~x~0.offset;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 21#L14true assume !!(0 <= main_~n~0 && main_~n~0 <= 1000);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;main_~i~0 := 0; 12#L16-5true [2018-11-10 03:46:14,559 INFO L795 eck$LassoCheckResult]: Loop: 12#L16-5true assume true; 3#L16-1true assume !!(main_~i~0 < main_~n~0); 17#L16-3true SUMMARY for call write~int(0, main_~x~0.base, main_~x~0.offset + main_~i~0 * 4, 4); srcloc: L16-3 14#L16-4true main_#t~post3 := main_~i~0;main_~i~0 := main_#t~post3 + 1;havoc main_#t~post3; 12#L16-5true [2018-11-10 03:46:14,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:46:14,562 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-11-10 03:46:14,564 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:46:14,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:46:14,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:14,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:46:14,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:14,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:46:14,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:46:14,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:46:14,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1267144, now seen corresponding path program 1 times [2018-11-10 03:46:14,637 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:46:14,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:46:14,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:14,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:46:14,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:14,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:46:14,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:46:14,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:46:14,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1806876907, now seen corresponding path program 1 times [2018-11-10 03:46:14,648 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:46:14,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:46:14,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:14,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:46:14,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:14,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:46:14,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:46:14,830 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:46:14,830 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:46:14,831 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:46:14,831 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:46:14,831 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:46:14,831 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:46:14,831 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:46:14,831 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:46:14,831 INFO L131 ssoRankerPreferences]: Filename of dumped script: mcmillan2006_true-unreach-call_true-termination.c.i_Iteration1_Lasso [2018-11-10 03:46:14,832 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:46:14,832 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:46:14,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:46:14,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:46:14,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:46:14,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:46:14,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:46:14,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:46:14,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:46:14,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:46:14,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:46:15,182 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:46:15,185 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:46:15,186 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:46:15,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:46:15,188 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:46:15,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:46:15,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:46:15,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:46:15,189 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:46:15,190 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:46:15,192 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:46:15,192 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:46:15,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:46:15,193 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:46:15,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:46:15,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:46:15,193 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:46:15,194 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:46:15,194 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:46:15,195 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:46:15,195 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:46:15,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:46:15,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:46:15,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:46:15,196 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:46:15,197 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:46:15,197 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:46:15,202 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:46:15,202 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:46:15,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:46:15,203 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:46:15,203 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:46:15,203 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:46:15,203 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:46:15,204 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:46:15,204 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:46:15,205 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:46:15,205 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:46:15,206 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:46:15,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:46:15,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:46:15,206 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:46:15,211 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:46:15,211 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:46:15,268 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 03:46:15,313 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-10 03:46:15,313 INFO L444 ModelExtractionUtils]: 18 out of 28 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-11-10 03:46:15,314 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 03:46:15,316 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 03:46:15,316 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 03:46:15,317 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~n~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-10 03:46:15,347 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-10 03:46:15,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:46:15,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:46:15,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:46:15,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:46:15,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:46:15,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:46:15,418 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 03:46:15,419 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states. Second operand 4 states. [2018-11-10 03:46:15,452 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states.. Second operand 4 states. Result 53 states and 62 transitions. Complement of second has 7 states. [2018-11-10 03:46:15,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 03:46:15,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 03:46:15,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2018-11-10 03:46:15,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 3 letters. Loop has 4 letters. [2018-11-10 03:46:15,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:46:15,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 7 letters. Loop has 4 letters. [2018-11-10 03:46:15,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:46:15,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 3 letters. Loop has 8 letters. [2018-11-10 03:46:15,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:46:15,459 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 62 transitions. [2018-11-10 03:46:15,461 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 03:46:15,463 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 17 states and 19 transitions. [2018-11-10 03:46:15,464 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-10 03:46:15,464 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-10 03:46:15,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2018-11-10 03:46:15,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:46:15,465 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-11-10 03:46:15,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2018-11-10 03:46:15,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-10 03:46:15,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-10 03:46:15,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-11-10 03:46:15,482 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-11-10 03:46:15,482 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-11-10 03:46:15,482 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 03:46:15,482 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2018-11-10 03:46:15,482 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 03:46:15,482 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:46:15,483 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:46:15,483 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 03:46:15,483 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:46:15,483 INFO L793 eck$LassoCheckResult]: Stem: 144#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 141#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet1, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~post3, main_~i~0, main_#t~mem5, main_#t~post4, main_~i~1, main_~n~0, main_~x~0.base, main_~x~0.offset;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 142#L14 assume !!(0 <= main_~n~0 && main_~n~0 <= 1000);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;main_~i~0 := 0; 145#L16-5 assume true; 133#L16-1 assume !(main_~i~0 < main_~n~0); 134#L16-6 main_~i~1 := 0; 143#L17-6 [2018-11-10 03:46:15,483 INFO L795 eck$LassoCheckResult]: Loop: 143#L17-6 assume true; 139#L17-1 assume !!(main_~i~1 < main_~n~0); 140#L17-3 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset + main_~i~1 * 4, 4); srcloc: L17-3 149#L17-4 assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if main_#t~mem5 == 0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 137#L5 assume !(__VERIFIER_assert_~cond == 0); 138#L5-2 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem5; 148#L17-5 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 143#L17-6 [2018-11-10 03:46:15,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:46:15,484 INFO L82 PathProgramCache]: Analyzing trace with hash 889570288, now seen corresponding path program 1 times [2018-11-10 03:46:15,484 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:46:15,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:46:15,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:15,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:46:15,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:15,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:46:15,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:46:15,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:46:15,496 INFO L82 PathProgramCache]: Analyzing trace with hash 883268676, now seen corresponding path program 1 times [2018-11-10 03:46:15,496 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:46:15,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:46:15,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:15,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:46:15,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:15,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:46:15,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:46:15,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:46:15,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1066967691, now seen corresponding path program 1 times [2018-11-10 03:46:15,505 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:46:15,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:46:15,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:15,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:46:15,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:15,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:46:15,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:46:15,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:46:15,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 03:46:15,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 03:46:15,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 03:46:15,619 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand 5 states. [2018-11-10 03:46:15,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:46:15,664 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-11-10 03:46:15,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 03:46:15,665 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 26 transitions. [2018-11-10 03:46:15,666 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 03:46:15,666 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 20 states and 21 transitions. [2018-11-10 03:46:15,666 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-10 03:46:15,666 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-10 03:46:15,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 21 transitions. [2018-11-10 03:46:15,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:46:15,667 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-10 03:46:15,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 21 transitions. [2018-11-10 03:46:15,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2018-11-10 03:46:15,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-10 03:46:15,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-11-10 03:46:15,668 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-11-10 03:46:15,669 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-11-10 03:46:15,669 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 03:46:15,669 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 18 transitions. [2018-11-10 03:46:15,669 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 03:46:15,669 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:46:15,670 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:46:15,670 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:46:15,670 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:46:15,670 INFO L793 eck$LassoCheckResult]: Stem: 200#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 197#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet1, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~post3, main_~i~0, main_#t~mem5, main_#t~post4, main_~i~1, main_~n~0, main_~x~0.base, main_~x~0.offset;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 198#L14 assume !!(0 <= main_~n~0 && main_~n~0 <= 1000);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;main_~i~0 := 0; 201#L16-5 assume true; 191#L16-1 assume !!(main_~i~0 < main_~n~0); 192#L16-3 SUMMARY for call write~int(0, main_~x~0.base, main_~x~0.offset + main_~i~0 * 4, 4); srcloc: L16-3 203#L16-4 main_#t~post3 := main_~i~0;main_~i~0 := main_#t~post3 + 1;havoc main_#t~post3; 202#L16-5 assume true; 189#L16-1 assume !(main_~i~0 < main_~n~0); 190#L16-6 main_~i~1 := 0; 199#L17-6 [2018-11-10 03:46:15,670 INFO L795 eck$LassoCheckResult]: Loop: 199#L17-6 assume true; 195#L17-1 assume !!(main_~i~1 < main_~n~0); 196#L17-3 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset + main_~i~1 * 4, 4); srcloc: L17-3 205#L17-4 assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if main_#t~mem5 == 0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 193#L5 assume !(__VERIFIER_assert_~cond == 0); 194#L5-2 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem5; 204#L17-5 main_#t~post4 := main_~i~1;main_~i~1 := main_#t~post4 + 1;havoc main_#t~post4; 199#L17-6 [2018-11-10 03:46:15,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:46:15,671 INFO L82 PathProgramCache]: Analyzing trace with hash -155173303, now seen corresponding path program 1 times [2018-11-10 03:46:15,671 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:46:15,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:46:15,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:15,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:46:15,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:15,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:46:15,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:46:15,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:46:15,685 INFO L82 PathProgramCache]: Analyzing trace with hash 883268676, now seen corresponding path program 2 times [2018-11-10 03:46:15,685 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:46:15,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:46:15,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:15,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:46:15,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:15,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:46:15,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:46:15,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:46:15,695 INFO L82 PathProgramCache]: Analyzing trace with hash -434619140, now seen corresponding path program 1 times [2018-11-10 03:46:15,695 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:46:15,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:46:15,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:15,696 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:46:15,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:46:15,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:46:15,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:46:15,906 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:46:15,907 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:46:15,907 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:46:15,907 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:46:15,907 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:46:15,907 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:46:15,907 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:46:15,907 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:46:15,907 INFO L131 ssoRankerPreferences]: Filename of dumped script: mcmillan2006_true-unreach-call_true-termination.c.i_Iteration3_Lasso [2018-11-10 03:46:15,907 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:46:15,907 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:46:15,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:46:15,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:46:15,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:46:15,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:46:15,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:46:15,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:46:16,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:46:16,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:46:16,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:46:16,179 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:46:16,180 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:46:16,180 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:46:16,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:46:16,181 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:46:16,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:46:16,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:46:16,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:46:16,181 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:46:16,181 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:46:16,182 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:46:16,182 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:46:16,182 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:46:16,182 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:46:16,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:46:16,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:46:16,185 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:46:16,185 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:46:16,186 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:46:16,186 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:46:16,187 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:46:16,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:46:16,187 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:46:16,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:46:16,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:46:16,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:46:16,188 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:46:16,188 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:46:16,188 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:46:16,189 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:46:16,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:46:16,189 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:46:16,189 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:46:16,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:46:16,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:46:16,190 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:46:16,190 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:46:16,190 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:46:16,191 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:46:16,191 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:46:16,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:46:16,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:46:16,191 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:46:16,192 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:46:16,192 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:46:16,194 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:46:16,195 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:46:16,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:46:16,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:46:16,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:46:16,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:46:16,197 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:46:16,197 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:46:16,201 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:46:16,201 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:46:16,202 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:46:16,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:46:16,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:46:16,202 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:46:16,204 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:46:16,204 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:46:16,209 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:46:16,210 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:46:16,210 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:46:16,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:46:16,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:46:16,211 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:46:16,211 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:46:16,212 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:46:16,213 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:46:16,214 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:46:16,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:46:16,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:46:16,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:46:16,214 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:46:16,215 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:46:16,215 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:46:16,218 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:46:16,218 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:46:16,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:46:16,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:46:16,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:46:16,219 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:46:16,220 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:46:16,220 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:46:16,223 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:46:16,223 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:46:16,223 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:46:16,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:46:16,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:46:16,224 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:46:16,226 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:46:16,227 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:46:16,247 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 03:46:16,275 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 03:46:16,277 INFO L444 ModelExtractionUtils]: 25 out of 31 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-10 03:46:16,277 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 03:46:16,279 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 03:46:16,279 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 03:46:16,279 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~i~1) = 1*ULTIMATE.start_main_~n~0 - 1*ULTIMATE.start_main_~i~1 Supporting invariants [] [2018-11-10 03:46:16,295 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-10 03:46:16,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:46:16,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:46:16,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:46:16,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:46:16,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:46:16,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:46:16,325 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 03:46:16,326 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 18 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-11-10 03:46:16,338 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 18 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 24 states and 26 transitions. Complement of second has 6 states. [2018-11-10 03:46:16,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 03:46:16,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 03:46:16,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-11-10 03:46:16,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 10 letters. Loop has 7 letters. [2018-11-10 03:46:16,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:46:16,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 17 letters. Loop has 7 letters. [2018-11-10 03:46:16,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:46:16,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 10 letters. Loop has 14 letters. [2018-11-10 03:46:16,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:46:16,340 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 26 transitions. [2018-11-10 03:46:16,340 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 03:46:16,341 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 0 states and 0 transitions. [2018-11-10 03:46:16,341 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 03:46:16,341 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 03:46:16,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 03:46:16,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 03:46:16,341 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 03:46:16,341 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 03:46:16,341 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 03:46:16,343 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 03:46:16,343 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 03:46:16,343 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 03:46:16,343 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 03:46:16,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 03:46:16 BoogieIcfgContainer [2018-11-10 03:46:16,348 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 03:46:16,348 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 03:46:16,348 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 03:46:16,348 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 03:46:16,349 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:46:14" (3/4) ... [2018-11-10 03:46:16,351 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 03:46:16,351 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 03:46:16,352 INFO L168 Benchmark]: Toolchain (without parser) took 2271.49 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 234.9 MB). Free memory was 958.1 MB in the beginning and 1.2 GB in the end (delta: -251.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:46:16,353 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:46:16,353 INFO L168 Benchmark]: CACSL2BoogieTranslator took 135.29 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 947.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 03:46:16,354 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.93 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 943.5 MB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 11.5 GB. [2018-11-10 03:46:16,355 INFO L168 Benchmark]: Boogie Preprocessor took 14.49 ms. Allocated memory is still 1.0 GB. Free memory is still 943.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:46:16,356 INFO L168 Benchmark]: RCFGBuilder took 222.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -195.7 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. [2018-11-10 03:46:16,356 INFO L168 Benchmark]: BuchiAutomizer took 1871.57 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 78.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -74.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 11.5 GB. [2018-11-10 03:46:16,357 INFO L168 Benchmark]: Witness Printer took 3.10 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:46:16,361 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 135.29 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 947.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.93 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 943.5 MB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.49 ms. Allocated memory is still 1.0 GB. Free memory is still 943.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 222.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -195.7 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1871.57 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 78.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -74.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.10 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function n + -1 * i and consists of 5 locations. One deterministic module has affine ranking function n + -1 * i and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.8s and 4 iterations. TraceHistogramMax:2. Analysis of lassos took 1.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 17 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 42 SDtfs, 48 SDslu, 52 SDs, 0 SdLazy, 48 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital122 mio100 ax100 hnf99 lsp92 ukn97 mio100 lsp54 div100 bol100 ite100 ukn100 eq167 hnf90 smp92 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...