./Ultimate.py --spec ../../sv-benchmarks/c/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 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_1eb501ee-2306-41a2-b542-85e7ad28171b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1eb501ee-2306-41a2-b542-85e7ad28171b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1eb501ee-2306-41a2-b542-85e7ad28171b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1eb501ee-2306-41a2-b542-85e7ad28171b/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_1eb501ee-2306-41a2-b542-85e7ad28171b/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1eb501ee-2306-41a2-b542-85e7ad28171b/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-1dbac8b [2018-10-27 06:09:20,172 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:09:20,174 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:09:20,184 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:09:20,184 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:09:20,185 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:09:20,187 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:09:20,188 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:09:20,189 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:09:20,191 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:09:20,191 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:09:20,192 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:09:20,192 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:09:20,193 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:09:20,195 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:09:20,195 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:09:20,196 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:09:20,197 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:09:20,199 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:09:20,201 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:09:20,202 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:09:20,203 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:09:20,205 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:09:20,205 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:09:20,206 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:09:20,207 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:09:20,208 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:09:20,208 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:09:20,209 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:09:20,211 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:09:20,211 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:09:20,212 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:09:20,212 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:09:20,212 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:09:20,213 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:09:20,214 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:09:20,215 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1eb501ee-2306-41a2-b542-85e7ad28171b/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-10-27 06:09:20,228 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:09:20,229 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:09:20,230 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:09:20,230 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:09:20,230 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:09:20,231 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:09:20,231 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:09:20,231 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:09:20,231 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:09:20,231 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:09:20,231 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:09:20,232 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:09:20,232 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:09:20,232 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:09:20,232 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:09:20,232 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:09:20,232 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:09:20,233 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:09:20,233 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:09:20,233 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:09:20,233 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:09:20,233 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:09:20,234 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:09:20,234 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:09:20,234 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:09:20,236 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:09:20,237 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:09:20,237 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:09:20,238 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_1eb501ee-2306-41a2-b542-85e7ad28171b/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-10-27 06:09:20,266 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:09:20,278 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:09:20,281 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:09:20,283 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:09:20,283 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:09:20,284 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1eb501ee-2306-41a2-b542-85e7ad28171b/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/cstrncpy_malloc_true-termination.c.i [2018-10-27 06:09:20,343 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1eb501ee-2306-41a2-b542-85e7ad28171b/bin-2019/uautomizer/data/2e7965f95/6f0e5e14337146fea5d7865774d96645/FLAG145019499 [2018-10-27 06:09:20,721 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:09:20,722 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1eb501ee-2306-41a2-b542-85e7ad28171b/sv-benchmarks/c/termination-15/cstrncpy_malloc_true-termination.c.i [2018-10-27 06:09:20,737 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1eb501ee-2306-41a2-b542-85e7ad28171b/bin-2019/uautomizer/data/2e7965f95/6f0e5e14337146fea5d7865774d96645/FLAG145019499 [2018-10-27 06:09:20,749 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1eb501ee-2306-41a2-b542-85e7ad28171b/bin-2019/uautomizer/data/2e7965f95/6f0e5e14337146fea5d7865774d96645 [2018-10-27 06:09:20,752 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:09:20,753 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:09:20,754 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:09:20,755 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:09:20,758 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:09:20,759 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:09:20" (1/1) ... [2018-10-27 06:09:20,762 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@913c48b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:20, skipping insertion in model container [2018-10-27 06:09:20,763 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:09:20" (1/1) ... [2018-10-27 06:09:20,773 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:09:20,806 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:09:21,079 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:09:21,088 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:09:21,125 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:09:21,171 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:09:21,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:21 WrapperNode [2018-10-27 06:09:21,172 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:09:21,172 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:09:21,173 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:09:21,173 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:09:21,181 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:21" (1/1) ... [2018-10-27 06:09:21,194 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:21" (1/1) ... [2018-10-27 06:09:21,284 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:09:21,285 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:09:21,285 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:09:21,285 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:09:21,298 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:21" (1/1) ... [2018-10-27 06:09:21,298 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:21" (1/1) ... [2018-10-27 06:09:21,300 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:21" (1/1) ... [2018-10-27 06:09:21,300 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:21" (1/1) ... [2018-10-27 06:09:21,307 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:21" (1/1) ... [2018-10-27 06:09:21,311 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:21" (1/1) ... [2018-10-27 06:09:21,312 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:21" (1/1) ... [2018-10-27 06:09:21,314 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:09:21,319 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:09:21,319 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:09:21,319 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:09:21,320 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1eb501ee-2306-41a2-b542-85e7ad28171b/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-10-27 06:09:21,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-27 06:09:21,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-27 06:09:21,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:09:21,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:09:21,907 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:09:21,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:09:21 BoogieIcfgContainer [2018-10-27 06:09:21,908 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:09:21,909 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:09:21,909 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:09:21,913 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:09:21,913 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:09:21,914 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:09:20" (1/3) ... [2018-10-27 06:09:21,915 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@11caedc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:09:21, skipping insertion in model container [2018-10-27 06:09:21,915 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:09:21,915 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:21" (2/3) ... [2018-10-27 06:09:21,915 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@11caedc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:09:21, skipping insertion in model container [2018-10-27 06:09:21,915 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:09:21,915 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:09:21" (3/3) ... [2018-10-27 06:09:21,917 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrncpy_malloc_true-termination.c.i [2018-10-27 06:09:21,981 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:09:21,982 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:09:21,982 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:09:21,982 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:09:21,982 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:09:21,982 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:09:21,982 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:09:21,983 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:09:21,983 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:09:22,000 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2018-10-27 06:09:22,030 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-10-27 06:09:22,042 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:22,042 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:22,049 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:22,050 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:09:22,050 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:09:22,050 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2018-10-27 06:09:22,051 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-10-27 06:09:22,052 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:22,052 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:22,053 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:22,053 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:09:22,062 INFO L793 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 8#L385true assume !(main_~length~0 < 1); 11#L385-2true assume !(main_~n~0 < 1); 4#L388-1true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc213.base, main_#t~malloc213.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc213.base, main_#t~malloc213.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc214.base, main_#t~malloc214.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc214.base, main_#t~malloc214.offset; 14#L393true SUMMARY for call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1) * 1, 1); srcloc: L393 18#L393-1true assume { :begin_inline_cstrncpy } true;cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset, cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset, cstrncpy_#in~n := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset, main_~n~0;havoc cstrncpy_#res.base, cstrncpy_#res.offset;havoc cstrncpy_#t~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; 24#L370-3true [2018-10-27 06:09:22,063 INFO L795 eck$LassoCheckResult]: Loop: 24#L370-3true assume true; 22#L370-1true 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, cstrncpy_#t~post206.offset + 1;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, cstrncpy_#t~post207.offset + 1; 13#L372true SUMMARY for call cstrncpy_#t~mem208 := read~int(cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset, 1); srcloc: L372 16#L372-1true SUMMARY for call write~int(cstrncpy_#t~mem208, cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset, 1); srcloc: L372-1 19#L372-2true assume !(cstrncpy_#t~mem208 == 0);havoc cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset;havoc cstrncpy_#t~mem208;havoc cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset; 24#L370-3true [2018-10-27 06:09:22,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:22,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935495, now seen corresponding path program 1 times [2018-10-27 06:09:22,071 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:22,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:22,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:22,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:22,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:22,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:22,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:22,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:22,234 INFO L82 PathProgramCache]: Analyzing trace with hash 48855306, now seen corresponding path program 1 times [2018-10-27 06:09:22,235 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:22,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:22,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:22,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:22,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:22,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:22,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:22,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:22,259 INFO L82 PathProgramCache]: Analyzing trace with hash -795574524, now seen corresponding path program 1 times [2018-10-27 06:09:22,259 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:22,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:22,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:22,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:22,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:22,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:22,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:22,589 WARN L179 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-10-27 06:09:22,724 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-10-27 06:09:23,359 WARN L179 SmtUtils]: Spent 632.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 94 [2018-10-27 06:09:23,468 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2018-10-27 06:09:23,475 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:09:23,477 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:09:23,477 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:09:23,477 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:09:23,477 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:09:23,477 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:23,477 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:09:23,478 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:09:23,478 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncpy_malloc_true-termination.c.i_Iteration1_Lasso [2018-10-27 06:09:23,478 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:09:23,478 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:09:23,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:23,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:23,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:23,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:23,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:24,052 WARN L179 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 97 [2018-10-27 06:09:24,302 WARN L179 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 80 [2018-10-27 06:09:24,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:24,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:24,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:24,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:24,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:24,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:24,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:24,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:24,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:24,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:24,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:24,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:24,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:24,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:24,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:24,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:24,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:24,966 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:09:24,971 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:09:24,973 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-10-27 06:09:24,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:24,976 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:24,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:24,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:24,977 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:24,979 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:24,979 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:24,981 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:24,982 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-10-27 06:09:24,983 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:24,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:24,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:24,984 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:24,987 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:24,987 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:24,992 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:24,992 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-10-27 06:09:24,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:24,993 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:24,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:24,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:24,994 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:24,996 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:24,996 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:24,997 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:24,997 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-10-27 06:09:24,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:24,998 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:24,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:24,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:24,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:24,999 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:24,999 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:25,000 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:25,000 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-10-27 06:09:25,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:25,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:25,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:25,001 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:25,007 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:25,007 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:25,031 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:25,032 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-10-27 06:09:25,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:25,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:25,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:25,033 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:25,037 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:25,037 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:25,042 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:25,043 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-10-27 06:09:25,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:25,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:25,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:25,044 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:25,045 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:25,046 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:25,052 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:25,052 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-10-27 06:09:25,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:25,053 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:25,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:25,053 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:25,053 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:25,054 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:25,054 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:25,057 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:25,057 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-10-27 06:09:25,057 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:25,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:25,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:25,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:25,060 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:25,060 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:25,069 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:25,069 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-10-27 06:09:25,070 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:25,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:25,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:25,070 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:25,072 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:25,072 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:25,080 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:25,080 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-10-27 06:09:25,081 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:25,081 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:25,081 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:25,081 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:25,085 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:25,085 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:25,118 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:25,119 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-10-27 06:09:25,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:25,119 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:09:25,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:25,120 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:25,126 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:09:25,127 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:25,171 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:25,171 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-10-27 06:09:25,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:25,172 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:09:25,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:25,172 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:25,174 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:09:25,174 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:25,187 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:25,187 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:25,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:25,188 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:25,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:25,188 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:09:25,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:25,189 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:09:25,189 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:25,194 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:25,195 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:25,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:25,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:25,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:25,196 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:25,205 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:25,205 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:25,318 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:09:25,367 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-10-27 06:09:25,368 INFO L444 ModelExtractionUtils]: 64 out of 70 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-10-27 06:09:25,370 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:09:25,372 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:09:25,372 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:09:25,373 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncpy_~dst~0.offset, v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_1) = -1*ULTIMATE.start_cstrncpy_~dst~0.offset + 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_1 Supporting invariants [] [2018-10-27 06:09:25,558 INFO L297 tatePredicateManager]: 11 out of 13 supporting invariants were superfluous and have been removed [2018-10-27 06:09:25,564 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 06:09:25,566 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:09:25,566 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-10-27 06:09:25,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:25,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:25,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:25,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:25,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:25,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:25,733 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-10-27 06:09:25,734 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states. Second operand 6 states. [2018-10-27 06:09:25,863 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states.. Second operand 6 states. Result 43 states and 53 transitions. Complement of second has 8 states. [2018-10-27 06:09:25,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:09:25,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-27 06:09:25,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2018-10-27 06:09:25,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 7 letters. Loop has 5 letters. [2018-10-27 06:09:25,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:25,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 12 letters. Loop has 5 letters. [2018-10-27 06:09:25,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:25,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 7 letters. Loop has 10 letters. [2018-10-27 06:09:25,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:25,871 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 53 transitions. [2018-10-27 06:09:25,872 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-10-27 06:09:25,875 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 19 states and 22 transitions. [2018-10-27 06:09:25,876 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-10-27 06:09:25,877 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-10-27 06:09:25,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 22 transitions. [2018-10-27 06:09:25,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:09:25,878 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-10-27 06:09:25,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 22 transitions. [2018-10-27 06:09:25,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-10-27 06:09:25,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-27 06:09:25,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2018-10-27 06:09:25,908 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-10-27 06:09:25,908 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-10-27 06:09:25,908 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:09:25,908 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 22 transitions. [2018-10-27 06:09:25,909 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-10-27 06:09:25,909 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:25,909 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:25,910 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:25,910 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:09:25,912 INFO L793 eck$LassoCheckResult]: Stem: 202#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 198#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 194#L385 assume !(main_~length~0 < 1); 195#L385-2 assume !(main_~n~0 < 1); 189#L388-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc213.base, main_#t~malloc213.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc213.base, main_#t~malloc213.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc214.base, main_#t~malloc214.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc214.base, main_#t~malloc214.offset; 190#L393 SUMMARY for call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1) * 1, 1); srcloc: L393 201#L393-1 assume { :begin_inline_cstrncpy } true;cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset, cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset, cstrncpy_#in~n := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset, main_~n~0;havoc cstrncpy_#res.base, cstrncpy_#res.offset;havoc cstrncpy_#t~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; 205#L370-3 assume true; 207#L370-1 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, cstrncpy_#t~post206.offset + 1;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, cstrncpy_#t~post207.offset + 1; 199#L372 SUMMARY for call cstrncpy_#t~mem208 := read~int(cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset, 1); srcloc: L372 200#L372-1 SUMMARY for call write~int(cstrncpy_#t~mem208, cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset, 1); srcloc: L372-1 204#L372-2 assume cstrncpy_#t~mem208 == 0;havoc cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset;havoc cstrncpy_#t~mem208;havoc cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset;cstrncpy_~us~0.base, cstrncpy_~us~0.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~n2~0 := cstrncpy_~n; 193#L375-4 [2018-10-27 06:09:25,912 INFO L795 eck$LassoCheckResult]: Loop: 193#L375-4 assume true; 196#L375-1 cstrncpy_#t~post209 := cstrncpy_~n2~0;cstrncpy_~n2~0 := cstrncpy_#t~post209 - 1; 197#L375-2 assume !!(cstrncpy_#t~post209 != 0);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, cstrncpy_#t~post210.offset + 1; 191#L376 SUMMARY for call write~int(0, cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset, 1); srcloc: L376 192#L376-1 havoc cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset; 193#L375-4 [2018-10-27 06:09:25,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:25,913 INFO L82 PathProgramCache]: Analyzing trace with hash -795574542, now seen corresponding path program 1 times [2018-10-27 06:09:25,913 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:25,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:25,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:25,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:25,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:25,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:25,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:25,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:25,949 INFO L82 PathProgramCache]: Analyzing trace with hash 63050697, now seen corresponding path program 1 times [2018-10-27 06:09:25,949 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:25,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:25,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:25,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:25,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:25,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:25,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:25,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:25,965 INFO L82 PathProgramCache]: Analyzing trace with hash 227296120, now seen corresponding path program 1 times [2018-10-27 06:09:25,965 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:25,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:25,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:25,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:25,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:25,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:26,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:26,339 WARN L179 SmtUtils]: Spent 328.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-10-27 06:09:26,819 WARN L179 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 133 [2018-10-27 06:09:26,942 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-10-27 06:09:26,944 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:09:26,944 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:09:26,944 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:09:26,944 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:09:26,944 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:09:26,944 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:26,944 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:09:26,945 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:09:26,945 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncpy_malloc_true-termination.c.i_Iteration2_Lasso [2018-10-27 06:09:26,945 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:09:26,945 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:09:26,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:26,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:26,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:26,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:26,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:26,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:26,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:26,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:26,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:26,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:26,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:26,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:26,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:26,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:27,302 WARN L179 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 105 [2018-10-27 06:09:27,413 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2018-10-27 06:09:27,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:27,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:27,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:27,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:27,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:27,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:27,661 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2018-10-27 06:09:27,917 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2018-10-27 06:09:28,146 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:09:28,146 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:09:28,147 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-10-27 06:09:28,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:28,148 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:28,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:28,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:28,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:28,148 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:28,149 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:28,149 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:28,150 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-10-27 06:09:28,154 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:28,154 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:28,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:28,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:28,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:28,155 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:28,155 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:28,156 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:28,156 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-10-27 06:09:28,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:28,157 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:28,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:28,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:28,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:28,157 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:28,157 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:28,158 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:28,161 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-10-27 06:09:28,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:28,162 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:28,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:28,162 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:28,162 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:28,162 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:28,163 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:28,163 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:28,164 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-10-27 06:09:28,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:28,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:28,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:28,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:28,165 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:28,165 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:28,167 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:28,167 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-10-27 06:09:28,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:28,168 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:28,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:28,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:28,168 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:28,168 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:28,168 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:28,169 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:28,169 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-10-27 06:09:28,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:28,170 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:28,170 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:28,170 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:28,170 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:28,170 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:28,171 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:28,171 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:28,171 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-10-27 06:09:28,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:28,172 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:28,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:28,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:28,172 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:28,172 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:28,173 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:28,173 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:28,173 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-10-27 06:09:28,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:28,174 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:28,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:28,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:28,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:28,174 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:28,175 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:28,175 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:28,175 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-10-27 06:09:28,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:28,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:28,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:28,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:28,177 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:28,177 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:28,179 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:28,179 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:28,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:28,180 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:28,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:28,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:28,180 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:28,180 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:28,180 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:28,181 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:28,181 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-10-27 06:09:28,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:28,182 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:28,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:28,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:28,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:28,182 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:28,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:28,183 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:28,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:28,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:28,184 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:28,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:28,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:28,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:28,184 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:28,184 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:28,185 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:28,185 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-10-27 06:09:28,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:28,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:28,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:28,186 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:28,187 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:28,187 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:28,189 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:28,189 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:28,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:28,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:28,190 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:09:28,190 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:28,206 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-10-27 06:09:28,206 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-10-27 06:09:28,351 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:09:28,469 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-10-27 06:09:28,470 INFO L444 ModelExtractionUtils]: 119 out of 126 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-10-27 06:09:28,470 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:09:28,472 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2018-10-27 06:09:28,477 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:09:28,477 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncpy_~us~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc213.base)_2) = -1*ULTIMATE.start_cstrncpy_~us~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc213.base)_2 Supporting invariants [] [2018-10-27 06:09:28,919 INFO L297 tatePredicateManager]: 16 out of 17 supporting invariants were superfluous and have been removed [2018-10-27 06:09:28,950 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:09:29,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:29,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:29,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:29,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:29,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:29,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:29,693 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2018-10-27 06:09:29,693 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 5 Second operand 7 states. [2018-10-27 06:09:29,812 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 5. Second operand 7 states. Result 25 states and 29 transitions. Complement of second has 8 states. [2018-10-27 06:09:29,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:09:29,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:09:29,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2018-10-27 06:09:29,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 12 letters. Loop has 5 letters. [2018-10-27 06:09:29,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:29,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 17 letters. Loop has 5 letters. [2018-10-27 06:09:29,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:29,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 12 letters. Loop has 10 letters. [2018-10-27 06:09:29,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:29,815 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 29 transitions. [2018-10-27 06:09:29,816 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:09:29,816 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 0 states and 0 transitions. [2018-10-27 06:09:29,816 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-10-27 06:09:29,816 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-10-27 06:09:29,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-10-27 06:09:29,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:09:29,816 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:09:29,817 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:09:29,817 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:09:29,817 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:09:29,817 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:09:29,817 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:09:29,817 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-10-27 06:09:29,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:09:29 BoogieIcfgContainer [2018-10-27 06:09:29,826 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:09:29,827 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:09:29,827 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:09:29,827 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:09:29,827 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:09:21" (3/4) ... [2018-10-27 06:09:29,832 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-27 06:09:29,832 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:09:29,832 INFO L168 Benchmark]: Toolchain (without parser) took 9079.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 197.1 MB). Free memory was 955.4 MB in the beginning and 938.1 MB in the end (delta: 17.3 MB). Peak memory consumption was 214.4 MB. Max. memory is 11.5 GB. [2018-10-27 06:09:29,833 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:09:29,833 INFO L168 Benchmark]: CACSL2BoogieTranslator took 417.67 ms. Allocated memory is still 1.0 GB. Free memory was 955.4 MB in the beginning and 928.5 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-10-27 06:09:29,834 INFO L168 Benchmark]: Boogie Procedure Inliner took 111.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 928.5 MB in the beginning and 1.2 GB in the end (delta: -223.2 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. [2018-10-27 06:09:29,834 INFO L168 Benchmark]: Boogie Preprocessor took 29.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:09:29,835 INFO L168 Benchmark]: RCFGBuilder took 589.54 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: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2018-10-27 06:09:29,835 INFO L168 Benchmark]: BuchiAutomizer took 7917.95 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 44.6 MB). Free memory was 1.1 GB in the beginning and 938.1 MB in the end (delta: 190.2 MB). Peak memory consumption was 234.8 MB. Max. memory is 11.5 GB. [2018-10-27 06:09:29,836 INFO L168 Benchmark]: Witness Printer took 4.94 ms. Allocated memory is still 1.2 GB. Free memory is still 938.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:09:29,840 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 417.67 ms. Allocated memory is still 1.0 GB. Free memory was 955.4 MB in the beginning and 928.5 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 111.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 928.5 MB in the beginning and 1.2 GB in the end (delta: -223.2 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 589.54 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: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7917.95 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 44.6 MB). Free memory was 1.1 GB in the beginning and 938.1 MB in the end (delta: 190.2 MB). Peak memory consumption was 234.8 MB. Max. memory is 11.5 GB. * Witness Printer took 4.94 ms. Allocated memory is still 1.2 GB. Free memory is still 938.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #Ultimate.alloc_#res - 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 -1 * dst + unknown-#length-unknown[#Ultimate.alloc_#res] and consists of 6 locations. One deterministic module has affine ranking function -1 * us + unknown-#length-unknown[malloc(n * sizeof(char))] and consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.8s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 6.5s. Construction of modules took 0.1s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 19 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 34 SDtfs, 52 SDslu, 44 SDs, 0 SdLazy, 26 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital246 mio100 ax100 hnf99 lsp96 ukn104 mio100 lsp50 div100 bol100 ite100 ukn100 eq205 hnf88 smp100 dnf115 smp100 tf100 neg99 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 287ms VariablesStem: 24 VariablesLoop: 15 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...