./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/cstrncpy_malloc_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b4b22532-09eb-4e8b-97c8-eaac5c30c5a7/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b4b22532-09eb-4e8b-97c8-eaac5c30c5a7/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b4b22532-09eb-4e8b-97c8-eaac5c30c5a7/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b4b22532-09eb-4e8b-97c8-eaac5c30c5a7/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrncpy_malloc_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_b4b22532-09eb-4e8b-97c8-eaac5c30c5a7/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b4b22532-09eb-4e8b-97c8-eaac5c30c5a7/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 7c56c09a74d2fc3893706afbe8a4ee36044dd617 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 12:43:36,838 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:43:36,839 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:43:36,845 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:43:36,845 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:43:36,846 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:43:36,847 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:43:36,848 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:43:36,849 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:43:36,850 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:43:36,850 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:43:36,850 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:43:36,851 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:43:36,852 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:43:36,853 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:43:36,853 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:43:36,854 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:43:36,855 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:43:36,856 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:43:36,857 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:43:36,858 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:43:36,859 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:43:36,861 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:43:36,861 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:43:36,861 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:43:36,862 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:43:36,862 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:43:36,863 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:43:36,863 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:43:36,864 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:43:36,864 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:43:36,865 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:43:36,865 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:43:36,865 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:43:36,866 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:43:36,866 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:43:36,867 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b4b22532-09eb-4e8b-97c8-eaac5c30c5a7/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 12:43:36,877 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:43:36,878 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:43:36,879 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:43:36,879 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:43:36,879 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:43:36,879 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 12:43:36,879 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 12:43:36,879 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 12:43:36,880 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 12:43:36,880 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 12:43:36,880 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 12:43:36,880 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:43:36,880 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 12:43:36,880 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:43:36,880 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:43:36,881 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 12:43:36,881 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 12:43:36,881 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 12:43:36,881 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:43:36,881 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 12:43:36,881 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:43:36,881 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 12:43:36,882 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:43:36,882 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:43:36,882 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 12:43:36,882 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:43:36,882 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:43:36,882 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 12:43:36,883 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 12:43:36,883 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_b4b22532-09eb-4e8b-97c8-eaac5c30c5a7/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7c56c09a74d2fc3893706afbe8a4ee36044dd617 [2018-11-23 12:43:36,904 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:43:36,912 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:43:36,915 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:43:36,916 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:43:36,916 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:43:36,917 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b4b22532-09eb-4e8b-97c8-eaac5c30c5a7/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/cstrncpy_malloc_true-termination.c.i [2018-11-23 12:43:36,959 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b4b22532-09eb-4e8b-97c8-eaac5c30c5a7/bin-2019/uautomizer/data/1f9aaf848/e5569628215043bd936b77eae4f420c4/FLAG57546937e [2018-11-23 12:43:37,383 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:43:37,383 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b4b22532-09eb-4e8b-97c8-eaac5c30c5a7/sv-benchmarks/c/termination-15/cstrncpy_malloc_true-termination.c.i [2018-11-23 12:43:37,389 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b4b22532-09eb-4e8b-97c8-eaac5c30c5a7/bin-2019/uautomizer/data/1f9aaf848/e5569628215043bd936b77eae4f420c4/FLAG57546937e [2018-11-23 12:43:37,397 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b4b22532-09eb-4e8b-97c8-eaac5c30c5a7/bin-2019/uautomizer/data/1f9aaf848/e5569628215043bd936b77eae4f420c4 [2018-11-23 12:43:37,400 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:43:37,400 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:43:37,401 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:43:37,401 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:43:37,403 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:43:37,404 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:43:37" (1/1) ... [2018-11-23 12:43:37,405 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35add03f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:43:37, skipping insertion in model container [2018-11-23 12:43:37,406 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:43:37" (1/1) ... [2018-11-23 12:43:37,412 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:43:37,438 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:43:37,639 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:43:37,647 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:43:37,724 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:43:37,765 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:43:37,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:43:37 WrapperNode [2018-11-23 12:43:37,765 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:43:37,766 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:43:37,766 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:43:37,766 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:43:37,773 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:43:37" (1/1) ... [2018-11-23 12:43:37,784 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:43:37" (1/1) ... [2018-11-23 12:43:37,801 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:43:37,802 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:43:37,802 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:43:37,802 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:43:37,809 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:43:37" (1/1) ... [2018-11-23 12:43:37,810 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:43:37" (1/1) ... [2018-11-23 12:43:37,811 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:43:37" (1/1) ... [2018-11-23 12:43:37,811 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:43:37" (1/1) ... [2018-11-23 12:43:37,816 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:43:37" (1/1) ... [2018-11-23 12:43:37,820 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:43:37" (1/1) ... [2018-11-23 12:43:37,821 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:43:37" (1/1) ... [2018-11-23 12:43:37,822 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:43:37,823 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:43:37,823 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:43:37,823 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:43:37,824 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:43:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b4b22532-09eb-4e8b-97c8-eaac5c30c5a7/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-23 12:43:37,867 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:43:37,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:43:37,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:43:37,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:43:37,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:43:37,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:43:38,023 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:43:38,023 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 12:43:38,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:43:38 BoogieIcfgContainer [2018-11-23 12:43:38,024 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:43:38,024 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 12:43:38,024 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 12:43:38,027 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 12:43:38,028 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 12:43:38,028 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 12:43:37" (1/3) ... [2018-11-23 12:43:38,029 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@152a682d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 12:43:38, skipping insertion in model container [2018-11-23 12:43:38,029 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 12:43:38,030 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:43:37" (2/3) ... [2018-11-23 12:43:38,030 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@152a682d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 12:43:38, skipping insertion in model container [2018-11-23 12:43:38,030 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 12:43:38,030 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:43:38" (3/3) ... [2018-11-23 12:43:38,031 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrncpy_malloc_true-termination.c.i [2018-11-23 12:43:38,075 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:43:38,076 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 12:43:38,076 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 12:43:38,076 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 12:43:38,076 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:43:38,076 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:43:38,076 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 12:43:38,076 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:43:38,077 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 12:43:38,088 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-23 12:43:38,108 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-23 12:43:38,108 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 12:43:38,109 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 12:43:38,114 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 12:43:38,114 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 12:43:38,114 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 12:43:38,114 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-23 12:43:38,115 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-23 12:43:38,115 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 12:43:38,115 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 12:43:38,115 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 12:43:38,116 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 12:43:38,121 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet211, main_#t~nondet212, main_#t~malloc213.base, main_#t~malloc213.offset, main_#t~malloc214.base, main_#t~malloc214.offset, main_#t~ret215.base, main_#t~ret215.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~nondet211;havoc main_#t~nondet211;main_~n~0 := main_#t~nondet212;havoc main_#t~nondet212; 5#L385true assume !(main_~length~0 < 1); 7#L385-2true assume !(main_~n~0 < 1); 3#L388-1true call main_#t~malloc213.base, main_#t~malloc213.offset := #Ultimate.alloc(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc213.base, main_#t~malloc213.offset;call main_#t~malloc214.base, main_#t~malloc214.offset := #Ultimate.alloc(main_~length~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc214.base, main_#t~malloc214.offset;call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1), 1);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~post205, cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset, cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset, cstrncpy_#t~mem208, cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset, cstrncpy_#t~post209, 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; 14#L370-2true [2018-11-23 12:43:38,121 INFO L796 eck$LassoCheckResult]: Loop: 14#L370-2true assume !!(cstrncpy_~n > 0);cstrncpy_#t~post205 := cstrncpy_~n;cstrncpy_~n := cstrncpy_#t~post205 - 1;havoc cstrncpy_#t~post205;cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_#t~post206.base, 1 + cstrncpy_#t~post206.offset;cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset := cstrncpy_~src~0.base, cstrncpy_~src~0.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_#t~post207.base, 1 + cstrncpy_#t~post207.offset;call cstrncpy_#t~mem208 := read~int(cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset, 1);call write~int(cstrncpy_#t~mem208, cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset, 1); 9#L372true assume !(0 == cstrncpy_#t~mem208);havoc cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset;havoc cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset;havoc cstrncpy_#t~mem208; 14#L370-2true [2018-11-23 12:43:38,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:38,125 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-11-23 12:43:38,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:38,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:38,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:38,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:38,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:38,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:43:38,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:43:38,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:38,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1747, now seen corresponding path program 1 times [2018-11-23 12:43:38,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:38,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:38,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:38,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:38,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:38,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:43:38,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:43:38,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:38,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935768, now seen corresponding path program 1 times [2018-11-23 12:43:38,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:38,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:38,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:38,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:38,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:38,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:43:38,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:43:38,570 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 84 [2018-11-23 12:43:38,656 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 12:43:38,657 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 12:43:38,657 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 12:43:38,658 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 12:43:38,658 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 12:43:38,658 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 12:43:38,658 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 12:43:38,658 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 12:43:38,658 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncpy_malloc_true-termination.c.i_Iteration1_Lasso [2018-11-23 12:43:38,658 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 12:43:38,659 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 12:43:38,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:43:38,684 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-23 12:43:38,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-23 12:43:38,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:43:38,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-23 12:43:38,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:43:38,694 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-23 12:43:38,695 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-23 12:43:38,697 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-23 12:43:38,699 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-23 12:43:38,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:43:38,701 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-23 12:43:38,898 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 74 [2018-11-23 12:43:38,980 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-23 12:43:38,981 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-23 12:43:38,985 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-23 12:43:38,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-23 12:43:38,987 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-23 12:43:38,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-23 12:43:38,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-23 12:43:38,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-23 12:43:38,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-23 12:43:38,998 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-23 12:43:39,380 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 12:43:39,385 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 12:43:39,386 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-23 12:43:39,388 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:43:39,388 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:43:39,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:43:39,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:43:39,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:43:39,391 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:43:39,391 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:43:39,393 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:43:39,393 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-23 12:43:39,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:43:39,394 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:43:39,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:43:39,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:43:39,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:43:39,395 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:43:39,395 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:43:39,396 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:43:39,396 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-23 12:43:39,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:43:39,397 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:43:39,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:43:39,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:43:39,397 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:43:39,397 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:43:39,397 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:43:39,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:43:39,399 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-23 12:43:39,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:43:39,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:43:39,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:43:39,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:43:39,401 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:43:39,402 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:43:39,405 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:43:39,405 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-23 12:43:39,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:43:39,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:43:39,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:43:39,406 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:43:39,407 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:43:39,408 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:43:39,410 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:43:39,410 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-23 12:43:39,411 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:43:39,411 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:43:39,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:43:39,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:43:39,411 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:43:39,412 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:43:39,412 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:43:39,414 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:43:39,414 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-23 12:43:39,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:43:39,421 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:43:39,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:43:39,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:43:39,421 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:43:39,422 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:43:39,422 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:43:39,423 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:43:39,423 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-23 12:43:39,423 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:43:39,423 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:43:39,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:43:39,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:43:39,424 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:43:39,424 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:43:39,424 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:43:39,425 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:43:39,425 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-23 12:43:39,426 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:43:39,426 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:43:39,426 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:43:39,426 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:43:39,426 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:43:39,427 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:43:39,427 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:43:39,427 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:43:39,428 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-23 12:43:39,428 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:43:39,428 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:43:39,428 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:43:39,428 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:43:39,428 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:43:39,429 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:43:39,429 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:43:39,429 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:43:39,430 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-23 12:43:39,430 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:43:39,430 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:43:39,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:43:39,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:43:39,431 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:43:39,431 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:43:39,431 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:43:39,432 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:43:39,432 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-23 12:43:39,433 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:43:39,433 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:43:39,433 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:43:39,433 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:43:39,441 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:43:39,441 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:43:39,499 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 12:43:39,539 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 12:43:39,539 INFO L444 ModelExtractionUtils]: 53 out of 58 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 12:43:39,541 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 12:43:39,543 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 12:43:39,543 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 12:43:39,543 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc213.base)_1, ULTIMATE.start_cstrncpy_~dst~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc213.base)_1 - 1*ULTIMATE.start_cstrncpy_~dst~0.offset Supporting invariants [] [2018-11-23 12:43:39,599 INFO L297 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2018-11-23 12:43:39,604 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 12:43:39,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:39,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:39,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:43:39,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:39,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:43:39,692 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-23 12:43:39,702 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-23 12:43:39,703 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states. Second operand 3 states. [2018-11-23 12:43:39,738 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states.. Second operand 3 states. Result 30 states and 40 transitions. Complement of second has 5 states. [2018-11-23 12:43:39,739 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-23 12:43:39,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:39,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-11-23 12:43:39,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 5 letters. Loop has 2 letters. [2018-11-23 12:43:39,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:43:39,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 7 letters. Loop has 2 letters. [2018-11-23 12:43:39,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:43:39,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 5 letters. Loop has 4 letters. [2018-11-23 12:43:39,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:43:39,744 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 40 transitions. [2018-11-23 12:43:39,746 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 12:43:39,748 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 11 states and 14 transitions. [2018-11-23 12:43:39,749 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-23 12:43:39,749 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-23 12:43:39,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2018-11-23 12:43:39,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 12:43:39,750 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-23 12:43:39,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2018-11-23 12:43:39,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-11-23 12:43:39,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:43:39,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-11-23 12:43:39,766 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-23 12:43:39,766 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-23 12:43:39,766 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 12:43:39,766 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2018-11-23 12:43:39,766 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 12:43:39,766 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 12:43:39,767 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 12:43:39,767 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:43:39,767 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 12:43:39,767 INFO L794 eck$LassoCheckResult]: Stem: 152#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 150#L-1 havoc main_#res;havoc main_#t~nondet211, main_#t~nondet212, main_#t~malloc213.base, main_#t~malloc213.offset, main_#t~malloc214.base, main_#t~malloc214.offset, main_#t~ret215.base, main_#t~ret215.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~nondet211;havoc main_#t~nondet211;main_~n~0 := main_#t~nondet212;havoc main_#t~nondet212; 151#L385 assume !(main_~length~0 < 1); 155#L385-2 assume !(main_~n~0 < 1); 153#L388-1 call main_#t~malloc213.base, main_#t~malloc213.offset := #Ultimate.alloc(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc213.base, main_#t~malloc213.offset;call main_#t~malloc214.base, main_#t~malloc214.offset := #Ultimate.alloc(main_~length~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc214.base, main_#t~malloc214.offset;call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1), 1);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~post205, cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset, cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset, cstrncpy_#t~mem208, cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset, cstrncpy_#t~post209, 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; 154#L370-2 assume !!(cstrncpy_~n > 0);cstrncpy_#t~post205 := cstrncpy_~n;cstrncpy_~n := cstrncpy_#t~post205 - 1;havoc cstrncpy_#t~post205;cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_#t~post206.base, 1 + cstrncpy_#t~post206.offset;cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset := cstrncpy_~src~0.base, cstrncpy_~src~0.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_#t~post207.base, 1 + cstrncpy_#t~post207.offset;call cstrncpy_#t~mem208 := read~int(cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset, 1);call write~int(cstrncpy_#t~mem208, cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset, 1); 148#L372 assume 0 == cstrncpy_#t~mem208;havoc cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset;havoc cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset;havoc cstrncpy_#t~mem208;cstrncpy_~us~0.base, cstrncpy_~us~0.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~n2~0 := cstrncpy_~n; 146#L375-3 [2018-11-23 12:43:39,767 INFO L796 eck$LassoCheckResult]: Loop: 146#L375-3 cstrncpy_#t~post209 := cstrncpy_~n2~0;cstrncpy_~n2~0 := cstrncpy_#t~post209 - 1; 147#L375-1 assume !!(0 != cstrncpy_#t~post209);havoc cstrncpy_#t~post209;cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset := cstrncpy_~us~0.base, cstrncpy_~us~0.offset;cstrncpy_~us~0.base, cstrncpy_~us~0.offset := cstrncpy_#t~post210.base, 1 + cstrncpy_#t~post210.offset;call write~int(0, cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset, 1);havoc cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset; 146#L375-3 [2018-11-23 12:43:39,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:39,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935753, now seen corresponding path program 1 times [2018-11-23 12:43:39,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:39,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:39,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:39,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:39,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:39,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:43:39,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:43:39,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:39,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 1 times [2018-11-23 12:43:39,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:39,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:39,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:39,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:39,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:39,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:43:39,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:43:39,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:39,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1298472078, now seen corresponding path program 1 times [2018-11-23 12:43:39,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:39,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:39,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:39,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:39,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:39,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:43:39,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:43:40,128 WARN L180 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 121 [2018-11-23 12:43:40,216 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 12:43:40,216 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 12:43:40,216 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 12:43:40,216 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 12:43:40,216 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 12:43:40,216 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 12:43:40,216 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 12:43:40,216 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 12:43:40,216 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncpy_malloc_true-termination.c.i_Iteration2_Lasso [2018-11-23 12:43:40,216 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 12:43:40,216 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 12:43:40,219 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-23 12:43:40,221 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-23 12:43:40,222 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-23 12:43:40,223 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-23 12:43:40,224 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-23 12:43:40,225 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-23 12:43:40,226 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-23 12:43:40,227 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-23 12:43:40,228 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-23 12:43:40,229 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-23 12:43:40,230 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-23 12:43:40,231 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-23 12:43:40,232 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-23 12:43:40,233 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-23 12:43:40,234 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-23 12:43:40,235 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-23 12:43:40,236 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-23 12:43:40,237 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-23 12:43:40,238 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-23 12:43:40,431 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 82 [2018-11-23 12:43:40,809 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 12:43:40,809 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 12:43:40,809 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-23 12:43:40,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:43:40,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:43:40,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:43:40,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:43:40,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:43:40,812 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:43:40,812 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:43:40,813 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:43:40,813 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-23 12:43:40,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:43:40,814 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:43:40,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:43:40,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:43:40,814 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:43:40,814 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:43:40,814 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:43:40,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:43:40,815 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-23 12:43:40,815 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:43:40,815 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:43:40,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:43:40,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:43:40,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:43:40,816 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:43:40,816 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:43:40,817 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:43:40,817 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-23 12:43:40,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:43:40,817 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:43:40,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:43:40,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:43:40,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:43:40,818 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:43:40,818 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:43:40,818 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:43:40,819 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-23 12:43:40,819 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:43:40,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:43:40,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:43:40,819 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:43:40,820 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:43:40,820 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:43:40,822 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:43:40,822 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-23 12:43:40,822 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:43:40,822 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:43:40,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:43:40,823 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:43:40,823 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:43:40,823 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:43:40,823 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:43:40,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:43:40,824 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-23 12:43:40,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:43:40,824 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:43:40,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:43:40,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:43:40,825 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:43:40,825 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:43:40,825 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:43:40,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:43:40,826 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-23 12:43:40,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:43:40,826 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:43:40,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:43:40,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:43:40,826 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:43:40,827 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:43:40,827 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:43:40,827 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:43:40,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-23 12:43:40,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:43:40,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:43:40,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:43:40,832 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:43:40,833 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:43:40,833 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:43:40,834 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:43:40,834 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-23 12:43:40,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:43:40,835 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:43:40,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:43:40,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:43:40,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:43:40,835 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:43:40,835 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:43:40,836 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:43:40,839 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-23 12:43:40,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:43:40,839 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:43:40,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:43:40,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:43:40,839 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:43:40,840 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:43:40,840 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:43:40,840 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:43:40,840 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-23 12:43:40,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:43:40,841 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:43:40,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:43:40,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:43:40,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:43:40,841 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:43:40,841 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:43:40,842 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:43:40,842 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-23 12:43:40,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:43:40,843 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:43:40,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:43:40,843 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:43:40,843 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:43:40,843 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:43:40,843 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:43:40,844 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:43:40,844 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-23 12:43:40,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:43:40,844 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:43:40,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:43:40,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:43:40,845 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:43:40,845 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:43:40,845 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:43:40,845 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:43:40,846 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-23 12:43:40,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:43:40,846 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:43:40,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:43:40,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:43:40,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:43:40,847 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:43:40,847 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:43:40,847 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:43:40,848 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-23 12:43:40,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:43:40,848 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:43:40,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:43:40,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:43:40,849 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:43:40,850 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:43:40,850 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:43:40,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:43:40,851 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-23 12:43:40,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:43:40,851 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:43:40,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:43:40,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:43:40,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:43:40,852 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:43:40,852 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:43:40,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:43:40,852 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-23 12:43:40,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:43:40,853 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:43:40,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:43:40,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:43:40,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:43:40,853 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:43:40,853 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:43:40,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:43:40,856 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-23 12:43:40,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:43:40,857 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 12:43:40,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:43:40,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:43:40,859 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 12:43:40,859 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:43:40,867 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:43:40,867 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-23 12:43:40,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:43:40,868 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:43:40,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:43:40,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:43:40,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:43:40,868 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:43:40,868 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:43:40,869 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:43:40,869 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-23 12:43:40,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:43:40,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:43:40,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:43:40,870 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:43:40,876 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:43:40,876 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:43:40,878 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:43:40,878 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-23 12:43:40,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:43:40,879 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 12:43:40,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:43:40,879 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:43:40,882 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 12:43:40,882 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:43:40,888 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:43:40,888 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-23 12:43:40,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:43:40,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:43:40,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:43:40,889 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:43:40,890 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:43:40,890 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:43:40,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:43:40,891 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-23 12:43:40,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:43:40,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:43:40,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:43:40,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:43:40,892 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:43:40,892 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:43:40,894 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:43:40,894 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-23 12:43:40,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:43:40,895 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:43:40,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:43:40,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:43:40,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:43:40,895 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:43:40,895 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:43:40,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:43:40,896 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-23 12:43:40,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:43:40,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:43:40,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:43:40,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:43:40,897 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:43:40,897 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:43:40,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:43:40,899 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-23 12:43:40,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:43:40,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:43:40,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:43:40,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:43:40,901 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:43:40,901 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:43:40,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:43:40,905 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-23 12:43:40,905 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:43:40,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:43:40,906 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 12:43:40,906 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:43:40,914 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-23 12:43:40,914 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 12:43:41,005 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 12:43:41,098 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2018-11-23 12:43:41,099 INFO L444 ModelExtractionUtils]: 80 out of 91 variables were initially zero. Simplification set additionally 8 variables to zero. [2018-11-23 12:43:41,099 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 12:43:41,101 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2018-11-23 12:43:41,102 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 12:43:41,102 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc213.base)_2, ULTIMATE.start_cstrncpy_~us~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc213.base)_2 - 1*ULTIMATE.start_cstrncpy_~us~0.offset Supporting invariants [] [2018-11-23 12:43:41,150 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2018-11-23 12:43:41,152 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 12:43:41,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:41,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:41,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:43:41,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:41,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:43:41,214 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-23 12:43:41,214 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-23 12:43:41,214 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-11-23 12:43:41,254 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 12 states and 16 transitions. Complement of second has 5 states. [2018-11-23 12:43:41,255 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-23 12:43:41,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:43:41,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-11-23 12:43:41,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 2 letters. [2018-11-23 12:43:41,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:43:41,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 2 letters. [2018-11-23 12:43:41,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:43:41,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 4 letters. [2018-11-23 12:43:41,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:43:41,257 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 16 transitions. [2018-11-23 12:43:41,257 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 12:43:41,257 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 0 states and 0 transitions. [2018-11-23 12:43:41,257 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 12:43:41,257 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 12:43:41,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 12:43:41,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 12:43:41,258 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 12:43:41,258 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 12:43:41,258 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 12:43:41,258 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 12:43:41,258 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 12:43:41,258 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 12:43:41,258 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 12:43:41,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 12:43:41 BoogieIcfgContainer [2018-11-23 12:43:41,264 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 12:43:41,264 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:43:41,264 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:43:41,264 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:43:41,265 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:43:38" (3/4) ... [2018-11-23 12:43:41,267 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 12:43:41,268 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:43:41,268 INFO L168 Benchmark]: Toolchain (without parser) took 3868.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 191.4 MB). Free memory was 956.6 MB in the beginning and 875.7 MB in the end (delta: 80.9 MB). Peak memory consumption was 272.2 MB. Max. memory is 11.5 GB. [2018-11-23 12:43:41,269 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:43:41,269 INFO L168 Benchmark]: CACSL2BoogieTranslator took 364.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -163.2 MB). Peak memory consumption was 28.9 MB. Max. memory is 11.5 GB. [2018-11-23 12:43:41,270 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.47 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 12:43:41,270 INFO L168 Benchmark]: Boogie Preprocessor took 20.90 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-23 12:43:41,270 INFO L168 Benchmark]: RCFGBuilder took 200.93 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: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2018-11-23 12:43:41,271 INFO L168 Benchmark]: BuchiAutomizer took 3239.84 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 55.1 MB). Free memory was 1.1 GB in the beginning and 875.7 MB in the end (delta: 216.3 MB). Peak memory consumption was 271.4 MB. Max. memory is 11.5 GB. [2018-11-23 12:43:41,271 INFO L168 Benchmark]: Witness Printer took 3.41 ms. Allocated memory is still 1.2 GB. Free memory is still 875.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:43:41,275 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 364.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -163.2 MB). Peak memory consumption was 28.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.47 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.90 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 200.93 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: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3239.84 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 55.1 MB). Free memory was 1.1 GB in the beginning and 875.7 MB in the end (delta: 216.3 MB). Peak memory consumption was 271.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.41 ms. Allocated memory is still 1.2 GB. Free memory is still 875.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[malloc(n * sizeof(char))] + -1 * dst and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[malloc(n * sizeof(char))] + -1 * us and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.2s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 2.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. 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 10 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 24 SDtfs, 26 SDslu, 14 SDs, 0 SdLazy, 9 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital233 mio100 ax100 hnf99 lsp97 ukn84 mio100 lsp52 div100 bol100 ite100 ukn100 eq200 hnf88 smp100 dnf115 smp100 tf100 neg99 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 196ms VariablesStem: 17 VariablesLoop: 11 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...