./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrlcpy-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_93d75c25-9013-41b7-bb79-dca1fdb10023/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_93d75c25-9013-41b7-bb79-dca1fdb10023/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_93d75c25-9013-41b7-bb79-dca1fdb10023/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_93d75c25-9013-41b7-bb79-dca1fdb10023/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrlcpy-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_93d75c25-9013-41b7-bb79-dca1fdb10023/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_93d75c25-9013-41b7-bb79-dca1fdb10023/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 64bit --witnessprinter.graph.data.programhash 6d213bb73df5e8110170d83073afe858aea401c0 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 08:34:53,709 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 08:34:53,711 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 08:34:53,719 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 08:34:53,719 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 08:34:53,720 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 08:34:53,721 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 08:34:53,722 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 08:34:53,723 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 08:34:53,724 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 08:34:53,725 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 08:34:53,725 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 08:34:53,726 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 08:34:53,727 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 08:34:53,728 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 08:34:53,728 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 08:34:53,729 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 08:34:53,730 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 08:34:53,732 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 08:34:53,733 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 08:34:53,734 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 08:34:53,735 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 08:34:53,737 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 08:34:53,737 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 08:34:53,737 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 08:34:53,738 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 08:34:53,739 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 08:34:53,739 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 08:34:53,740 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 08:34:53,741 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 08:34:53,741 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 08:34:53,742 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 08:34:53,742 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 08:34:53,742 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 08:34:53,743 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 08:34:53,743 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 08:34:53,743 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_93d75c25-9013-41b7-bb79-dca1fdb10023/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-18 08:34:53,754 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 08:34:53,755 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 08:34:53,756 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 08:34:53,756 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 08:34:53,756 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 08:34:53,756 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 08:34:53,756 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 08:34:53,756 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 08:34:53,756 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 08:34:53,756 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 08:34:53,757 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 08:34:53,757 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 08:34:53,757 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 08:34:53,757 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 08:34:53,757 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 08:34:53,757 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 08:34:53,757 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 08:34:53,757 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 08:34:53,757 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 08:34:53,757 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 08:34:53,758 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 08:34:53,758 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 08:34:53,758 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 08:34:53,758 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 08:34:53,758 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 08:34:53,758 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 08:34:53,758 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 08:34:53,758 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 08:34:53,759 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 08:34:53,759 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_93d75c25-9013-41b7-bb79-dca1fdb10023/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6d213bb73df5e8110170d83073afe858aea401c0 [2018-11-18 08:34:53,781 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 08:34:53,790 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 08:34:53,793 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 08:34:53,794 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 08:34:53,794 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 08:34:53,795 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_93d75c25-9013-41b7-bb79-dca1fdb10023/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrlcpy-alloca_true-termination.c.i [2018-11-18 08:34:53,839 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_93d75c25-9013-41b7-bb79-dca1fdb10023/bin-2019/uautomizer/data/b758d8116/e5cf380d46514789b092cabaa672872a/FLAG99e1b1dce [2018-11-18 08:34:54,188 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 08:34:54,188 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_93d75c25-9013-41b7-bb79-dca1fdb10023/sv-benchmarks/c/termination-memory-alloca/openbsd_cstrlcpy-alloca_true-termination.c.i [2018-11-18 08:34:54,196 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_93d75c25-9013-41b7-bb79-dca1fdb10023/bin-2019/uautomizer/data/b758d8116/e5cf380d46514789b092cabaa672872a/FLAG99e1b1dce [2018-11-18 08:34:54,206 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_93d75c25-9013-41b7-bb79-dca1fdb10023/bin-2019/uautomizer/data/b758d8116/e5cf380d46514789b092cabaa672872a [2018-11-18 08:34:54,209 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 08:34:54,210 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 08:34:54,210 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 08:34:54,211 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 08:34:54,214 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 08:34:54,214 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:34:54" (1/1) ... [2018-11-18 08:34:54,217 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48892538 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:54, skipping insertion in model container [2018-11-18 08:34:54,217 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:34:54" (1/1) ... [2018-11-18 08:34:54,225 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 08:34:54,257 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 08:34:54,465 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 08:34:54,471 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 08:34:54,541 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 08:34:54,573 INFO L195 MainTranslator]: Completed translation [2018-11-18 08:34:54,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:54 WrapperNode [2018-11-18 08:34:54,573 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 08:34:54,574 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 08:34:54,574 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 08:34:54,574 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 08:34:54,581 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:54" (1/1) ... [2018-11-18 08:34:54,591 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:54" (1/1) ... [2018-11-18 08:34:54,604 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 08:34:54,605 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 08:34:54,605 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 08:34:54,605 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 08:34:54,610 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:54" (1/1) ... [2018-11-18 08:34:54,610 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:54" (1/1) ... [2018-11-18 08:34:54,612 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:54" (1/1) ... [2018-11-18 08:34:54,612 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:54" (1/1) ... [2018-11-18 08:34:54,616 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:54" (1/1) ... [2018-11-18 08:34:54,619 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:54" (1/1) ... [2018-11-18 08:34:54,620 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:54" (1/1) ... [2018-11-18 08:34:54,621 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 08:34:54,622 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 08:34:54,622 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 08:34:54,622 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 08:34:54,622 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_93d75c25-9013-41b7-bb79-dca1fdb10023/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-18 08:34:54,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 08:34:54,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 08:34:54,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 08:34:54,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 08:34:54,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 08:34:54,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 08:34:54,843 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 08:34:54,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:34:54 BoogieIcfgContainer [2018-11-18 08:34:54,843 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 08:34:54,844 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 08:34:54,844 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 08:34:54,847 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 08:34:54,848 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 08:34:54,848 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 08:34:54" (1/3) ... [2018-11-18 08:34:54,849 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5b7c2c71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 08:34:54, skipping insertion in model container [2018-11-18 08:34:54,849 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 08:34:54,849 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:54" (2/3) ... [2018-11-18 08:34:54,849 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5b7c2c71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 08:34:54, skipping insertion in model container [2018-11-18 08:34:54,849 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 08:34:54,850 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:34:54" (3/3) ... [2018-11-18 08:34:54,851 INFO L375 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrlcpy-alloca_true-termination.c.i [2018-11-18 08:34:54,891 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 08:34:54,892 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 08:34:54,892 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 08:34:54,892 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 08:34:54,892 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 08:34:54,892 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 08:34:54,892 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 08:34:54,892 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 08:34:54,893 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 08:34:54,902 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2018-11-18 08:34:54,917 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-18 08:34:54,918 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:54,918 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:54,922 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-18 08:34:54,922 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 08:34:54,922 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 08:34:54,922 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2018-11-18 08:34:54,923 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-18 08:34:54,924 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:54,924 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:54,924 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-18 08:34:54,924 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 08:34:54,929 INFO L794 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~ret12, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 20#L570true assume !(main_~length~0 < 1); 3#L570-2true assume !(main_~n~1 < 1); 13#L573-1true call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);assume { :begin_inline_cstrlcpy } true;cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 7#L553true assume 0 != cstrlcpy_~n~0 % 4294967296; 16#L554-4true [2018-11-18 08:34:54,929 INFO L796 eck$LassoCheckResult]: Loop: 16#L554-4true assume true; 8#L554-1true cstrlcpy_#t~pre2 := cstrlcpy_~n~0 - 1;cstrlcpy_~n~0 := cstrlcpy_~n~0 - 1; 11#L554-2true assume !!(0 != cstrlcpy_#t~pre2 % 4294967296);havoc cstrlcpy_#t~pre2;cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset := cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_#t~post3.base, 1 + cstrlcpy_#t~post3.offset;cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post4.base, 1 + cstrlcpy_#t~post4.offset;call cstrlcpy_#t~mem5 := read~int(cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, 1);call write~int(cstrlcpy_#t~mem5, cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, 1); 4#L555true assume !(0 == cstrlcpy_#t~mem5);havoc cstrlcpy_#t~mem5;havoc cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset; 16#L554-4true [2018-11-18 08:34:54,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:54,935 INFO L82 PathProgramCache]: Analyzing trace with hash 889572236, now seen corresponding path program 1 times [2018-11-18 08:34:54,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:54,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:54,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:54,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:54,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:55,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:55,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:55,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:55,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1602920, now seen corresponding path program 1 times [2018-11-18 08:34:55,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:55,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:55,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:55,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:55,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:55,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:55,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:55,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:55,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1592230771, now seen corresponding path program 1 times [2018-11-18 08:34:55,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:55,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:55,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:55,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:55,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:55,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:55,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:55,230 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-11-18 08:34:55,554 WARN L180 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 94 [2018-11-18 08:34:55,658 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:34:55,659 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:34:55,659 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:34:55,660 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:34:55,660 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 08:34:55,660 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:55,660 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:34:55,660 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:34:55,660 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrlcpy-alloca_true-termination.c.i_Iteration1_Lasso [2018-11-18 08:34:55,661 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:34:55,661 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:34:55,682 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-18 08:34:55,687 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-18 08:34:55,690 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-18 08:34:55,692 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-18 08:34:55,696 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-18 08:34:55,700 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-18 08:34:55,950 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 82 [2018-11-18 08:34:56,074 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2018-11-18 08:34:56,074 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-18 08:34:56,076 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-18 08:34:56,079 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-18 08:34:56,080 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-18 08:34:56,084 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-18 08:34:56,086 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-18 08:34:56,087 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-18 08:34:56,089 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-18 08:34:56,091 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-18 08:34:56,092 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-18 08:34:56,094 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-18 08:34:56,096 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-18 08:34:56,098 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-18 08:34:56,101 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-18 08:34:56,304 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2018-11-18 08:34:56,423 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2018-11-18 08:34:56,681 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:34:56,684 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 08:34:56,686 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-18 08:34:56,687 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:56,687 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:56,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:56,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:56,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:56,689 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:56,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:56,691 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:56,692 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-18 08:34:56,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:56,692 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:56,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:56,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:56,693 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:56,693 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:56,693 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:56,694 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:56,694 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-18 08:34:56,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:56,695 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:56,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:56,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:56,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:56,695 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:56,696 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:56,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:56,696 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-18 08:34:56,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:56,697 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:56,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:56,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:56,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:56,698 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:56,698 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:56,698 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:56,699 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-18 08:34:56,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:56,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:56,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:56,700 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:56,702 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:56,702 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:56,705 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:56,705 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-18 08:34:56,706 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:56,706 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:56,706 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:56,706 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 08:34:56,706 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:56,707 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 08:34:56,707 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:56,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:56,710 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-18 08:34:56,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:56,711 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:56,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:56,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:56,711 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:56,712 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:56,712 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:56,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:56,713 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-18 08:34:56,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:56,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:56,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:56,714 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:56,715 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:56,716 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:56,721 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:56,721 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-18 08:34:56,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:56,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:56,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:56,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:56,723 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:56,724 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:56,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:56,726 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-18 08:34:56,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:56,727 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 08:34:56,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:56,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:56,730 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 08:34:56,731 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:56,746 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:56,747 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-18 08:34:56,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:56,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:56,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:56,748 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:56,749 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:56,749 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:56,752 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:56,752 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-18 08:34:56,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:56,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:56,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:56,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:56,754 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:56,754 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:56,757 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:56,757 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-18 08:34:56,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:56,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:56,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:56,758 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:56,759 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:56,759 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:56,767 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:56,768 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-18 08:34:56,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:56,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:56,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:56,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:56,776 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:56,776 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:56,835 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 08:34:56,877 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 08:34:56,878 INFO L444 ModelExtractionUtils]: 53 out of 58 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-18 08:34:56,879 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 08:34:56,881 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 08:34:56,881 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 08:34:56,882 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_1, ULTIMATE.start_cstrlcpy_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_1 - 1*ULTIMATE.start_cstrlcpy_~s~0.offset Supporting invariants [] [2018-11-18 08:34:56,986 INFO L297 tatePredicateManager]: 15 out of 16 supporting invariants were superfluous and have been removed [2018-11-18 08:34:56,992 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 08:34:57,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:57,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:57,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:57,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:57,045 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:57,066 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-18 08:34:57,076 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-18 08:34:57,077 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states. Second operand 5 states. [2018-11-18 08:34:57,148 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states.. Second operand 5 states. Result 55 states and 77 transitions. Complement of second has 7 states. [2018-11-18 08:34:57,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-18 08:34:57,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 08:34:57,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2018-11-18 08:34:57,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-18 08:34:57,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:57,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-18 08:34:57,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:57,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 6 letters. Loop has 8 letters. [2018-11-18 08:34:57,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:57,154 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 77 transitions. [2018-11-18 08:34:57,157 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 08:34:57,160 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 11 states and 14 transitions. [2018-11-18 08:34:57,161 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-18 08:34:57,162 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-18 08:34:57,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2018-11-18 08:34:57,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 08:34:57,163 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-18 08:34:57,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2018-11-18 08:34:57,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-11-18 08:34:57,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 08:34:57,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2018-11-18 08:34:57,181 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-18 08:34:57,182 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-18 08:34:57,182 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 08:34:57,182 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2018-11-18 08:34:57,182 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 08:34:57,182 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:57,182 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:57,183 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:57,183 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 08:34:57,183 INFO L794 eck$LassoCheckResult]: Stem: 205#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 201#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~ret12, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 202#L570 assume !(main_~length~0 < 1); 207#L570-2 assume !(main_~n~1 < 1); 208#L573-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);assume { :begin_inline_cstrlcpy } true;cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 203#L553 assume !(0 != cstrlcpy_~n~0 % 4294967296); 204#L553-1 assume 0 == cstrlcpy_~n~0 % 4294967296; 206#L560 assume 0 != cstrlcpy_~siz % 4294967296;call write~int(0, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, 1); 211#L562-3 [2018-11-18 08:34:57,183 INFO L796 eck$LassoCheckResult]: Loop: 211#L562-3 assume true; 209#L562 cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post6.base, 1 + cstrlcpy_#t~post6.offset;call cstrlcpy_#t~mem7 := read~int(cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, 1); 210#L562-1 assume !!(0 != cstrlcpy_#t~mem7);havoc cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset;havoc cstrlcpy_#t~mem7; 211#L562-3 [2018-11-18 08:34:57,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:57,184 INFO L82 PathProgramCache]: Analyzing trace with hash 180448452, now seen corresponding path program 1 times [2018-11-18 08:34:57,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:57,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:57,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:57,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:57,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:57,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:57,277 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-18 08:34:57,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:57,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:34:57,280 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 08:34:57,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:57,280 INFO L82 PathProgramCache]: Analyzing trace with hash 81496, now seen corresponding path program 1 times [2018-11-18 08:34:57,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:57,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:57,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:57,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:57,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:57,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:57,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:57,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 08:34:57,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 08:34:57,310 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. cyclomatic complexity: 4 Second operand 4 states. [2018-11-18 08:34:57,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:57,320 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2018-11-18 08:34:57,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 08:34:57,321 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2018-11-18 08:34:57,322 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 08:34:57,322 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 13 transitions. [2018-11-18 08:34:57,322 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-18 08:34:57,323 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-18 08:34:57,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2018-11-18 08:34:57,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 08:34:57,323 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-11-18 08:34:57,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2018-11-18 08:34:57,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-11-18 08:34:57,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 08:34:57,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2018-11-18 08:34:57,324 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-11-18 08:34:57,324 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-11-18 08:34:57,324 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 08:34:57,324 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. [2018-11-18 08:34:57,325 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 08:34:57,325 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:57,325 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:57,325 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:57,325 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 08:34:57,326 INFO L794 eck$LassoCheckResult]: Stem: 234#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 230#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~ret12, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 231#L570 assume !(main_~length~0 < 1); 236#L570-2 assume !(main_~n~1 < 1); 237#L573-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);assume { :begin_inline_cstrlcpy } true;cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 232#L553 assume !(0 != cstrlcpy_~n~0 % 4294967296); 233#L553-1 assume 0 == cstrlcpy_~n~0 % 4294967296; 235#L560 assume !(0 != cstrlcpy_~siz % 4294967296); 240#L562-3 [2018-11-18 08:34:57,326 INFO L796 eck$LassoCheckResult]: Loop: 240#L562-3 assume true; 238#L562 cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post6.base, 1 + cstrlcpy_#t~post6.offset;call cstrlcpy_#t~mem7 := read~int(cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, 1); 239#L562-1 assume !!(0 != cstrlcpy_#t~mem7);havoc cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset;havoc cstrlcpy_#t~mem7; 240#L562-3 [2018-11-18 08:34:57,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:57,326 INFO L82 PathProgramCache]: Analyzing trace with hash 180448454, now seen corresponding path program 1 times [2018-11-18 08:34:57,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:57,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:57,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:57,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:57,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:57,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:57,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:57,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:57,343 INFO L82 PathProgramCache]: Analyzing trace with hash 81496, now seen corresponding path program 2 times [2018-11-18 08:34:57,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:57,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:57,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:57,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:57,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:57,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:57,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:57,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:57,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1559109773, now seen corresponding path program 1 times [2018-11-18 08:34:57,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:57,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:57,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:57,349 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:57,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:57,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:57,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:57,588 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 93 [2018-11-18 08:34:57,660 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:34:57,660 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:34:57,660 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:34:57,660 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:34:57,660 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 08:34:57,660 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:57,660 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:34:57,660 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:34:57,660 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrlcpy-alloca_true-termination.c.i_Iteration3_Lasso [2018-11-18 08:34:57,660 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:34:57,660 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:34:57,663 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-18 08:34:57,673 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-18 08:34:57,674 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-18 08:34:57,675 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-18 08:34:57,677 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-18 08:34:57,678 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-18 08:34:57,679 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-18 08:34:57,818 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2018-11-18 08:34:57,854 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-18 08:34:57,855 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-18 08:34:57,857 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-18 08:34:57,859 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-18 08:34:57,860 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-18 08:34:57,861 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-18 08:34:57,863 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-18 08:34:57,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-18 08:34:57,865 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-18 08:34:57,866 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-18 08:34:57,876 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-18 08:34:57,878 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-18 08:34:57,879 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-18 08:34:58,176 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:34:58,176 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 08:34:58,176 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-18 08:34:58,177 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:58,177 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:58,177 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:58,177 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:58,177 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:58,177 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:58,177 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:58,178 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:58,178 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-18 08:34:58,178 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:58,178 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:58,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:58,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:58,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:58,179 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:58,179 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:58,179 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:58,179 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-18 08:34:58,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:58,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:58,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:58,180 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:58,181 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:58,181 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:58,182 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:58,183 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-18 08:34:58,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:58,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:58,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:58,183 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:58,184 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:58,184 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:58,186 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:58,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-18 08:34:58,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:58,187 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:58,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:58,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:58,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:58,187 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:58,187 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:58,188 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:58,188 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-18 08:34:58,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:58,189 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:58,189 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:58,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:58,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:58,189 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:58,189 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:58,190 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:58,190 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-18 08:34:58,190 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:58,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:58,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:58,191 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:58,192 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:58,192 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:58,194 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:58,194 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-18 08:34:58,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:58,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:58,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:58,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:58,197 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:58,197 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:58,207 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 08:34:58,221 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-18 08:34:58,221 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-18 08:34:58,221 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 08:34:58,222 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 08:34:58,222 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 08:34:58,222 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrlcpy_~s~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_2) = -1*ULTIMATE.start_cstrlcpy_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_2 Supporting invariants [] [2018-11-18 08:34:58,254 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-11-18 08:34:58,256 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 08:34:58,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:58,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:58,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:58,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:58,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:58,320 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-18 08:34:58,321 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-18 08:34:58,321 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 13 transitions. cyclomatic complexity: 3 Second operand 5 states. [2018-11-18 08:34:58,339 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 13 transitions. cyclomatic complexity: 3. Second operand 5 states. Result 15 states and 17 transitions. Complement of second has 5 states. [2018-11-18 08:34:58,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-18 08:34:58,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 08:34:58,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-11-18 08:34:58,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 8 letters. Loop has 3 letters. [2018-11-18 08:34:58,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:58,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 11 letters. Loop has 3 letters. [2018-11-18 08:34:58,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:58,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 8 letters. Loop has 6 letters. [2018-11-18 08:34:58,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:58,342 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2018-11-18 08:34:58,342 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 08:34:58,342 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 0 states and 0 transitions. [2018-11-18 08:34:58,342 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 08:34:58,342 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 08:34:58,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 08:34:58,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 08:34:58,343 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 08:34:58,343 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 08:34:58,343 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 08:34:58,343 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 08:34:58,343 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 08:34:58,343 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 08:34:58,343 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 08:34:58,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 08:34:58 BoogieIcfgContainer [2018-11-18 08:34:58,349 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 08:34:58,349 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 08:34:58,349 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 08:34:58,350 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 08:34:58,350 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:34:54" (3/4) ... [2018-11-18 08:34:58,353 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 08:34:58,353 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 08:34:58,354 INFO L168 Benchmark]: Toolchain (without parser) took 4144.75 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 308.8 MB). Free memory was 957.6 MB in the beginning and 1.2 GB in the end (delta: -247.7 MB). Peak memory consumption was 61.1 MB. Max. memory is 11.5 GB. [2018-11-18 08:34:58,355 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 08:34:58,355 INFO L168 Benchmark]: CACSL2BoogieTranslator took 363.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 177.7 MB). Free memory was 957.6 MB in the beginning and 1.2 GB in the end (delta: -204.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. [2018-11-18 08:34:58,356 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.44 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 08:34:58,356 INFO L168 Benchmark]: Boogie Preprocessor took 16.98 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 08:34:58,356 INFO L168 Benchmark]: RCFGBuilder took 221.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 27.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. [2018-11-18 08:34:58,357 INFO L168 Benchmark]: BuchiAutomizer took 3505.42 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 131.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -70.7 MB). Peak memory consumption was 60.4 MB. Max. memory is 11.5 GB. [2018-11-18 08:34:58,357 INFO L168 Benchmark]: Witness Printer took 3.99 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-18 08:34:58,363 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 363.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 177.7 MB). Free memory was 957.6 MB in the beginning and 1.2 GB in the end (delta: -204.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.44 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.98 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 221.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 27.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3505.42 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 131.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -70.7 MB). Peak memory consumption was 60.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.99 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.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * 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 unknown-#length-unknown[__builtin_alloca (length * sizeof(char))] + -1 * s and consists of 5 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[__builtin_alloca (length * sizeof(char))] and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.4s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 3.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 11 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 52 SDtfs, 52 SDslu, 31 SDs, 0 SdLazy, 19 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital226 mio100 ax108 hnf99 lsp90 ukn83 mio100 lsp41 div150 bol100 ite100 ukn100 eq166 hnf75 smp97 dnf100 smp100 tf100 neg99 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 20ms VariablesStem: 5 VariablesLoop: 4 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...