./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/cstrcpy-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_28665f93-6027-4cef-a0fc-e44dc8306e4c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_28665f93-6027-4cef-a0fc-e44dc8306e4c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_28665f93-6027-4cef-a0fc-e44dc8306e4c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_28665f93-6027-4cef-a0fc-e44dc8306e4c/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/cstrcpy-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_28665f93-6027-4cef-a0fc-e44dc8306e4c/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_28665f93-6027-4cef-a0fc-e44dc8306e4c/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 83897956e392064e8b9522b11a8bf4c25fb2a6e3 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:25:29,760 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:25:29,761 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:25:29,775 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:25:29,776 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:25:29,777 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:25:29,779 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:25:29,787 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:25:29,792 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:25:29,794 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:25:29,795 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:25:29,796 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:25:29,805 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:25:29,805 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:25:29,806 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:25:29,807 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:25:29,808 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:25:29,808 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:25:29,809 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:25:29,810 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:25:29,811 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:25:29,812 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:25:29,813 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:25:29,813 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:25:29,815 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:25:29,815 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:25:29,816 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:25:29,816 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:25:29,817 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:25:29,818 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:25:29,818 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:25:29,818 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:25:29,819 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:25:29,820 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:25:29,821 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:25:29,821 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:25:29,821 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:25:29,822 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:25:29,822 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:25:29,823 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:25:29,823 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:25:29,824 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_28665f93-6027-4cef-a0fc-e44dc8306e4c/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-16 00:25:29,839 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:25:29,840 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:25:29,841 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:25:29,841 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:25:29,841 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:25:29,841 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-16 00:25:29,842 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-16 00:25:29,842 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-16 00:25:29,842 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-16 00:25:29,842 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-16 00:25:29,842 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-16 00:25:29,843 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:25:29,843 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:25:29,843 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:25:29,843 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:25:29,844 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:25:29,844 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:25:29,844 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-16 00:25:29,844 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-16 00:25:29,844 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-16 00:25:29,845 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:25:29,845 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:25:29,845 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-16 00:25:29,845 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:25:29,846 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-16 00:25:29,846 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:25:29,846 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:25:29,846 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-16 00:25:29,847 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:25:29,851 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:25:29,851 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-16 00:25:29,852 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-16 00:25:29,852 INFO L138 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/run_dir_28665f93-6027-4cef-a0fc-e44dc8306e4c/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 83897956e392064e8b9522b11a8bf4c25fb2a6e3 [2019-11-16 00:25:29,890 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:25:29,908 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:25:29,911 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:25:29,912 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:25:29,916 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:25:29,916 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_28665f93-6027-4cef-a0fc-e44dc8306e4c/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/cstrcpy-alloca-1.i [2019-11-16 00:25:29,966 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_28665f93-6027-4cef-a0fc-e44dc8306e4c/bin/uautomizer/data/d4ca76809/798aea1db9e04575a93b3c2633df0880/FLAG77a5ae3ff [2019-11-16 00:25:30,458 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:25:30,463 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_28665f93-6027-4cef-a0fc-e44dc8306e4c/sv-benchmarks/c/array-memsafety/cstrcpy-alloca-1.i [2019-11-16 00:25:30,482 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_28665f93-6027-4cef-a0fc-e44dc8306e4c/bin/uautomizer/data/d4ca76809/798aea1db9e04575a93b3c2633df0880/FLAG77a5ae3ff [2019-11-16 00:25:30,750 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_28665f93-6027-4cef-a0fc-e44dc8306e4c/bin/uautomizer/data/d4ca76809/798aea1db9e04575a93b3c2633df0880 [2019-11-16 00:25:30,752 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:25:30,753 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:25:30,754 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:25:30,754 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:25:30,762 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:25:30,763 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:25:30" (1/1) ... [2019-11-16 00:25:30,766 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@544e8593 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:30, skipping insertion in model container [2019-11-16 00:25:30,766 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:25:30" (1/1) ... [2019-11-16 00:25:30,773 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:25:30,823 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:25:31,198 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:25:31,207 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:25:31,254 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:25:31,305 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:25:31,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:31 WrapperNode [2019-11-16 00:25:31,306 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:25:31,309 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:25:31,309 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:25:31,309 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:25:31,317 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:31" (1/1) ... [2019-11-16 00:25:31,343 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:31" (1/1) ... [2019-11-16 00:25:31,359 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:25:31,360 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:25:31,360 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:25:31,360 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:25:31,369 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:31" (1/1) ... [2019-11-16 00:25:31,369 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:31" (1/1) ... [2019-11-16 00:25:31,372 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:31" (1/1) ... [2019-11-16 00:25:31,372 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:31" (1/1) ... [2019-11-16 00:25:31,388 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:31" (1/1) ... [2019-11-16 00:25:31,393 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:31" (1/1) ... [2019-11-16 00:25:31,394 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:31" (1/1) ... [2019-11-16 00:25:31,397 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:25:31,398 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:25:31,398 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:25:31,398 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:25:31,399 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_28665f93-6027-4cef-a0fc-e44dc8306e4c/bin/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 [2019-11-16 00:25:31,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:25:31,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:25:31,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:25:31,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:25:31,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:25:31,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:25:31,723 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:25:31,723 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-16 00:25:31,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:25:31 BoogieIcfgContainer [2019-11-16 00:25:31,724 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:25:31,725 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-16 00:25:31,725 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-16 00:25:31,740 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-16 00:25:31,741 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:25:31,741 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.11 12:25:30" (1/3) ... [2019-11-16 00:25:31,742 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@23785e67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:25:31, skipping insertion in model container [2019-11-16 00:25:31,742 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:25:31,742 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:31" (2/3) ... [2019-11-16 00:25:31,742 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@23785e67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:25:31, skipping insertion in model container [2019-11-16 00:25:31,742 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:25:31,743 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:25:31" (3/3) ... [2019-11-16 00:25:31,744 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrcpy-alloca-1.i [2019-11-16 00:25:31,798 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-16 00:25:31,799 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-16 00:25:31,799 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-16 00:25:31,799 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:25:31,799 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:25:31,799 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-16 00:25:31,799 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:25:31,799 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-16 00:25:31,815 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-11-16 00:25:31,834 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-16 00:25:31,834 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:25:31,834 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:25:31,839 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-16 00:25:31,839 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:25:31,839 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-16 00:25:31,839 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-11-16 00:25:31,840 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-16 00:25:31,840 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:25:31,841 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:25:31,841 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-16 00:25:31,841 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:25:31,846 INFO L791 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet5, main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_#t~ret11.base, main_#t~ret11.offset, main_~length1~0, main_~length2~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length1~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~length2~0 := main_#t~nondet6;havoc main_#t~nondet6; 4#L525true assume !(main_~length1~0 < 1); 6#L525-2true assume !(main_~length2~0 < 1); 17#L528-1true assume !(main_~length1~0 < main_~length2~0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 9#L535-3true [2019-11-16 00:25:31,847 INFO L793 eck$LassoCheckResult]: Loop: 9#L535-3true assume !!(main_~i~0 < main_~length2~0 - 1);call write~int(main_#t~nondet10, main_~nondetString~0.base, main_~nondetString~0.offset + main_~i~0, 1);havoc main_#t~nondet10; 7#L535-2true main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 9#L535-3true [2019-11-16 00:25:31,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:31,851 INFO L82 PathProgramCache]: Analyzing trace with hash 28695882, now seen corresponding path program 1 times [2019-11-16 00:25:31,858 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:31,858 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433761273] [2019-11-16 00:25:31,858 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:31,858 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:31,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:31,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:25:31,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:25:31,989 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:25:31,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:31,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1827, now seen corresponding path program 1 times [2019-11-16 00:25:31,990 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:31,990 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220686577] [2019-11-16 00:25:31,990 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:31,991 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:31,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:31,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:25:32,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:25:32,007 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:25:32,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:32,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1806939692, now seen corresponding path program 1 times [2019-11-16 00:25:32,009 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:32,009 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141404371] [2019-11-16 00:25:32,009 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:32,010 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:32,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:32,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:25:32,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:25:32,056 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:25:32,340 WARN L191 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-11-16 00:25:32,440 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:25:32,441 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:25:32,442 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:25:32,442 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:25:32,442 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:25:32,442 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:25:32,443 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:25:32,443 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:25:32,443 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcpy-alloca-1.i_Iteration1_Lasso [2019-11-16 00:25:32,443 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:25:32,443 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:25:32,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:32,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:32,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:32,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:32,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:32,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:32,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:32,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:32,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:32,674 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-11-16 00:25:32,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:32,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:32,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:32,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:33,118 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-11-16 00:25:33,235 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:25:33,242 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:25:33,244 INFO L120 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 [2019-11-16 00:25:33,247 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:33,247 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:33,248 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:33,248 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:33,256 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:25:33,256 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:25:33,276 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:33,277 INFO L120 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 [2019-11-16 00:25:33,277 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:33,277 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:25:33,278 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:33,278 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:33,278 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:33,279 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:25:33,279 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:25:33,280 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:33,280 INFO L120 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 [2019-11-16 00:25:33,290 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:33,290 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:25:33,290 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:33,291 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:33,291 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:33,292 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:25:33,293 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:25:33,293 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:33,294 INFO L120 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 [2019-11-16 00:25:33,295 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:33,295 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:25:33,296 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:33,303 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:33,303 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:33,303 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:25:33,303 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:25:33,304 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:33,305 INFO L120 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 [2019-11-16 00:25:33,305 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:33,306 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:33,306 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:33,306 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:33,308 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:25:33,308 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:25:33,312 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:33,313 INFO L120 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 [2019-11-16 00:25:33,313 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:33,313 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:25:33,314 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:33,314 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:33,314 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:33,314 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:25:33,315 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:25:33,316 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:33,316 INFO L120 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 [2019-11-16 00:25:33,333 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:33,333 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:33,333 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:33,333 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:33,335 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:25:33,335 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:25:33,347 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:33,348 INFO L120 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 [2019-11-16 00:25:33,349 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:33,349 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:33,349 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:33,349 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:33,351 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:25:33,351 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:25:33,366 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:33,367 INFO L120 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 [2019-11-16 00:25:33,368 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:33,368 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:25:33,368 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:33,368 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:33,368 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:33,369 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:25:33,369 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:25:33,370 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:33,371 INFO L120 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 [2019-11-16 00:25:33,371 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:33,372 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-16 00:25:33,372 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:33,372 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:33,378 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-16 00:25:33,378 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:25:33,448 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:33,448 INFO L120 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 [2019-11-16 00:25:33,449 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:33,455 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:33,456 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:33,456 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:33,457 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:25:33,458 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:25:33,460 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:33,461 INFO L120 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 [2019-11-16 00:25:33,461 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:33,462 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:33,462 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:33,462 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:33,464 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:25:33,465 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:25:33,491 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:33,492 INFO L120 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 [2019-11-16 00:25:33,496 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:33,496 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:33,496 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:33,496 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:33,504 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:25:33,504 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:25:33,606 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:25:33,631 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:25:33,631 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-11-16 00:25:33,633 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:25:33,635 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:25:33,635 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:25:33,636 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~length2~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~length2~0 Supporting invariants [] [2019-11-16 00:25:33,651 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-11-16 00:25:33,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:33,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:33,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:25:33,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:25:33,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:33,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:25:33,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:25:33,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:25:33,741 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-16 00:25:33,743 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 3 states. [2019-11-16 00:25:33,782 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states.. Second operand 3 states. Result 36 states and 47 transitions. Complement of second has 7 states. [2019-11-16 00:25:33,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-16 00:25:33,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:25:33,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2019-11-16 00:25:33,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-16 00:25:33,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:25:33,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-16 00:25:33,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:25:33,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-16 00:25:33,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:25:33,794 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 47 transitions. [2019-11-16 00:25:33,801 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:25:33,805 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 11 states and 15 transitions. [2019-11-16 00:25:33,807 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-16 00:25:33,807 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-16 00:25:33,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 15 transitions. [2019-11-16 00:25:33,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:25:33,809 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2019-11-16 00:25:33,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 15 transitions. [2019-11-16 00:25:33,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-11-16 00:25:33,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-16 00:25:33,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2019-11-16 00:25:33,832 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2019-11-16 00:25:33,832 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2019-11-16 00:25:33,832 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-16 00:25:33,832 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2019-11-16 00:25:33,833 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:25:33,833 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:25:33,833 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:25:33,834 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:25:33,834 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:25:33,834 INFO L791 eck$LassoCheckResult]: Stem: 131#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 127#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_#t~ret11.base, main_#t~ret11.offset, main_~length1~0, main_~length2~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length1~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~length2~0 := main_#t~nondet6;havoc main_#t~nondet6; 128#L525 assume !(main_~length1~0 < 1); 132#L525-2 assume !(main_~length2~0 < 1); 133#L528-1 assume !(main_~length1~0 < main_~length2~0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 123#L535-3 assume !(main_~i~0 < main_~length2~0 - 1); 124#L535-4 call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length2~0 - 1), 1);cstrcpy_#in~s1.base, cstrcpy_#in~s1.offset, cstrcpy_#in~s2.base, cstrcpy_#in~s2.offset := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;havoc cstrcpy_#res.base, cstrcpy_#res.offset;havoc cstrcpy_#t~post2.base, cstrcpy_#t~post2.offset, cstrcpy_#t~post3.base, cstrcpy_#t~post3.offset, cstrcpy_#t~mem4, cstrcpy_~s1.base, cstrcpy_~s1.offset, cstrcpy_~s2.base, cstrcpy_~s2.offset, cstrcpy_~dst~0.base, cstrcpy_~dst~0.offset, cstrcpy_~src~0.base, cstrcpy_~src~0.offset;cstrcpy_~s1.base, cstrcpy_~s1.offset := cstrcpy_#in~s1.base, cstrcpy_#in~s1.offset;cstrcpy_~s2.base, cstrcpy_~s2.offset := cstrcpy_#in~s2.base, cstrcpy_#in~s2.offset;cstrcpy_~dst~0.base, cstrcpy_~dst~0.offset := cstrcpy_~s1.base, cstrcpy_~s1.offset;cstrcpy_~src~0.base, cstrcpy_~src~0.offset := cstrcpy_~s2.base, cstrcpy_~s2.offset; 129#L518-3 [2019-11-16 00:25:33,834 INFO L793 eck$LassoCheckResult]: Loop: 129#L518-3 cstrcpy_#t~post2.base, cstrcpy_#t~post2.offset := cstrcpy_~dst~0.base, cstrcpy_~dst~0.offset;cstrcpy_~dst~0.base, cstrcpy_~dst~0.offset := cstrcpy_#t~post2.base, 1 + cstrcpy_#t~post2.offset;cstrcpy_#t~post3.base, cstrcpy_#t~post3.offset := cstrcpy_~src~0.base, cstrcpy_~src~0.offset;cstrcpy_~src~0.base, cstrcpy_~src~0.offset := cstrcpy_#t~post3.base, 1 + cstrcpy_#t~post3.offset;call cstrcpy_#t~mem4 := read~int(cstrcpy_#t~post3.base, cstrcpy_#t~post3.offset, 1);call write~int(cstrcpy_#t~mem4, cstrcpy_#t~post2.base, cstrcpy_#t~post2.offset, 1); 130#L518-1 assume !!(0 != cstrcpy_#t~mem4);havoc cstrcpy_#t~mem4;havoc cstrcpy_#t~post2.base, cstrcpy_#t~post2.offset;havoc cstrcpy_#t~post3.base, cstrcpy_#t~post3.offset; 129#L518-3 [2019-11-16 00:25:33,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:33,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1806939634, now seen corresponding path program 1 times [2019-11-16 00:25:33,835 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:33,835 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182027689] [2019-11-16 00:25:33,835 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:33,835 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:33,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:33,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:25:33,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:25:33,890 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:25:33,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:33,894 INFO L82 PathProgramCache]: Analyzing trace with hash 2182, now seen corresponding path program 1 times [2019-11-16 00:25:33,894 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:33,894 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456442694] [2019-11-16 00:25:33,895 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:33,895 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:33,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:33,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:25:33,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:25:33,921 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:25:33,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:33,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1302201911, now seen corresponding path program 1 times [2019-11-16 00:25:33,924 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:33,924 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233309672] [2019-11-16 00:25:33,924 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:33,925 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:33,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:33,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:34,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:25:34,074 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233309672] [2019-11-16 00:25:34,074 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:25:34,075 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:25:34,075 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718912810] [2019-11-16 00:25:34,196 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:34,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:25:34,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:25:34,200 INFO L87 Difference]: Start difference. First operand 11 states and 15 transitions. cyclomatic complexity: 6 Second operand 7 states. [2019-11-16 00:25:34,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:34,308 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2019-11-16 00:25:34,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:25:34,310 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2019-11-16 00:25:34,310 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:25:34,311 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 12 states and 15 transitions. [2019-11-16 00:25:34,311 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-16 00:25:34,311 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-16 00:25:34,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 15 transitions. [2019-11-16 00:25:34,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:25:34,311 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2019-11-16 00:25:34,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 15 transitions. [2019-11-16 00:25:34,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-11-16 00:25:34,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-16 00:25:34,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2019-11-16 00:25:34,313 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-11-16 00:25:34,313 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-11-16 00:25:34,313 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-16 00:25:34,313 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2019-11-16 00:25:34,314 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:25:34,314 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:25:34,314 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:25:34,314 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:25:34,314 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:25:34,315 INFO L791 eck$LassoCheckResult]: Stem: 173#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 167#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_#t~ret11.base, main_#t~ret11.offset, main_~length1~0, main_~length2~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length1~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~length2~0 := main_#t~nondet6;havoc main_#t~nondet6; 168#L525 assume !(main_~length1~0 < 1); 176#L525-2 assume !(main_~length2~0 < 1); 177#L528-1 assume !(main_~length1~0 < main_~length2~0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 169#L535-3 assume !!(main_~i~0 < main_~length2~0 - 1);call write~int(main_#t~nondet10, main_~nondetString~0.base, main_~nondetString~0.offset + main_~i~0, 1);havoc main_#t~nondet10; 170#L535-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 171#L535-3 assume !(main_~i~0 < main_~length2~0 - 1); 172#L535-4 call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length2~0 - 1), 1);cstrcpy_#in~s1.base, cstrcpy_#in~s1.offset, cstrcpy_#in~s2.base, cstrcpy_#in~s2.offset := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;havoc cstrcpy_#res.base, cstrcpy_#res.offset;havoc cstrcpy_#t~post2.base, cstrcpy_#t~post2.offset, cstrcpy_#t~post3.base, cstrcpy_#t~post3.offset, cstrcpy_#t~mem4, cstrcpy_~s1.base, cstrcpy_~s1.offset, cstrcpy_~s2.base, cstrcpy_~s2.offset, cstrcpy_~dst~0.base, cstrcpy_~dst~0.offset, cstrcpy_~src~0.base, cstrcpy_~src~0.offset;cstrcpy_~s1.base, cstrcpy_~s1.offset := cstrcpy_#in~s1.base, cstrcpy_#in~s1.offset;cstrcpy_~s2.base, cstrcpy_~s2.offset := cstrcpy_#in~s2.base, cstrcpy_#in~s2.offset;cstrcpy_~dst~0.base, cstrcpy_~dst~0.offset := cstrcpy_~s1.base, cstrcpy_~s1.offset;cstrcpy_~src~0.base, cstrcpy_~src~0.offset := cstrcpy_~s2.base, cstrcpy_~s2.offset; 174#L518-3 [2019-11-16 00:25:34,315 INFO L793 eck$LassoCheckResult]: Loop: 174#L518-3 cstrcpy_#t~post2.base, cstrcpy_#t~post2.offset := cstrcpy_~dst~0.base, cstrcpy_~dst~0.offset;cstrcpy_~dst~0.base, cstrcpy_~dst~0.offset := cstrcpy_#t~post2.base, 1 + cstrcpy_#t~post2.offset;cstrcpy_#t~post3.base, cstrcpy_#t~post3.offset := cstrcpy_~src~0.base, cstrcpy_~src~0.offset;cstrcpy_~src~0.base, cstrcpy_~src~0.offset := cstrcpy_#t~post3.base, 1 + cstrcpy_#t~post3.offset;call cstrcpy_#t~mem4 := read~int(cstrcpy_#t~post3.base, cstrcpy_#t~post3.offset, 1);call write~int(cstrcpy_#t~mem4, cstrcpy_#t~post2.base, cstrcpy_#t~post2.offset, 1); 175#L518-1 assume !!(0 != cstrcpy_#t~mem4);havoc cstrcpy_#t~mem4;havoc cstrcpy_#t~post2.base, cstrcpy_#t~post2.offset;havoc cstrcpy_#t~post3.base, cstrcpy_#t~post3.offset; 174#L518-3 [2019-11-16 00:25:34,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:34,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1302257236, now seen corresponding path program 1 times [2019-11-16 00:25:34,315 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:34,315 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962985428] [2019-11-16 00:25:34,315 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:34,316 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:34,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:34,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:25:34,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:25:34,361 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:25:34,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:34,365 INFO L82 PathProgramCache]: Analyzing trace with hash 2182, now seen corresponding path program 2 times [2019-11-16 00:25:34,365 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:34,365 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086642637] [2019-11-16 00:25:34,365 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:34,366 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:34,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:34,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:25:34,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:25:34,380 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:25:34,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:34,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1633721881, now seen corresponding path program 1 times [2019-11-16 00:25:34,380 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:34,381 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117601240] [2019-11-16 00:25:34,381 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:34,381 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:34,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:34,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:25:34,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:25:34,423 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:25:34,910 WARN L191 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 101 [2019-11-16 00:25:35,038 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-11-16 00:25:35,040 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:25:35,040 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:25:35,041 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:25:35,041 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:25:35,041 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:25:35,041 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:25:35,041 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:25:35,041 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:25:35,041 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcpy-alloca-1.i_Iteration3_Lasso [2019-11-16 00:25:35,041 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:25:35,041 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:25:35,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:35,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:35,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:35,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:35,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:35,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:35,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:35,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:35,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:35,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:35,345 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2019-11-16 00:25:35,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:35,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:35,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:35,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:35,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:35,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:35,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:35,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:35,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:35,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:35,630 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-11-16 00:25:36,257 WARN L191 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-11-16 00:25:36,338 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:25:36,338 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:25:36,339 INFO L120 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 [2019-11-16 00:25:36,339 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:36,345 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:25:36,345 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:36,345 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:36,345 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:36,346 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:25:36,346 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:25:36,346 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:36,347 INFO L120 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 [2019-11-16 00:25:36,347 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:36,347 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:25:36,348 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:36,348 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:36,348 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:36,348 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:25:36,348 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:25:36,349 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:36,349 INFO L120 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 [2019-11-16 00:25:36,350 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:36,350 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:25:36,350 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:36,350 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:36,351 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:36,351 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:25:36,351 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:25:36,352 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:36,352 INFO L120 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 [2019-11-16 00:25:36,352 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:36,353 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:25:36,353 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:36,353 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:36,353 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:36,353 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:25:36,354 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:25:36,354 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:36,354 INFO L120 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 [2019-11-16 00:25:36,355 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:36,355 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:25:36,355 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:36,355 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:36,356 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:36,356 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:25:36,356 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:25:36,357 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:36,357 INFO L120 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 [2019-11-16 00:25:36,358 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:36,358 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:36,358 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:36,358 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:36,359 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:25:36,359 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:25:36,361 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:36,361 INFO L120 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 [2019-11-16 00:25:36,362 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:36,362 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:36,362 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:36,362 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:36,363 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:25:36,363 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:25:36,365 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:36,365 INFO L120 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 [2019-11-16 00:25:36,366 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:36,366 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:25:36,366 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:36,367 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:36,367 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:36,367 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:25:36,368 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:25:36,368 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:36,369 INFO L120 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 [2019-11-16 00:25:36,369 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:36,369 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:25:36,370 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:36,370 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:36,370 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:36,370 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:25:36,370 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:25:36,371 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:36,371 INFO L120 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 [2019-11-16 00:25:36,372 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:36,372 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:36,372 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:36,372 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:36,373 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:25:36,373 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:25:36,374 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:36,375 INFO L120 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 [2019-11-16 00:25:36,375 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:36,376 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:36,376 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:36,376 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:36,380 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:25:36,380 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:25:36,435 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:25:36,513 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-16 00:25:36,514 INFO L444 ModelExtractionUtils]: 50 out of 55 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-16 00:25:36,514 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:25:36,515 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:25:36,515 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:25:36,516 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrcpy_~src~0.base)_1, ULTIMATE.start_cstrcpy_~src~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrcpy_~src~0.base)_1 - 1*ULTIMATE.start_cstrcpy_~src~0.offset Supporting invariants [] [2019-11-16 00:25:36,558 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2019-11-16 00:25:36,559 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-16 00:25:36,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:36,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:36,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:25:36,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:25:36,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:36,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-16 00:25:36,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:25:36,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:25:36,648 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-16 00:25:36,648 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-11-16 00:25:36,657 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 13 states and 16 transitions. Complement of second has 4 states. [2019-11-16 00:25:36,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-16 00:25:36,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:25:36,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2019-11-16 00:25:36,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 9 letters. Loop has 2 letters. [2019-11-16 00:25:36,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:25:36,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 11 letters. Loop has 2 letters. [2019-11-16 00:25:36,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:25:36,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 9 letters. Loop has 4 letters. [2019-11-16 00:25:36,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:25:36,661 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2019-11-16 00:25:36,662 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:25:36,662 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 0 states and 0 transitions. [2019-11-16 00:25:36,662 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-16 00:25:36,662 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-16 00:25:36,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-16 00:25:36,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:25:36,662 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:25:36,662 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:25:36,662 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:25:36,662 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-16 00:25:36,662 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:25:36,663 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:25:36,663 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-16 00:25:36,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 16.11 12:25:36 BoogieIcfgContainer [2019-11-16 00:25:36,668 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-16 00:25:36,670 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:25:36,670 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:25:36,670 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:25:36,671 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:25:31" (3/4) ... [2019-11-16 00:25:36,675 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-16 00:25:36,675 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:25:36,677 INFO L168 Benchmark]: Toolchain (without parser) took 5923.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 190.3 MB). Free memory was 939.4 MB in the beginning and 1.0 GB in the end (delta: -63.6 MB). Peak memory consumption was 126.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:25:36,678 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:25:36,679 INFO L168 Benchmark]: CACSL2BoogieTranslator took 553.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -185.0 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:25:36,679 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.91 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:25:36,680 INFO L168 Benchmark]: Boogie Preprocessor took 37.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:25:36,681 INFO L168 Benchmark]: RCFGBuilder took 326.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:25:36,683 INFO L168 Benchmark]: BuchiAutomizer took 4943.49 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 49.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 92.3 MB). Peak memory consumption was 142.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:25:36,687 INFO L168 Benchmark]: Witness Printer took 4.88 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:25:36,692 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 553.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -185.0 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.91 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 326.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4943.49 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 49.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 92.3 MB). Peak memory consumption was 142.1 MB. Max. memory is 11.5 GB. * Witness Printer took 4.88 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 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 * 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 -1 * i + length2 and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[src] + -1 * src and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.8s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 4.4s. 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, 1 StatesRemovedByMinimization, 1 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: 36 SDtfs, 43 SDslu, 35 SDs, 0 SdLazy, 43 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital175 mio100 ax110 hnf98 lsp84 ukn82 mio100 lsp53 div100 bol100 ite100 ukn100 eq180 hnf89 smp99 dnf164 smp96 tf100 neg94 sie119 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 77ms VariablesStem: 5 VariablesLoop: 2 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 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...