./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/array-memsafety/cstrncpy-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d36c392b-e955-4254-8208-42e1f13dccd0/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d36c392b-e955-4254-8208-42e1f13dccd0/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d36c392b-e955-4254-8208-42e1f13dccd0/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d36c392b-e955-4254-8208-42e1f13dccd0/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/cstrncpy-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d36c392b-e955-4254-8208-42e1f13dccd0/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d36c392b-e955-4254-8208-42e1f13dccd0/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a42c021ebd0de645918b065980a1f8d912cba85d ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 16:58:08,871 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 16:58:08,872 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 16:58:08,879 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 16:58:08,879 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 16:58:08,880 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 16:58:08,880 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 16:58:08,881 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 16:58:08,882 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 16:58:08,883 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 16:58:08,884 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 16:58:08,884 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 16:58:08,884 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 16:58:08,885 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 16:58:08,886 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 16:58:08,886 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 16:58:08,887 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 16:58:08,888 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 16:58:08,889 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 16:58:08,890 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 16:58:08,891 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 16:58:08,892 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 16:58:08,893 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 16:58:08,894 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 16:58:08,894 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 16:58:08,894 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 16:58:08,895 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 16:58:08,895 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 16:58:08,896 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 16:58:08,897 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 16:58:08,897 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 16:58:08,897 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 16:58:08,897 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 16:58:08,898 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 16:58:08,898 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 16:58:08,899 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 16:58:08,899 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d36c392b-e955-4254-8208-42e1f13dccd0/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 16:58:08,908 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 16:58:08,908 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 16:58:08,909 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 16:58:08,909 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 16:58:08,909 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 16:58:08,909 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 16:58:08,910 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 16:58:08,910 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 16:58:08,910 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 16:58:08,910 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 16:58:08,910 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 16:58:08,910 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 16:58:08,910 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 16:58:08,910 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 16:58:08,911 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 16:58:08,911 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 16:58:08,911 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 16:58:08,911 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 16:58:08,911 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 16:58:08,911 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 16:58:08,911 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 16:58:08,912 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 16:58:08,912 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 16:58:08,912 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 16:58:08,912 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 16:58:08,912 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 16:58:08,912 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 16:58:08,912 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 16:58:08,912 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 16:58:08,913 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 16:58:08,913 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 16:58:08,913 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 16:58:08,913 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_d36c392b-e955-4254-8208-42e1f13dccd0/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a42c021ebd0de645918b065980a1f8d912cba85d [2018-11-18 16:58:08,935 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 16:58:08,942 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 16:58:08,944 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 16:58:08,945 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 16:58:08,945 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 16:58:08,945 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d36c392b-e955-4254-8208-42e1f13dccd0/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-11-18 16:58:08,983 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d36c392b-e955-4254-8208-42e1f13dccd0/bin-2019/uautomizer/data/27563757e/2f336b010a0c45c98843929da9fbfa3c/FLAG06e4c09bd [2018-11-18 16:58:09,413 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 16:58:09,414 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d36c392b-e955-4254-8208-42e1f13dccd0/sv-benchmarks/c/array-memsafety/cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-11-18 16:58:09,421 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d36c392b-e955-4254-8208-42e1f13dccd0/bin-2019/uautomizer/data/27563757e/2f336b010a0c45c98843929da9fbfa3c/FLAG06e4c09bd [2018-11-18 16:58:09,430 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d36c392b-e955-4254-8208-42e1f13dccd0/bin-2019/uautomizer/data/27563757e/2f336b010a0c45c98843929da9fbfa3c [2018-11-18 16:58:09,432 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 16:58:09,433 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 16:58:09,433 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 16:58:09,433 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 16:58:09,436 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 16:58:09,436 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:58:09" (1/1) ... [2018-11-18 16:58:09,438 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32ee2369 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:58:09, skipping insertion in model container [2018-11-18 16:58:09,438 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:58:09" (1/1) ... [2018-11-18 16:58:09,444 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 16:58:09,468 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 16:58:09,653 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:58:09,661 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 16:58:09,730 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:58:09,759 INFO L195 MainTranslator]: Completed translation [2018-11-18 16:58:09,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:58:09 WrapperNode [2018-11-18 16:58:09,760 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 16:58:09,760 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 16:58:09,760 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 16:58:09,760 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 16:58:09,767 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:58:09" (1/1) ... [2018-11-18 16:58:09,779 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:58:09" (1/1) ... [2018-11-18 16:58:09,796 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 16:58:09,796 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 16:58:09,796 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 16:58:09,796 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 16:58:09,804 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:58:09" (1/1) ... [2018-11-18 16:58:09,804 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:58:09" (1/1) ... [2018-11-18 16:58:09,806 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:58:09" (1/1) ... [2018-11-18 16:58:09,806 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:58:09" (1/1) ... [2018-11-18 16:58:09,811 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:58:09" (1/1) ... [2018-11-18 16:58:09,815 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:58:09" (1/1) ... [2018-11-18 16:58:09,816 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:58:09" (1/1) ... [2018-11-18 16:58:09,817 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 16:58:09,818 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 16:58:09,818 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 16:58:09,818 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 16:58:09,819 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:58:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d36c392b-e955-4254-8208-42e1f13dccd0/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:58:09,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 16:58:09,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 16:58:09,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 16:58:09,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 16:58:09,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 16:58:09,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 16:58:10,059 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 16:58:10,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:58:10 BoogieIcfgContainer [2018-11-18 16:58:10,059 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 16:58:10,060 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 16:58:10,060 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 16:58:10,063 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 16:58:10,064 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 16:58:10,064 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 04:58:09" (1/3) ... [2018-11-18 16:58:10,065 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1ba59ce9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 04:58:10, skipping insertion in model container [2018-11-18 16:58:10,065 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 16:58:10,066 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:58:09" (2/3) ... [2018-11-18 16:58:10,066 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1ba59ce9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 04:58:10, skipping insertion in model container [2018-11-18 16:58:10,066 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 16:58:10,066 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:58:10" (3/3) ... [2018-11-18 16:58:10,067 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-11-18 16:58:10,100 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 16:58:10,100 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 16:58:10,100 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 16:58:10,101 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 16:58:10,101 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 16:58:10,101 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 16:58:10,101 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 16:58:10,101 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 16:58:10,101 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 16:58:10,109 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2018-11-18 16:58:10,122 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-18 16:58:10,122 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:58:10,123 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:58:10,128 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 16:58:10,128 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 16:58:10,128 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 16:58:10,129 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2018-11-18 16:58:10,130 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-18 16:58:10,130 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:58:10,130 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:58:10,130 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 16:58:10,130 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 16:58:10,137 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~ret12.base, main_#t~ret12.offset, main_~length~0, main_~n~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~0 := main_#t~nondet9;havoc main_#t~nondet9; 13#L561true assume !(main_~length~0 < 1); 18#L561-2true assume !(main_~n~0 < 1); 11#L564-1true call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(main_~length~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1), 1);assume { :begin_inline_cstrncpy } true;cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset, cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset, cstrncpy_#in~n := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset, main_~n~0;havoc cstrncpy_#res.base, cstrncpy_#res.offset;havoc cstrncpy_#t~post2, cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset, cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset, cstrncpy_#t~mem5, cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset, cstrncpy_#t~post6, cstrncpy_~s1.base, cstrncpy_~s1.offset, cstrncpy_~s2.base, cstrncpy_~s2.offset, cstrncpy_~n, cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset, cstrncpy_~src~0.base, cstrncpy_~src~0.offset, cstrncpy_~us~0.base, cstrncpy_~us~0.offset, cstrncpy_~n2~0;cstrncpy_~s1.base, cstrncpy_~s1.offset := cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset;cstrncpy_~s2.base, cstrncpy_~s2.offset := cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset;cstrncpy_~n := cstrncpy_#in~n;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_~s1.base, cstrncpy_~s1.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_~s2.base, cstrncpy_~s2.offset;havoc cstrncpy_~us~0.base, cstrncpy_~us~0.offset;havoc cstrncpy_~n2~0; 7#L546-3true [2018-11-18 16:58:10,137 INFO L796 eck$LassoCheckResult]: Loop: 7#L546-3true assume true; 6#L546-1true assume !!(cstrncpy_~n > 0);cstrncpy_#t~post2 := cstrncpy_~n;cstrncpy_~n := cstrncpy_#t~post2 - 1;havoc cstrncpy_#t~post2;cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_#t~post3.base, 1 + cstrncpy_#t~post3.offset;cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset := cstrncpy_~src~0.base, cstrncpy_~src~0.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_#t~post4.base, 1 + cstrncpy_#t~post4.offset;call cstrncpy_#t~mem5 := read~int(cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset, 1);call write~int(cstrncpy_#t~mem5, cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset, 1); 3#L548true assume !(0 == cstrncpy_#t~mem5);havoc cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset;havoc cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset;havoc cstrncpy_#t~mem5; 7#L546-3true [2018-11-18 16:58:10,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:58:10,142 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-11-18 16:58:10,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:58:10,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:58:10,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:58:10,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:58:10,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:58:10,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:58:10,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:58:10,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:58:10,228 INFO L82 PathProgramCache]: Analyzing trace with hash 48869, now seen corresponding path program 1 times [2018-11-18 16:58:10,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:58:10,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:58:10,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:58:10,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:58:10,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:58:10,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:58:10,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:58:10,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:58:10,245 INFO L82 PathProgramCache]: Analyzing trace with hash 180428672, now seen corresponding path program 1 times [2018-11-18 16:58:10,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:58:10,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:58:10,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:58:10,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:58:10,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:58:10,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:58:10,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:58:10,586 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 84 [2018-11-18 16:58:10,663 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 16:58:10,664 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 16:58:10,664 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 16:58:10,665 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 16:58:10,665 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 16:58:10,665 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:58:10,665 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 16:58:10,665 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 16:58:10,665 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncpy-alloca_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2018-11-18 16:58:10,665 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 16:58:10,666 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 16:58:10,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:58:10,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:58:10,884 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2018-11-18 16:58:10,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:58:10,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:58:10,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:58:10,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:58:10,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:58:10,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:58:10,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:58:10,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:58:10,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:58:10,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:58:10,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:58:10,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:58:10,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:58:10,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:58:10,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:58:10,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:58:10,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:58:10,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:58:10,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:58:10,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:58:11,372 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 16:58:11,376 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 16:58:11,378 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:58:11,380 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:58:11,380 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:58:11,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:58:11,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:58:11,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:58:11,382 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:58:11,382 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:58:11,384 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:58:11,385 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:58:11,385 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:58:11,386 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 16:58:11,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:58:11,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:58:11,390 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 16:58:11,390 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:58:11,410 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:58:11,411 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:58:11,415 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:58:11,415 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:58:11,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:58:11,415 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:58:11,416 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:58:11,417 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:58:11,422 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:58:11,422 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:58:11,422 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:58:11,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:58:11,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:58:11,423 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:58:11,425 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:58:11,425 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:58:11,435 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:58:11,436 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:58:11,436 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:58:11,436 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:58:11,436 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:58:11,437 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:58:11,439 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:58:11,440 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:58:11,448 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:58:11,449 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:58:11,449 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:58:11,449 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:58:11,450 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:58:11,450 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:58:11,450 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:58:11,450 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:58:11,450 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:58:11,451 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:58:11,451 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:58:11,451 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:58:11,452 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:58:11,452 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:58:11,452 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:58:11,453 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:58:11,453 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:58:11,458 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:58:11,458 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:58:11,458 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:58:11,458 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 16:58:11,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:58:11,459 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:58:11,461 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 16:58:11,461 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:58:11,471 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:58:11,471 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:58:11,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:58:11,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:58:11,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:58:11,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:58:11,473 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:58:11,473 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:58:11,475 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:58:11,475 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:58:11,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:58:11,476 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:58:11,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:58:11,476 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:58:11,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:58:11,477 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:58:11,477 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:58:11,479 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:58:11,479 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:58:11,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:58:11,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:58:11,480 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:58:11,480 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:58:11,485 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:58:11,485 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:58:11,552 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 16:58:11,575 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 16:58:11,575 INFO L444 ModelExtractionUtils]: 48 out of 55 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-18 16:58:11,577 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 16:58:11,578 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 16:58:11,579 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 16:58:11,579 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncpy_~n) = 1*ULTIMATE.start_cstrncpy_~n Supporting invariants [] [2018-11-18 16:58:11,624 INFO L297 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2018-11-18 16:58:11,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:58:11,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:58:11,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:58:11,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:58:11,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:58:11,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:58:11,713 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 16:58:11,714 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 4 states. [2018-11-18 16:58:11,745 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states.. Second operand 4 states. Result 34 states and 43 transitions. Complement of second has 5 states. [2018-11-18 16:58:11,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-18 16:58:11,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 16:58:11,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2018-11-18 16:58:11,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 5 letters. Loop has 3 letters. [2018-11-18 16:58:11,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:58:11,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 8 letters. Loop has 3 letters. [2018-11-18 16:58:11,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:58:11,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 5 letters. Loop has 6 letters. [2018-11-18 16:58:11,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:58:11,752 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 43 transitions. [2018-11-18 16:58:11,754 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 16:58:11,757 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 13 states and 16 transitions. [2018-11-18 16:58:11,758 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-18 16:58:11,758 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-18 16:58:11,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2018-11-18 16:58:11,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 16:58:11,759 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-11-18 16:58:11,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2018-11-18 16:58:11,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2018-11-18 16:58:11,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 16:58:11,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2018-11-18 16:58:11,781 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2018-11-18 16:58:11,781 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2018-11-18 16:58:11,781 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 16:58:11,781 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2018-11-18 16:58:11,782 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 16:58:11,782 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:58:11,782 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:58:11,782 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:58:11,782 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 16:58:11,782 INFO L794 eck$LassoCheckResult]: Stem: 156#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 150#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~ret12.base, main_#t~ret12.offset, main_~length~0, main_~n~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~0 := main_#t~nondet9;havoc main_#t~nondet9; 151#L561 assume !(main_~length~0 < 1); 159#L561-2 assume !(main_~n~0 < 1); 157#L564-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(main_~length~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1), 1);assume { :begin_inline_cstrncpy } true;cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset, cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset, cstrncpy_#in~n := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset, main_~n~0;havoc cstrncpy_#res.base, cstrncpy_#res.offset;havoc cstrncpy_#t~post2, cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset, cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset, cstrncpy_#t~mem5, cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset, cstrncpy_#t~post6, cstrncpy_~s1.base, cstrncpy_~s1.offset, cstrncpy_~s2.base, cstrncpy_~s2.offset, cstrncpy_~n, cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset, cstrncpy_~src~0.base, cstrncpy_~src~0.offset, cstrncpy_~us~0.base, cstrncpy_~us~0.offset, cstrncpy_~n2~0;cstrncpy_~s1.base, cstrncpy_~s1.offset := cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset;cstrncpy_~s2.base, cstrncpy_~s2.offset := cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset;cstrncpy_~n := cstrncpy_#in~n;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_~s1.base, cstrncpy_~s1.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_~s2.base, cstrncpy_~s2.offset;havoc cstrncpy_~us~0.base, cstrncpy_~us~0.offset;havoc cstrncpy_~n2~0; 158#L546-3 assume true; 160#L546-1 assume !!(cstrncpy_~n > 0);cstrncpy_#t~post2 := cstrncpy_~n;cstrncpy_~n := cstrncpy_#t~post2 - 1;havoc cstrncpy_#t~post2;cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_#t~post3.base, 1 + cstrncpy_#t~post3.offset;cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset := cstrncpy_~src~0.base, cstrncpy_~src~0.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_#t~post4.base, 1 + cstrncpy_#t~post4.offset;call cstrncpy_#t~mem5 := read~int(cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset, 1);call write~int(cstrncpy_#t~mem5, cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset, 1); 152#L548 assume 0 == cstrncpy_#t~mem5;havoc cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset;havoc cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset;havoc cstrncpy_#t~mem5;cstrncpy_~us~0.base, cstrncpy_~us~0.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~n2~0 := cstrncpy_~n; 153#L551-4 [2018-11-18 16:58:11,783 INFO L796 eck$LassoCheckResult]: Loop: 153#L551-4 assume true; 155#L551-1 cstrncpy_#t~post6 := cstrncpy_~n2~0;cstrncpy_~n2~0 := cstrncpy_#t~post6 - 1; 161#L551-2 assume !!(0 != cstrncpy_#t~post6);havoc cstrncpy_#t~post6;cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset := cstrncpy_~us~0.base, cstrncpy_~us~0.offset;cstrncpy_~us~0.base, cstrncpy_~us~0.offset := cstrncpy_#t~post7.base, 1 + cstrncpy_#t~post7.offset;call write~int(0, cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset, 1);havoc cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset; 153#L551-4 [2018-11-18 16:58:11,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:58:11,783 INFO L82 PathProgramCache]: Analyzing trace with hash 180428656, now seen corresponding path program 1 times [2018-11-18 16:58:11,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:58:11,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:58:11,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:58:11,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:58:11,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:58:11,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:58:11,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:58:11,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:58:11,801 INFO L82 PathProgramCache]: Analyzing trace with hash 61636, now seen corresponding path program 1 times [2018-11-18 16:58:11,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:58:11,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:58:11,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:58:11,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:58:11,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:58:11,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:58:11,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:58:11,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:58:11,807 INFO L82 PathProgramCache]: Analyzing trace with hash 2146035445, now seen corresponding path program 1 times [2018-11-18 16:58:11,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:58:11,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:58:11,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:58:11,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:58:11,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:58:11,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:58:11,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:58:12,122 WARN L180 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 121 [2018-11-18 16:58:12,200 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 16:58:12,200 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 16:58:12,200 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 16:58:12,200 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 16:58:12,200 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 16:58:12,201 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:58:12,201 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 16:58:12,201 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 16:58:12,201 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncpy-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-11-18 16:58:12,201 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 16:58:12,201 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 16:58:12,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:58:12,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:58:12,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:58:12,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:58:12,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:58:12,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:58:12,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:58:12,374 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 81 [2018-11-18 16:58:12,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:58:12,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:58:12,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:58:12,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:58:12,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:58:12,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:58:12,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:58:12,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:58:12,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:58:12,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:58:12,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:58:12,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:58:12,763 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 16:58:12,763 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 16:58:12,764 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:58:12,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:58:12,764 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:58:12,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:58:12,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:58:12,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:58:12,765 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:58:12,766 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:58:12,766 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:58:12,767 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:58:12,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:58:12,767 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:58:12,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:58:12,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:58:12,768 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:58:12,768 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:58:12,768 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:58:12,768 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:58:12,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:58:12,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:58:12,769 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:58:12,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:58:12,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:58:12,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:58:12,769 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:58:12,770 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:58:12,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:58:12,770 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:58:12,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:58:12,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:58:12,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:58:12,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:58:12,772 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:58:12,772 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:58:12,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:58:12,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:58:12,774 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:58:12,774 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:58:12,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:58:12,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:58:12,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:58:12,775 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:58:12,775 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:58:12,775 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:58:12,775 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:58:12,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:58:12,776 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:58:12,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:58:12,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:58:12,776 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:58:12,777 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:58:12,777 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:58:12,777 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:58:12,777 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:58:12,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:58:12,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:58:12,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:58:12,778 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:58:12,779 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:58:12,779 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:58:12,782 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:58:12,782 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:58:12,783 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:58:12,783 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:58:12,783 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:58:12,783 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:58:12,783 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:58:12,783 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:58:12,783 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:58:12,784 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:58:12,784 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:58:12,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:58:12,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:58:12,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:58:12,784 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:58:12,785 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:58:12,785 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:58:12,787 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:58:12,787 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:58:12,787 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:58:12,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:58:12,788 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:58:12,788 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:58:12,789 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:58:12,789 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:58:12,792 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:58:12,793 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:58:12,793 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:58:12,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:58:12,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:58:12,794 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:58:12,794 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:58:12,794 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:58:12,796 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:58:12,796 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:58:12,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:58:12,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:58:12,797 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:58:12,797 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:58:12,797 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:58:12,798 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:58:12,799 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:58:12,799 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:58:12,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:58:12,800 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:58:12,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:58:12,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:58:12,800 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:58:12,801 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:58:12,801 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:58:12,801 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:58:12,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:58:12,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:58:12,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:58:12,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:58:12,802 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:58:12,803 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:58:12,803 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:58:12,805 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:58:12,805 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:58:12,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:58:12,806 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 16:58:12,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:58:12,806 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:58:12,808 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 16:58:12,808 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:58:12,830 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:58:12,831 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:58:12,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:58:12,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:58:12,831 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:58:12,831 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:58:12,838 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-18 16:58:12,838 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-18 16:58:12,910 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 16:58:12,961 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-18 16:58:12,961 INFO L444 ModelExtractionUtils]: 69 out of 76 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-18 16:58:12,961 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 16:58:12,963 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2018-11-18 16:58:12,963 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 16:58:12,963 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_2, ULTIMATE.start_cstrncpy_~us~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_2 - 1*ULTIMATE.start_cstrncpy_~us~0.offset Supporting invariants [] [2018-11-18 16:58:13,023 INFO L297 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2018-11-18 16:58:13,027 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 16:58:13,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:58:13,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:58:13,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:58:13,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:58:13,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:58:13,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:58:13,073 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2018-11-18 16:58:13,073 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-11-18 16:58:13,101 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 15 states and 19 transitions. Complement of second has 5 states. [2018-11-18 16:58:13,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-18 16:58:13,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 16:58:13,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-11-18 16:58:13,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 8 letters. Loop has 3 letters. [2018-11-18 16:58:13,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:58:13,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 11 letters. Loop has 3 letters. [2018-11-18 16:58:13,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:58:13,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 8 letters. Loop has 6 letters. [2018-11-18 16:58:13,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:58:13,103 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2018-11-18 16:58:13,104 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 16:58:13,104 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 0 states and 0 transitions. [2018-11-18 16:58:13,104 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 16:58:13,104 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 16:58:13,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 16:58:13,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 16:58:13,104 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 16:58:13,104 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 16:58:13,104 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 16:58:13,105 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 16:58:13,105 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 16:58:13,105 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 16:58:13,105 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 16:58:13,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 04:58:13 BoogieIcfgContainer [2018-11-18 16:58:13,112 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 16:58:13,112 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 16:58:13,113 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 16:58:13,113 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 16:58:13,113 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:58:10" (3/4) ... [2018-11-18 16:58:13,116 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 16:58:13,116 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 16:58:13,117 INFO L168 Benchmark]: Toolchain (without parser) took 3684.21 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 339.2 MB). Free memory was 955.4 MB in the beginning and 1.3 GB in the end (delta: -304.1 MB). Peak memory consumption was 35.1 MB. Max. memory is 11.5 GB. [2018-11-18 16:58:13,117 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:58:13,118 INFO L168 Benchmark]: CACSL2BoogieTranslator took 326.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 955.4 MB in the beginning and 1.1 GB in the end (delta: -192.0 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. [2018-11-18 16:58:13,118 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.77 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-18 16:58:13,119 INFO L168 Benchmark]: Boogie Preprocessor took 21.36 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. [2018-11-18 16:58:13,119 INFO L168 Benchmark]: RCFGBuilder took 241.46 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: 28.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 11.5 GB. [2018-11-18 16:58:13,119 INFO L168 Benchmark]: BuchiAutomizer took 3052.61 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 179.3 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -143.5 MB). Peak memory consumption was 35.9 MB. Max. memory is 11.5 GB. [2018-11-18 16:58:13,120 INFO L168 Benchmark]: Witness Printer took 3.51 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:58:13,123 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 326.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 955.4 MB in the beginning and 1.1 GB in the end (delta: -192.0 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.77 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.36 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. * RCFGBuilder took 241.46 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: 28.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3052.61 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 179.3 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -143.5 MB). Peak memory consumption was 35.9 MB. Max. memory is 11.5 GB. * Witness Printer took 3.51 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 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 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function n and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (n * sizeof(char))] + -1 * us and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.0s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 2.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 12 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 28 SDtfs, 31 SDslu, 17 SDs, 0 SdLazy, 9 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital224 mio100 ax100 hnf99 lsp97 ukn85 mio100 lsp48 div100 bol100 ite100 ukn100 eq202 hnf88 smp100 dnf116 smp100 tf100 neg99 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 132ms VariablesStem: 14 VariablesLoop: 9 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 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...