./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-libowfat/strlcpy_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_4706c9f3-24d3-407a-893e-ffcfae3fdafd/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4706c9f3-24d3-407a-893e-ffcfae3fdafd/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4706c9f3-24d3-407a-893e-ffcfae3fdafd/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4706c9f3-24d3-407a-893e-ffcfae3fdafd/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-libowfat/strlcpy_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_4706c9f3-24d3-407a-893e-ffcfae3fdafd/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4706c9f3-24d3-407a-893e-ffcfae3fdafd/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 fd4754e908bed6ae29d10e34d903201d1cfa0296 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 08:42:49,063 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 08:42:49,065 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 08:42:49,073 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 08:42:49,073 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 08:42:49,074 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 08:42:49,075 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 08:42:49,076 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 08:42:49,077 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 08:42:49,077 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 08:42:49,078 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 08:42:49,078 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 08:42:49,079 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 08:42:49,079 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 08:42:49,080 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 08:42:49,080 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 08:42:49,081 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 08:42:49,082 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 08:42:49,083 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 08:42:49,084 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 08:42:49,085 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 08:42:49,086 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 08:42:49,087 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 08:42:49,087 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 08:42:49,087 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 08:42:49,088 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 08:42:49,088 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 08:42:49,089 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 08:42:49,089 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 08:42:49,090 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 08:42:49,090 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 08:42:49,091 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 08:42:49,091 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 08:42:49,091 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 08:42:49,092 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 08:42:49,092 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 08:42:49,092 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4706c9f3-24d3-407a-893e-ffcfae3fdafd/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 08:42:49,102 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 08:42:49,103 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 08:42:49,103 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 08:42:49,104 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 08:42:49,104 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 08:42:49,104 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 08:42:49,104 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 08:42:49,104 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 08:42:49,104 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 08:42:49,104 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 08:42:49,104 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 08:42:49,105 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 08:42:49,105 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 08:42:49,105 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 08:42:49,105 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 08:42:49,105 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 08:42:49,105 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 08:42:49,105 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 08:42:49,105 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 08:42:49,106 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 08:42:49,106 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 08:42:49,106 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 08:42:49,106 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 08:42:49,106 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 08:42:49,106 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 08:42:49,106 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 08:42:49,107 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 08:42:49,107 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 08:42:49,107 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_4706c9f3-24d3-407a-893e-ffcfae3fdafd/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 -> fd4754e908bed6ae29d10e34d903201d1cfa0296 [2018-11-10 08:42:49,129 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 08:42:49,137 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 08:42:49,140 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 08:42:49,141 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 08:42:49,141 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 08:42:49,142 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4706c9f3-24d3-407a-893e-ffcfae3fdafd/bin-2019/uautomizer/../../sv-benchmarks/c/termination-libowfat/strlcpy_true-termination.c.i [2018-11-10 08:42:49,184 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4706c9f3-24d3-407a-893e-ffcfae3fdafd/bin-2019/uautomizer/data/c4b10f02e/92c073ff2beb4c768adc35cfec5d2049/FLAG24cc836d0 [2018-11-10 08:42:49,518 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 08:42:49,519 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4706c9f3-24d3-407a-893e-ffcfae3fdafd/sv-benchmarks/c/termination-libowfat/strlcpy_true-termination.c.i [2018-11-10 08:42:49,529 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4706c9f3-24d3-407a-893e-ffcfae3fdafd/bin-2019/uautomizer/data/c4b10f02e/92c073ff2beb4c768adc35cfec5d2049/FLAG24cc836d0 [2018-11-10 08:42:49,538 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4706c9f3-24d3-407a-893e-ffcfae3fdafd/bin-2019/uautomizer/data/c4b10f02e/92c073ff2beb4c768adc35cfec5d2049 [2018-11-10 08:42:49,540 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 08:42:49,541 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 08:42:49,542 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 08:42:49,542 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 08:42:49,545 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 08:42:49,545 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:42:49" (1/1) ... [2018-11-10 08:42:49,547 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77e8b7f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:42:49, skipping insertion in model container [2018-11-10 08:42:49,547 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:42:49" (1/1) ... [2018-11-10 08:42:49,553 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 08:42:49,578 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 08:42:49,757 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 08:42:49,764 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 08:42:49,793 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 08:42:49,817 INFO L193 MainTranslator]: Completed translation [2018-11-10 08:42:49,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:42:49 WrapperNode [2018-11-10 08:42:49,817 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 08:42:49,817 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 08:42:49,818 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 08:42:49,818 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 08:42:49,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:42:49" (1/1) ... [2018-11-10 08:42:49,873 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:42:49" (1/1) ... [2018-11-10 08:42:49,889 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 08:42:49,890 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 08:42:49,890 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 08:42:49,890 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 08:42:49,895 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:42:49" (1/1) ... [2018-11-10 08:42:49,895 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:42:49" (1/1) ... [2018-11-10 08:42:49,897 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:42:49" (1/1) ... [2018-11-10 08:42:49,898 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:42:49" (1/1) ... [2018-11-10 08:42:49,901 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:42:49" (1/1) ... [2018-11-10 08:42:49,903 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:42:49" (1/1) ... [2018-11-10 08:42:49,904 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:42:49" (1/1) ... [2018-11-10 08:42:49,905 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 08:42:49,906 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 08:42:49,906 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 08:42:49,906 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 08:42:49,906 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:42:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4706c9f3-24d3-407a-893e-ffcfae3fdafd/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:42:49,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 08:42:49,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 08:42:49,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 08:42:49,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 08:42:50,118 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 08:42:50,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 08:42:50 BoogieIcfgContainer [2018-11-10 08:42:50,118 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 08:42:50,119 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 08:42:50,119 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 08:42:50,121 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 08:42:50,122 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 08:42:50,122 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 08:42:49" (1/3) ... [2018-11-10 08:42:50,123 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2928fa6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 08:42:50, skipping insertion in model container [2018-11-10 08:42:50,123 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 08:42:50,123 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:42:49" (2/3) ... [2018-11-10 08:42:50,123 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2928fa6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 08:42:50, skipping insertion in model container [2018-11-10 08:42:50,123 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 08:42:50,124 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 08:42:50" (3/3) ... [2018-11-10 08:42:50,125 INFO L375 chiAutomizerObserver]: Analyzing ICFG strlcpy_true-termination.c.i [2018-11-10 08:42:50,160 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 08:42:50,161 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 08:42:50,161 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 08:42:50,161 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 08:42:50,161 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 08:42:50,161 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 08:42:50,161 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 08:42:50,161 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 08:42:50,161 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 08:42:50,170 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2018-11-10 08:42:50,184 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-10 08:42:50,185 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:42:50,185 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:42:50,189 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:42:50,189 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 08:42:50,189 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 08:42:50,189 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2018-11-10 08:42:50,191 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-10 08:42:50,191 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:42:50,191 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:42:50,192 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:42:50,192 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 08:42:50,199 INFO L793 eck$LassoCheckResult]: Stem: 27#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet10, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet10;havoc main_#t~nondet10; 13#L530true assume !(main_~in_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~in_len~0;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~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~in~0.base, main_~in~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset; 9#L532true SUMMARY for call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1) * 1, 1); srcloc: L532 12#L532-1true main_~out_len~0 := main_#t~nondet12;havoc main_#t~nondet12; 22#L534true assume !(main_~out_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~out_len~0;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~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~out~0.base, main_~out~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;assume { :begin_inline_strlcpy } true;strlcpy_#in~dst.base, strlcpy_#in~dst.offset, strlcpy_#in~src.base, strlcpy_#in~src.offset, strlcpy_#in~siz := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset, main_~out_len~0;havoc strlcpy_#res;havoc strlcpy_#t~pre2, strlcpy_#t~short3, strlcpy_#t~post5.base, strlcpy_#t~post5.offset, strlcpy_#t~post6.base, strlcpy_#t~post6.offset, strlcpy_#t~mem7, strlcpy_#t~pre4, strlcpy_#t~post8.base, strlcpy_#t~post8.offset, strlcpy_#t~mem9, strlcpy_~dst.base, strlcpy_~dst.offset, strlcpy_~src.base, strlcpy_~src.offset, strlcpy_~siz, strlcpy_~d~0.base, strlcpy_~d~0.offset, strlcpy_~s~0.base, strlcpy_~s~0.offset, strlcpy_~n~0;strlcpy_~dst.base, strlcpy_~dst.offset := strlcpy_#in~dst.base, strlcpy_#in~dst.offset;strlcpy_~src.base, strlcpy_~src.offset := strlcpy_#in~src.base, strlcpy_#in~src.offset;strlcpy_~siz := strlcpy_#in~siz;strlcpy_~d~0.base, strlcpy_~d~0.offset := strlcpy_~dst.base, strlcpy_~dst.offset;strlcpy_~s~0.base, strlcpy_~s~0.offset := strlcpy_~src.base, strlcpy_~src.offset;strlcpy_~n~0 := strlcpy_~siz;strlcpy_#t~short3 := strlcpy_~n~0 % 4294967296 != 0; 20#L514true assume !strlcpy_#t~short3; 24#L514-2true assume strlcpy_#t~short3;havoc strlcpy_#t~short3;havoc strlcpy_#t~pre2; 7#L515-4true [2018-11-10 08:42:50,199 INFO L795 eck$LassoCheckResult]: Loop: 7#L515-4true assume true;strlcpy_#t~post5.base, strlcpy_#t~post5.offset := strlcpy_~d~0.base, strlcpy_~d~0.offset;strlcpy_~d~0.base, strlcpy_~d~0.offset := strlcpy_#t~post5.base, strlcpy_#t~post5.offset + 1;strlcpy_#t~post6.base, strlcpy_#t~post6.offset := strlcpy_~s~0.base, strlcpy_~s~0.offset;strlcpy_~s~0.base, strlcpy_~s~0.offset := strlcpy_#t~post6.base, strlcpy_#t~post6.offset + 1; 17#L516true SUMMARY for call strlcpy_#t~mem7 := read~int(strlcpy_#t~post6.base, strlcpy_#t~post6.offset, 1); srcloc: L516 18#L516-1true SUMMARY for call write~int(strlcpy_#t~mem7, strlcpy_#t~post5.base, strlcpy_#t~post5.offset, 1); srcloc: L516-1 21#L516-2true assume !(strlcpy_#t~mem7 == 0);havoc strlcpy_#t~post5.base, strlcpy_#t~post5.offset;havoc strlcpy_#t~post6.base, strlcpy_#t~post6.offset;havoc strlcpy_#t~mem7; 4#L515-1true strlcpy_#t~pre4 := strlcpy_~n~0 - 1;strlcpy_~n~0 := strlcpy_~n~0 - 1; 5#L515-2true assume !!(strlcpy_#t~pre4 % 4294967296 != 0);havoc strlcpy_#t~pre4; 7#L515-4true [2018-11-10 08:42:50,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:42:50,204 INFO L82 PathProgramCache]: Analyzing trace with hash 175627309, now seen corresponding path program 1 times [2018-11-10 08:42:50,205 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:42:50,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:42:50,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:42:50,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:42:50,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:42:50,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:42:50,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:42:50,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:42:50,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 08:42:50,307 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 08:42:50,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:42:50,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1687247116, now seen corresponding path program 1 times [2018-11-10 08:42:50,308 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:42:50,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:42:50,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:42:50,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:42:50,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:42:50,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:42:50,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:42:50,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:42:50,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:42:50,471 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 3 states. [2018-11-10 08:42:50,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:42:50,485 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2018-11-10 08:42:50,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:42:50,487 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 35 transitions. [2018-11-10 08:42:50,488 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-10 08:42:50,492 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 22 states and 27 transitions. [2018-11-10 08:42:50,493 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-10 08:42:50,494 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-10 08:42:50,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 27 transitions. [2018-11-10 08:42:50,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 08:42:50,494 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-11-10 08:42:50,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 27 transitions. [2018-11-10 08:42:50,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-10 08:42:50,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-10 08:42:50,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2018-11-10 08:42:50,513 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-11-10 08:42:50,513 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-11-10 08:42:50,513 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 08:42:50,513 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2018-11-10 08:42:50,514 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-10 08:42:50,514 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:42:50,514 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:42:50,514 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:42:50,514 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 08:42:50,515 INFO L793 eck$LassoCheckResult]: Stem: 83#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 79#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet10, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet10;havoc main_#t~nondet10; 80#L530 assume !(main_~in_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~in_len~0;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~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~in~0.base, main_~in~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset; 81#L532 SUMMARY for call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1) * 1, 1); srcloc: L532 82#L532-1 main_~out_len~0 := main_#t~nondet12;havoc main_#t~nondet12; 72#L534 assume !(main_~out_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~out_len~0;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~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~out~0.base, main_~out~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;assume { :begin_inline_strlcpy } true;strlcpy_#in~dst.base, strlcpy_#in~dst.offset, strlcpy_#in~src.base, strlcpy_#in~src.offset, strlcpy_#in~siz := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset, main_~out_len~0;havoc strlcpy_#res;havoc strlcpy_#t~pre2, strlcpy_#t~short3, strlcpy_#t~post5.base, strlcpy_#t~post5.offset, strlcpy_#t~post6.base, strlcpy_#t~post6.offset, strlcpy_#t~mem7, strlcpy_#t~pre4, strlcpy_#t~post8.base, strlcpy_#t~post8.offset, strlcpy_#t~mem9, strlcpy_~dst.base, strlcpy_~dst.offset, strlcpy_~src.base, strlcpy_~src.offset, strlcpy_~siz, strlcpy_~d~0.base, strlcpy_~d~0.offset, strlcpy_~s~0.base, strlcpy_~s~0.offset, strlcpy_~n~0;strlcpy_~dst.base, strlcpy_~dst.offset := strlcpy_#in~dst.base, strlcpy_#in~dst.offset;strlcpy_~src.base, strlcpy_~src.offset := strlcpy_#in~src.base, strlcpy_#in~src.offset;strlcpy_~siz := strlcpy_#in~siz;strlcpy_~d~0.base, strlcpy_~d~0.offset := strlcpy_~dst.base, strlcpy_~dst.offset;strlcpy_~s~0.base, strlcpy_~s~0.offset := strlcpy_~src.base, strlcpy_~src.offset;strlcpy_~n~0 := strlcpy_~siz;strlcpy_#t~short3 := strlcpy_~n~0 % 4294967296 != 0; 65#L514 assume strlcpy_#t~short3;strlcpy_#t~pre2 := strlcpy_~n~0 - 1;strlcpy_~n~0 := strlcpy_~n~0 - 1;strlcpy_#t~short3 := strlcpy_#t~pre2 % 4294967296 != 0; 66#L514-2 assume strlcpy_#t~short3;havoc strlcpy_#t~short3;havoc strlcpy_#t~pre2; 71#L515-4 [2018-11-10 08:42:50,515 INFO L795 eck$LassoCheckResult]: Loop: 71#L515-4 assume true;strlcpy_#t~post5.base, strlcpy_#t~post5.offset := strlcpy_~d~0.base, strlcpy_~d~0.offset;strlcpy_~d~0.base, strlcpy_~d~0.offset := strlcpy_#t~post5.base, strlcpy_#t~post5.offset + 1;strlcpy_#t~post6.base, strlcpy_#t~post6.offset := strlcpy_~s~0.base, strlcpy_~s~0.offset;strlcpy_~s~0.base, strlcpy_~s~0.offset := strlcpy_#t~post6.base, strlcpy_#t~post6.offset + 1; 62#L516 SUMMARY for call strlcpy_#t~mem7 := read~int(strlcpy_#t~post6.base, strlcpy_#t~post6.offset, 1); srcloc: L516 63#L516-1 SUMMARY for call write~int(strlcpy_#t~mem7, strlcpy_#t~post5.base, strlcpy_#t~post5.offset, 1); srcloc: L516-1 64#L516-2 assume !(strlcpy_#t~mem7 == 0);havoc strlcpy_#t~post5.base, strlcpy_#t~post5.offset;havoc strlcpy_#t~post6.base, strlcpy_#t~post6.offset;havoc strlcpy_#t~mem7; 69#L515-1 strlcpy_#t~pre4 := strlcpy_~n~0 - 1;strlcpy_~n~0 := strlcpy_~n~0 - 1; 70#L515-2 assume !!(strlcpy_#t~pre4 % 4294967296 != 0);havoc strlcpy_#t~pre4; 71#L515-4 [2018-11-10 08:42:50,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:42:50,515 INFO L82 PathProgramCache]: Analyzing trace with hash 175627247, now seen corresponding path program 1 times [2018-11-10 08:42:50,515 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:42:50,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:42:50,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:42:50,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:42:50,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:42:50,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:42:50,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:42:50,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:42:50,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1687247116, now seen corresponding path program 2 times [2018-11-10 08:42:50,553 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:42:50,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:42:50,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:42:50,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:42:50,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:42:50,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:42:50,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:42:50,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:42:50,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1669068166, now seen corresponding path program 1 times [2018-11-10 08:42:50,570 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:42:50,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:42:50,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:42:50,571 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:42:50,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:42:50,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:42:50,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:42:51,073 WARN L179 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 126 [2018-11-10 08:42:51,182 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 08:42:51,182 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 08:42:51,183 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 08:42:51,183 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 08:42:51,183 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 08:42:51,183 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:42:51,183 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 08:42:51,183 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 08:42:51,183 INFO L131 ssoRankerPreferences]: Filename of dumped script: strlcpy_true-termination.c.i_Iteration2_Lasso [2018-11-10 08:42:51,183 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 08:42:51,184 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 08:42:51,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:42:51,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:42:51,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:42:51,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:42:51,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:42:51,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:42:51,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:42:51,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:42:51,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:42:51,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:42:51,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:42:51,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:42:51,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:42:51,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:42:51,522 WARN L179 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 108 [2018-11-10 08:42:51,655 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 82 [2018-11-10 08:42:51,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:42:51,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:42:51,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:42:51,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:42:51,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:42:52,081 WARN L179 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 92 [2018-11-10 08:42:52,195 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2018-11-10 08:42:52,401 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2018-11-10 08:42:52,489 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 08:42:52,493 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 08:42:52,494 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:42:52,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:42:52,495 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:42:52,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:42:52,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:42:52,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:42:52,497 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:42:52,497 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:42:52,499 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:42:52,499 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:42:52,499 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:42:52,500 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:42:52,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:42:52,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:42:52,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:42:52,501 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:42:52,501 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:42:52,502 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:42:52,502 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:42:52,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:42:52,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:42:52,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:42:52,503 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:42:52,505 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:42:52,505 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:42:52,508 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:42:52,509 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:42:52,509 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:42:52,510 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:42:52,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:42:52,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:42:52,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:42:52,510 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:42:52,511 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:42:52,511 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:42:52,515 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:42:52,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:42:52,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:42:52,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:42:52,516 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:42:52,517 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:42:52,517 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:42:52,520 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:42:52,520 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:42:52,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:42:52,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:42:52,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:42:52,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:42:52,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:42:52,522 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:42:52,522 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:42:52,523 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:42:52,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:42:52,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:42:52,524 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:42:52,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:42:52,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:42:52,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:42:52,524 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:42:52,525 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:42:52,525 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:42:52,526 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:42:52,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:42:52,526 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:42:52,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:42:52,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:42:52,527 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:42:52,527 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:42:52,527 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:42:52,528 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:42:52,528 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:42:52,529 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:42:52,529 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:42:52,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:42:52,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:42:52,529 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:42:52,530 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:42:52,530 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:42:52,530 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:42:52,531 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:42:52,531 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:42:52,531 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:42:52,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:42:52,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:42:52,532 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:42:52,532 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:42:52,532 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:42:52,533 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:42:52,533 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:42:52,534 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:42:52,534 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:42:52,534 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:42:52,534 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:42:52,534 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:42:52,535 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:42:52,535 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:42:52,535 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:42:52,536 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:42:52,536 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:42:52,536 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:42:52,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:42:52,537 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:42:52,537 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:42:52,537 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:42:52,537 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:42:52,538 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:42:52,538 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:42:52,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:42:52,539 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:42:52,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:42:52,539 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:42:52,539 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:42:52,539 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:42:52,540 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:42:52,540 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:42:52,540 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:42:52,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:42:52,541 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:42:52,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:42:52,541 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 08:42:52,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:42:52,542 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 08:42:52,542 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:42:52,545 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:42:52,545 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:42:52,546 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:42:52,546 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:42:52,546 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:42:52,546 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:42:52,548 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:42:52,548 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:42:52,551 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:42:52,552 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:42:52,552 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:42:52,552 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 08:42:52,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:42:52,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:42:52,556 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 08:42:52,556 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:42:52,570 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:42:52,570 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:42:52,571 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:42:52,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:42:52,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:42:52,571 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:42:52,573 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:42:52,574 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:42:52,585 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:42:52,586 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:42:52,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:42:52,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:42:52,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:42:52,587 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:42:52,588 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:42:52,588 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:42:52,592 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:42:52,593 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:42:52,593 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:42:52,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:42:52,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:42:52,594 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:42:52,602 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:42:52,602 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:42:52,673 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 08:42:52,703 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 08:42:52,703 INFO L444 ModelExtractionUtils]: 69 out of 73 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 08:42:52,705 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 08:42:52,707 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 08:42:52,708 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 08:42:52,708 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_strlcpy_~d~0.base)_1, ULTIMATE.start_strlcpy_~d~0.offset) = 1*v_rep(select #length ULTIMATE.start_strlcpy_~d~0.base)_1 - 1*ULTIMATE.start_strlcpy_~d~0.offset Supporting invariants [] [2018-11-10 08:42:52,753 INFO L297 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2018-11-10 08:42:52,760 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 08:42:52,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:42:52,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:42:52,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:42:52,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:42:52,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:42:52,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:42:52,871 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 08:42:52,872 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-11-10 08:42:52,939 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 7. Second operand 4 states. Result 44 states and 54 transitions. Complement of second has 6 states. [2018-11-10 08:42:52,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 08:42:52,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 08:42:52,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2018-11-10 08:42:52,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 8 letters. Loop has 6 letters. [2018-11-10 08:42:52,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:42:52,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 14 letters. Loop has 6 letters. [2018-11-10 08:42:52,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:42:52,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 8 letters. Loop has 12 letters. [2018-11-10 08:42:52,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:42:52,945 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 54 transitions. [2018-11-10 08:42:52,947 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-10 08:42:52,947 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 33 states and 39 transitions. [2018-11-10 08:42:52,947 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-11-10 08:42:52,948 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-11-10 08:42:52,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 39 transitions. [2018-11-10 08:42:52,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:42:52,948 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-11-10 08:42:52,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 39 transitions. [2018-11-10 08:42:52,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2018-11-10 08:42:52,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-10 08:42:52,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2018-11-10 08:42:52,950 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2018-11-10 08:42:52,950 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2018-11-10 08:42:52,950 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 08:42:52,950 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 30 transitions. [2018-11-10 08:42:52,951 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-10 08:42:52,951 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:42:52,951 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:42:52,951 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:42:52,951 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 08:42:52,952 INFO L793 eck$LassoCheckResult]: Stem: 270#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 266#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet10, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet10;havoc main_#t~nondet10; 267#L530 assume !(main_~in_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~in_len~0;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~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~in~0.base, main_~in~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset; 268#L532 SUMMARY for call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1) * 1, 1); srcloc: L532 269#L532-1 main_~out_len~0 := main_#t~nondet12;havoc main_#t~nondet12; 258#L534 assume !(main_~out_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~out_len~0;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~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~out~0.base, main_~out~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;assume { :begin_inline_strlcpy } true;strlcpy_#in~dst.base, strlcpy_#in~dst.offset, strlcpy_#in~src.base, strlcpy_#in~src.offset, strlcpy_#in~siz := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset, main_~out_len~0;havoc strlcpy_#res;havoc strlcpy_#t~pre2, strlcpy_#t~short3, strlcpy_#t~post5.base, strlcpy_#t~post5.offset, strlcpy_#t~post6.base, strlcpy_#t~post6.offset, strlcpy_#t~mem7, strlcpy_#t~pre4, strlcpy_#t~post8.base, strlcpy_#t~post8.offset, strlcpy_#t~mem9, strlcpy_~dst.base, strlcpy_~dst.offset, strlcpy_~src.base, strlcpy_~src.offset, strlcpy_~siz, strlcpy_~d~0.base, strlcpy_~d~0.offset, strlcpy_~s~0.base, strlcpy_~s~0.offset, strlcpy_~n~0;strlcpy_~dst.base, strlcpy_~dst.offset := strlcpy_#in~dst.base, strlcpy_#in~dst.offset;strlcpy_~src.base, strlcpy_~src.offset := strlcpy_#in~src.base, strlcpy_#in~src.offset;strlcpy_~siz := strlcpy_#in~siz;strlcpy_~d~0.base, strlcpy_~d~0.offset := strlcpy_~dst.base, strlcpy_~dst.offset;strlcpy_~s~0.base, strlcpy_~s~0.offset := strlcpy_~src.base, strlcpy_~src.offset;strlcpy_~n~0 := strlcpy_~siz;strlcpy_#t~short3 := strlcpy_~n~0 % 4294967296 != 0; 249#L514 assume strlcpy_#t~short3;strlcpy_#t~pre2 := strlcpy_~n~0 - 1;strlcpy_~n~0 := strlcpy_~n~0 - 1;strlcpy_#t~short3 := strlcpy_#t~pre2 % 4294967296 != 0; 250#L514-2 assume !strlcpy_#t~short3;havoc strlcpy_#t~short3;havoc strlcpy_#t~pre2; 252#L514-3 assume strlcpy_~n~0 % 4294967296 == 0; 265#L521 assume !(strlcpy_~siz % 4294967296 != 0); 262#L523-4 [2018-11-10 08:42:52,952 INFO L795 eck$LassoCheckResult]: Loop: 262#L523-4 assume true; 259#L523 strlcpy_#t~post8.base, strlcpy_#t~post8.offset := strlcpy_~s~0.base, strlcpy_~s~0.offset;strlcpy_~s~0.base, strlcpy_~s~0.offset := strlcpy_#t~post8.base, strlcpy_#t~post8.offset + 1; 260#L523-1 SUMMARY for call strlcpy_#t~mem9 := read~int(strlcpy_#t~post8.base, strlcpy_#t~post8.offset, 1); srcloc: L523-1 263#L523-2 assume !!(strlcpy_#t~mem9 != 0);havoc strlcpy_#t~mem9;havoc strlcpy_#t~post8.base, strlcpy_#t~post8.offset; 262#L523-4 [2018-11-10 08:42:52,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:42:52,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1274083532, now seen corresponding path program 1 times [2018-11-10 08:42:52,952 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:42:52,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:42:52,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:42:52,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:42:52,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:42:52,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:42:53,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:42:53,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:42:53,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:42:53,028 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 08:42:53,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:42:53,029 INFO L82 PathProgramCache]: Analyzing trace with hash 2772584, now seen corresponding path program 1 times [2018-11-10 08:42:53,029 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:42:53,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:42:53,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:42:53,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:42:53,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:42:53,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:42:53,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:42:53,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 08:42:53,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 08:42:53,054 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-11-10 08:42:53,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:42:53,101 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2018-11-10 08:42:53,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 08:42:53,101 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 50 transitions. [2018-11-10 08:42:53,102 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2018-11-10 08:42:53,103 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 43 states and 50 transitions. [2018-11-10 08:42:53,103 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2018-11-10 08:42:53,103 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2018-11-10 08:42:53,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 50 transitions. [2018-11-10 08:42:53,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:42:53,103 INFO L705 BuchiCegarLoop]: Abstraction has 43 states and 50 transitions. [2018-11-10 08:42:53,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 50 transitions. [2018-11-10 08:42:53,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 27. [2018-11-10 08:42:53,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-10 08:42:53,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2018-11-10 08:42:53,105 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-11-10 08:42:53,106 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-11-10 08:42:53,106 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 08:42:53,106 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 32 transitions. [2018-11-10 08:42:53,106 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-10 08:42:53,106 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:42:53,106 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:42:53,107 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:42:53,107 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 08:42:53,107 INFO L793 eck$LassoCheckResult]: Stem: 348#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 344#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet10, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet10;havoc main_#t~nondet10; 345#L530 assume !(main_~in_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~in_len~0;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~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~in~0.base, main_~in~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset; 346#L532 SUMMARY for call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1) * 1, 1); srcloc: L532 347#L532-1 main_~out_len~0 := main_#t~nondet12;havoc main_#t~nondet12; 335#L534 assume !(main_~out_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~out_len~0;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~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~out~0.base, main_~out~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;assume { :begin_inline_strlcpy } true;strlcpy_#in~dst.base, strlcpy_#in~dst.offset, strlcpy_#in~src.base, strlcpy_#in~src.offset, strlcpy_#in~siz := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset, main_~out_len~0;havoc strlcpy_#res;havoc strlcpy_#t~pre2, strlcpy_#t~short3, strlcpy_#t~post5.base, strlcpy_#t~post5.offset, strlcpy_#t~post6.base, strlcpy_#t~post6.offset, strlcpy_#t~mem7, strlcpy_#t~pre4, strlcpy_#t~post8.base, strlcpy_#t~post8.offset, strlcpy_#t~mem9, strlcpy_~dst.base, strlcpy_~dst.offset, strlcpy_~src.base, strlcpy_~src.offset, strlcpy_~siz, strlcpy_~d~0.base, strlcpy_~d~0.offset, strlcpy_~s~0.base, strlcpy_~s~0.offset, strlcpy_~n~0;strlcpy_~dst.base, strlcpy_~dst.offset := strlcpy_#in~dst.base, strlcpy_#in~dst.offset;strlcpy_~src.base, strlcpy_~src.offset := strlcpy_#in~src.base, strlcpy_#in~src.offset;strlcpy_~siz := strlcpy_#in~siz;strlcpy_~d~0.base, strlcpy_~d~0.offset := strlcpy_~dst.base, strlcpy_~dst.offset;strlcpy_~s~0.base, strlcpy_~s~0.offset := strlcpy_~src.base, strlcpy_~src.offset;strlcpy_~n~0 := strlcpy_~siz;strlcpy_#t~short3 := strlcpy_~n~0 % 4294967296 != 0; 330#L514 assume !strlcpy_#t~short3; 332#L514-2 assume !strlcpy_#t~short3;havoc strlcpy_#t~short3;havoc strlcpy_#t~pre2; 338#L514-3 assume strlcpy_~n~0 % 4294967296 == 0; 349#L521 assume !(strlcpy_~siz % 4294967296 != 0); 340#L523-4 [2018-11-10 08:42:53,107 INFO L795 eck$LassoCheckResult]: Loop: 340#L523-4 assume true; 336#L523 strlcpy_#t~post8.base, strlcpy_#t~post8.offset := strlcpy_~s~0.base, strlcpy_~s~0.offset;strlcpy_~s~0.base, strlcpy_~s~0.offset := strlcpy_#t~post8.base, strlcpy_#t~post8.offset + 1; 337#L523-1 SUMMARY for call strlcpy_#t~mem9 := read~int(strlcpy_#t~post8.base, strlcpy_#t~post8.offset, 1); srcloc: L523-1 341#L523-2 assume !!(strlcpy_#t~mem9 != 0);havoc strlcpy_#t~mem9;havoc strlcpy_#t~post8.base, strlcpy_#t~post8.offset; 340#L523-4 [2018-11-10 08:42:53,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:42:53,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1274143114, now seen corresponding path program 1 times [2018-11-10 08:42:53,107 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:42:53,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:42:53,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:42:53,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:42:53,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:42:53,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:42:53,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:42:53,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:42:53,120 INFO L82 PathProgramCache]: Analyzing trace with hash 2772584, now seen corresponding path program 2 times [2018-11-10 08:42:53,120 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:42:53,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:42:53,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:42:53,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:42:53,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:42:53,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:42:53,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:42:53,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:42:53,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1439581041, now seen corresponding path program 1 times [2018-11-10 08:42:53,125 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:42:53,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:42:53,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:42:53,126 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:42:53,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:42:53,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:42:53,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:42:53,381 WARN L179 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 117 [2018-11-10 08:42:53,463 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 08:42:53,464 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 08:42:53,464 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 08:42:53,464 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 08:42:53,464 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 08:42:53,464 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:42:53,464 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 08:42:53,464 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 08:42:53,464 INFO L131 ssoRankerPreferences]: Filename of dumped script: strlcpy_true-termination.c.i_Iteration4_Lasso [2018-11-10 08:42:53,464 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 08:42:53,464 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 08:42:53,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:42:53,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:42:53,639 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 93 [2018-11-10 08:42:53,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:42:53,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:42:53,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:42:53,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:42:53,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:42:53,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:42:53,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:42:53,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:42:53,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:42:53,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:42:53,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:42:53,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:42:53,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:42:53,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:42:53,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:42:53,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:42:53,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:42:54,015 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 08:42:54,015 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 08:42:54,015 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:42:54,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:42:54,016 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:42:54,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:42:54,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:42:54,016 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:42:54,017 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:42:54,017 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:42:54,017 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:42:54,018 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:42:54,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:42:54,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:42:54,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:42:54,018 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:42:54,019 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:42:54,019 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:42:54,020 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:42:54,021 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:42:54,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:42:54,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:42:54,021 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:42:54,021 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:42:54,022 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:42:54,022 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:42:54,023 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:42:54,024 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:42:54,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:42:54,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:42:54,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:42:54,024 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:42:54,025 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:42:54,025 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:42:54,031 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:42:54,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-11-10 08:42:54,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:42:54,032 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 08:42:54,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:42:54,033 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:42:54,034 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 08:42:54,034 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:42:54,040 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:42:54,040 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:42:54,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:42:54,041 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:42:54,041 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:42:54,041 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 08:42:54,041 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:42:54,041 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 08:42:54,041 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:42:54,045 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:42:54,046 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:42:54,046 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:42:54,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:42:54,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:42:54,046 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:42:54,047 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:42:54,047 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:42:54,049 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:42:54,049 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:42:54,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:42:54,050 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 08:42:54,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:42:54,050 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:42:54,053 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 08:42:54,053 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:42:54,057 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:42:54,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-11-10 08:42:54,057 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:42:54,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:42:54,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:42:54,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:42:54,058 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:42:54,058 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:42:54,060 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:42:54,060 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:42:54,060 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:42:54,061 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:42:54,061 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:42:54,061 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:42:54,062 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:42:54,062 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:42:54,063 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:42:54,064 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:42:54,064 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:42:54,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:42:54,064 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:42:54,064 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:42:54,065 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:42:54,065 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:42:54,066 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:42:54,071 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:42:54,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:42:54,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:42:54,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:42:54,071 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:42:54,072 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:42:54,072 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:42:54,074 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:42:54,076 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:42:54,076 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:42:54,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:42:54,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:42:54,076 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:42:54,078 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:42:54,078 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:42:54,088 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 08:42:54,100 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 08:42:54,100 INFO L444 ModelExtractionUtils]: 36 out of 43 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-10 08:42:54,100 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 08:42:54,101 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 08:42:54,101 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 08:42:54,101 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strlcpy_~s~0.offset, v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_2) = -1*ULTIMATE.start_strlcpy_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_2 Supporting invariants [] [2018-11-10 08:42:54,150 INFO L297 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2018-11-10 08:42:54,152 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:42:54,153 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 08:42:54,153 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-11-10 08:42:54,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:42:54,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:42:54,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:42:54,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:42:54,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:42:54,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:42:54,249 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-11-10 08:42:54,249 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 32 transitions. cyclomatic complexity: 7 Second operand 6 states. [2018-11-10 08:42:54,289 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 32 transitions. cyclomatic complexity: 7. Second operand 6 states. Result 36 states and 42 transitions. Complement of second has 7 states. [2018-11-10 08:42:54,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 08:42:54,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 08:42:54,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2018-11-10 08:42:54,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-10 08:42:54,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:42:54,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 14 letters. Loop has 4 letters. [2018-11-10 08:42:54,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:42:54,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 10 letters. Loop has 8 letters. [2018-11-10 08:42:54,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:42:54,291 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 42 transitions. [2018-11-10 08:42:54,292 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-10 08:42:54,293 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 27 states and 31 transitions. [2018-11-10 08:42:54,293 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-10 08:42:54,293 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-10 08:42:54,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 31 transitions. [2018-11-10 08:42:54,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:42:54,293 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-10 08:42:54,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 31 transitions. [2018-11-10 08:42:54,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-11-10 08:42:54,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-10 08:42:54,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2018-11-10 08:42:54,295 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2018-11-10 08:42:54,295 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2018-11-10 08:42:54,295 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 08:42:54,296 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 29 transitions. [2018-11-10 08:42:54,296 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-10 08:42:54,296 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:42:54,296 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:42:54,297 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:42:54,297 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 08:42:54,297 INFO L793 eck$LassoCheckResult]: Stem: 511#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 507#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet10, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet10;havoc main_#t~nondet10; 508#L530 assume !(main_~in_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~in_len~0;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~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~in~0.base, main_~in~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset; 509#L532 SUMMARY for call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1) * 1, 1); srcloc: L532 510#L532-1 main_~out_len~0 := main_#t~nondet12;havoc main_#t~nondet12; 499#L534 assume !(main_~out_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~out_len~0;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~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~out~0.base, main_~out~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;assume { :begin_inline_strlcpy } true;strlcpy_#in~dst.base, strlcpy_#in~dst.offset, strlcpy_#in~src.base, strlcpy_#in~src.offset, strlcpy_#in~siz := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset, main_~out_len~0;havoc strlcpy_#res;havoc strlcpy_#t~pre2, strlcpy_#t~short3, strlcpy_#t~post5.base, strlcpy_#t~post5.offset, strlcpy_#t~post6.base, strlcpy_#t~post6.offset, strlcpy_#t~mem7, strlcpy_#t~pre4, strlcpy_#t~post8.base, strlcpy_#t~post8.offset, strlcpy_#t~mem9, strlcpy_~dst.base, strlcpy_~dst.offset, strlcpy_~src.base, strlcpy_~src.offset, strlcpy_~siz, strlcpy_~d~0.base, strlcpy_~d~0.offset, strlcpy_~s~0.base, strlcpy_~s~0.offset, strlcpy_~n~0;strlcpy_~dst.base, strlcpy_~dst.offset := strlcpy_#in~dst.base, strlcpy_#in~dst.offset;strlcpy_~src.base, strlcpy_~src.offset := strlcpy_#in~src.base, strlcpy_#in~src.offset;strlcpy_~siz := strlcpy_#in~siz;strlcpy_~d~0.base, strlcpy_~d~0.offset := strlcpy_~dst.base, strlcpy_~dst.offset;strlcpy_~s~0.base, strlcpy_~s~0.offset := strlcpy_~src.base, strlcpy_~src.offset;strlcpy_~n~0 := strlcpy_~siz;strlcpy_#t~short3 := strlcpy_~n~0 % 4294967296 != 0; 495#L514 assume strlcpy_#t~short3;strlcpy_#t~pre2 := strlcpy_~n~0 - 1;strlcpy_~n~0 := strlcpy_~n~0 - 1;strlcpy_#t~short3 := strlcpy_#t~pre2 % 4294967296 != 0; 496#L514-2 assume !strlcpy_#t~short3;havoc strlcpy_#t~short3;havoc strlcpy_#t~pre2; 490#L514-3 assume strlcpy_~n~0 % 4294967296 == 0; 506#L521 assume strlcpy_~siz % 4294967296 != 0; 502#L522 SUMMARY for call write~int(0, strlcpy_~d~0.base, strlcpy_~d~0.offset, 1); srcloc: L522 503#L523-4 [2018-11-10 08:42:54,297 INFO L795 eck$LassoCheckResult]: Loop: 503#L523-4 assume true; 500#L523 strlcpy_#t~post8.base, strlcpy_#t~post8.offset := strlcpy_~s~0.base, strlcpy_~s~0.offset;strlcpy_~s~0.base, strlcpy_~s~0.offset := strlcpy_#t~post8.base, strlcpy_#t~post8.offset + 1; 501#L523-1 SUMMARY for call strlcpy_#t~mem9 := read~int(strlcpy_#t~post8.base, strlcpy_#t~post8.offset, 1); srcloc: L523-1 504#L523-2 assume !!(strlcpy_#t~mem9 != 0);havoc strlcpy_#t~mem9;havoc strlcpy_#t~post8.base, strlcpy_#t~post8.offset; 503#L523-4 [2018-11-10 08:42:54,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:42:54,297 INFO L82 PathProgramCache]: Analyzing trace with hash 841883789, now seen corresponding path program 1 times [2018-11-10 08:42:54,298 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:42:54,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:42:54,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:42:54,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:42:54,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:42:54,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:42:54,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:42:54,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:42:54,316 INFO L82 PathProgramCache]: Analyzing trace with hash 2772584, now seen corresponding path program 3 times [2018-11-10 08:42:54,316 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:42:54,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:42:54,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:42:54,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:42:54,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:42:54,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:42:54,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:42:54,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:42:54,324 INFO L82 PathProgramCache]: Analyzing trace with hash 905791732, now seen corresponding path program 1 times [2018-11-10 08:42:54,324 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:42:54,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:42:54,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:42:54,325 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:42:54,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:42:54,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:42:54,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:42:54,723 WARN L179 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 131 [2018-11-10 08:42:54,824 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 08:42:54,824 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 08:42:54,824 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 08:42:54,824 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 08:42:54,824 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 08:42:54,824 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:42:54,824 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 08:42:54,824 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 08:42:54,824 INFO L131 ssoRankerPreferences]: Filename of dumped script: strlcpy_true-termination.c.i_Iteration5_Lasso [2018-11-10 08:42:54,824 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 08:42:54,825 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 08:42:54,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:42:54,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:42:54,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:42:54,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:42:54,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:42:54,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:42:54,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:42:54,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:42:54,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:42:54,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:42:54,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:42:54,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:42:54,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:42:54,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:42:54,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:42:55,047 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 102 [2018-11-10 08:42:55,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:42:55,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:42:55,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:42:55,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:42:55,278 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2018-11-10 08:42:55,467 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 08:42:55,467 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 08:42:55,468 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:42:55,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:42:55,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:42:55,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:42:55,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:42:55,469 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:42:55,469 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:42:55,470 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:42:55,473 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:42:55,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:42:55,473 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:42:55,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:42:55,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:42:55,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:42:55,474 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:42:55,474 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:42:55,474 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:42:55,475 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:42:55,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:42:55,475 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:42:55,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:42:55,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:42:55,475 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:42:55,475 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:42:55,475 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:42:55,476 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:42:55,476 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:42:55,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:42:55,476 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:42:55,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:42:55,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:42:55,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:42:55,477 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:42:55,477 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:42:55,477 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:42:55,477 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:42:55,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:42:55,478 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:42:55,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:42:55,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:42:55,478 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:42:55,478 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:42:55,478 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:42:55,478 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:42:55,479 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:42:55,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:42:55,479 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:42:55,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:42:55,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:42:55,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:42:55,479 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:42:55,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:42:55,480 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:42:55,480 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:42:55,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:42:55,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:42:55,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:42:55,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:42:55,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:42:55,481 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:42:55,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:42:55,481 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:42:55,482 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:42:55,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:42:55,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:42:55,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:42:55,483 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:42:55,484 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:42:55,484 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:42:55,484 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:42:55,485 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:42:55,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:42:55,485 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:42:55,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:42:55,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:42:55,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:42:55,486 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:42:55,486 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:42:55,486 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:42:55,486 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:42:55,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:42:55,487 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:42:55,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:42:55,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:42:55,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:42:55,487 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:42:55,487 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:42:55,487 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:42:55,488 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:42:55,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:42:55,488 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:42:55,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:42:55,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:42:55,488 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:42:55,488 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:42:55,488 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:42:55,489 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:42:55,489 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:42:55,489 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:42:55,489 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:42:55,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:42:55,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:42:55,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:42:55,490 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:42:55,490 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:42:55,490 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:42:55,490 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:42:55,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:42:55,491 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:42:55,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:42:55,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:42:55,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:42:55,491 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:42:55,491 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:42:55,492 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:42:55,492 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:42:55,492 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:42:55,492 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:42:55,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:42:55,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:42:55,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:42:55,493 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:42:55,493 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:42:55,493 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:42:55,493 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:42:55,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:42:55,494 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 08:42:55,494 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:42:55,494 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:42:55,495 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 08:42:55,495 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:42:55,499 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:42:55,500 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:42:55,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:42:55,500 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 08:42:55,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:42:55,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:42:55,501 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 08:42:55,501 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:42:55,506 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:42:55,506 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:42:55,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:42:55,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:42:55,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:42:55,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:42:55,508 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:42:55,508 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:42:55,509 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:42:55,510 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:42:55,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:42:55,510 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:42:55,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:42:55,510 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 08:42:55,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:42:55,511 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 08:42:55,511 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:42:55,511 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:42:55,512 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:42:55,512 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:42:55,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:42:55,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:42:55,512 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:42:55,513 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:42:55,513 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:42:55,515 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:42:55,515 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:42:55,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:42:55,515 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:42:55,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:42:55,516 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:42:55,516 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:42:55,516 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:42:55,519 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:42:55,519 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:42:55,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:42:55,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:42:55,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:42:55,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:42:55,522 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:42:55,522 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:42:55,539 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 08:42:55,545 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 08:42:55,545 INFO L444 ModelExtractionUtils]: 54 out of 58 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 08:42:55,545 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 08:42:55,546 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 08:42:55,546 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 08:42:55,546 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_3, ULTIMATE.start_strlcpy_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_3 - 1*ULTIMATE.start_strlcpy_~s~0.offset Supporting invariants [] [2018-11-10 08:42:55,590 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2018-11-10 08:42:55,591 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 08:42:55,591 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 08:42:55,591 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-11-10 08:42:55,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:42:55,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:42:55,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:42:55,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:42:55,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:42:55,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:42:55,650 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-11-10 08:42:55,650 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 29 transitions. cyclomatic complexity: 6 Second operand 6 states. [2018-11-10 08:42:55,680 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 29 transitions. cyclomatic complexity: 6. Second operand 6 states. Result 30 states and 35 transitions. Complement of second has 7 states. [2018-11-10 08:42:55,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 08:42:55,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 08:42:55,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2018-11-10 08:42:55,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 11 letters. Loop has 4 letters. [2018-11-10 08:42:55,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:42:55,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 15 letters. Loop has 4 letters. [2018-11-10 08:42:55,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:42:55,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 11 letters. Loop has 8 letters. [2018-11-10 08:42:55,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:42:55,682 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 35 transitions. [2018-11-10 08:42:55,682 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 08:42:55,683 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 0 states and 0 transitions. [2018-11-10 08:42:55,683 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 08:42:55,683 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 08:42:55,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 08:42:55,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 08:42:55,683 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 08:42:55,683 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 08:42:55,683 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 08:42:55,683 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 08:42:55,683 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 08:42:55,683 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 08:42:55,683 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 08:42:55,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 08:42:55 BoogieIcfgContainer [2018-11-10 08:42:55,689 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 08:42:55,689 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 08:42:55,689 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 08:42:55,689 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 08:42:55,690 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 08:42:50" (3/4) ... [2018-11-10 08:42:55,693 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 08:42:55,693 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 08:42:55,693 INFO L168 Benchmark]: Toolchain (without parser) took 6152.76 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 324.5 MB). Free memory was 957.5 MB in the beginning and 927.1 MB in the end (delta: 30.5 MB). Peak memory consumption was 355.0 MB. Max. memory is 11.5 GB. [2018-11-10 08:42:55,694 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 08:42:55,694 INFO L168 Benchmark]: CACSL2BoogieTranslator took 275.33 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 936.1 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 08:42:55,695 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 936.1 MB in the beginning and 1.1 GB in the end (delta: -203.1 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-11-10 08:42:55,695 INFO L168 Benchmark]: Boogie Preprocessor took 15.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-10 08:42:55,695 INFO L168 Benchmark]: RCFGBuilder took 212.69 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-11-10 08:42:55,696 INFO L168 Benchmark]: BuchiAutomizer took 5570.10 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 179.8 MB). Free memory was 1.1 GB in the beginning and 927.1 MB in the end (delta: 188.0 MB). Peak memory consumption was 367.8 MB. Max. memory is 11.5 GB. [2018-11-10 08:42:55,696 INFO L168 Benchmark]: Witness Printer took 3.75 ms. Allocated memory is still 1.4 GB. Free memory is still 927.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 08:42:55,699 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 275.33 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 936.1 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 72.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 936.1 MB in the beginning and 1.1 GB in the end (delta: -203.1 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 212.69 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 5570.10 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 179.8 MB). Free memory was 1.1 GB in the beginning and 927.1 MB in the end (delta: 188.0 MB). Peak memory consumption was 367.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.75 ms. Allocated memory is still 1.4 GB. Free memory is still 927.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 - 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 #length - GenericResult: Unfinished Backtranslation unknown boogie variable #Ultimate.alloc_#res - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #Ultimate.alloc_#res * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[d] + -1 * d and consists of 4 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[#Ultimate.alloc_#res] and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[#Ultimate.alloc_#res] + -1 * s and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.5s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 4.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 26 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 27 states and ocurred in iteration 3. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 140 SDtfs, 143 SDslu, 94 SDs, 0 SdLazy, 49 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital216 mio100 ax100 hnf99 lsp97 ukn106 mio100 lsp44 div162 bol100 ite100 ukn100 eq177 hnf70 smp94 dnf100 smp100 tf100 neg99 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 17ms VariablesStem: 6 VariablesLoop: 3 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...