./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f4e0dd25-90c9-46f8-8da6-32ee67cf0800/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f4e0dd25-90c9-46f8-8da6-32ee67cf0800/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f4e0dd25-90c9-46f8-8da6-32ee67cf0800/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f4e0dd25-90c9-46f8-8da6-32ee67cf0800/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_f4e0dd25-90c9-46f8-8da6-32ee67cf0800/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f4e0dd25-90c9-46f8-8da6-32ee67cf0800/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7d00aad8dfdafc20547a229a92ab2c2bdb101f8c ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 12:05:20,190 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:05:20,191 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:05:20,197 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:05:20,197 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:05:20,198 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:05:20,198 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:05:20,199 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:05:20,200 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:05:20,201 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:05:20,202 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:05:20,202 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:05:20,203 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:05:20,204 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:05:20,204 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:05:20,205 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:05:20,206 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:05:20,207 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:05:20,208 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:05:20,209 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:05:20,210 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:05:20,211 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:05:20,213 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:05:20,213 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:05:20,213 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:05:20,214 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:05:20,215 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:05:20,215 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:05:20,216 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:05:20,216 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:05:20,217 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:05:20,217 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:05:20,217 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:05:20,217 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:05:20,218 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:05:20,219 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:05:20,219 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f4e0dd25-90c9-46f8-8da6-32ee67cf0800/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-23 12:05:20,227 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:05:20,227 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:05:20,228 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:05:20,228 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:05:20,228 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:05:20,229 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 12:05:20,229 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 12:05:20,229 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 12:05:20,229 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 12:05:20,229 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 12:05:20,229 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 12:05:20,229 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:05:20,229 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:05:20,230 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 12:05:20,230 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:05:20,230 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:05:20,230 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:05:20,230 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 12:05:20,230 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 12:05:20,232 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 12:05:20,232 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:05:20,232 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:05:20,232 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 12:05:20,232 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:05:20,232 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 12:05:20,233 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:05:20,233 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:05:20,233 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 12:05:20,233 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:05:20,233 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:05:20,233 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 12:05:20,234 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 12:05:20,234 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_f4e0dd25-90c9-46f8-8da6-32ee67cf0800/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7d00aad8dfdafc20547a229a92ab2c2bdb101f8c [2018-11-23 12:05:20,256 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:05:20,265 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:05:20,267 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:05:20,268 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:05:20,269 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:05:20,269 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f4e0dd25-90c9-46f8-8da6-32ee67cf0800/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-11-23 12:05:20,313 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f4e0dd25-90c9-46f8-8da6-32ee67cf0800/bin-2019/uautomizer/data/df4f2fc20/83e56a14eee042d58c0fdd4ee988f744/FLAGf4a576094 [2018-11-23 12:05:20,735 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:05:20,736 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f4e0dd25-90c9-46f8-8da6-32ee67cf0800/sv-benchmarks/c/array-memsafety/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-11-23 12:05:20,743 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f4e0dd25-90c9-46f8-8da6-32ee67cf0800/bin-2019/uautomizer/data/df4f2fc20/83e56a14eee042d58c0fdd4ee988f744/FLAGf4a576094 [2018-11-23 12:05:20,751 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f4e0dd25-90c9-46f8-8da6-32ee67cf0800/bin-2019/uautomizer/data/df4f2fc20/83e56a14eee042d58c0fdd4ee988f744 [2018-11-23 12:05:20,752 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:05:20,753 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:05:20,754 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:05:20,754 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:05:20,756 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:05:20,756 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:05:20" (1/1) ... [2018-11-23 12:05:20,758 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d2a78e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:20, skipping insertion in model container [2018-11-23 12:05:20,758 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:05:20" (1/1) ... [2018-11-23 12:05:20,764 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:05:20,791 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:05:20,970 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:05:20,978 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:05:21,042 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:05:21,073 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:05:21,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:21 WrapperNode [2018-11-23 12:05:21,073 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:05:21,074 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:05:21,074 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:05:21,074 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:05:21,081 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:21" (1/1) ... [2018-11-23 12:05:21,089 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:21" (1/1) ... [2018-11-23 12:05:21,102 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:05:21,103 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:05:21,103 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:05:21,103 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:05:21,108 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:21" (1/1) ... [2018-11-23 12:05:21,108 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:21" (1/1) ... [2018-11-23 12:05:21,110 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:21" (1/1) ... [2018-11-23 12:05:21,110 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:21" (1/1) ... [2018-11-23 12:05:21,113 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:21" (1/1) ... [2018-11-23 12:05:21,116 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:21" (1/1) ... [2018-11-23 12:05:21,117 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:21" (1/1) ... [2018-11-23 12:05:21,119 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:05:21,119 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:05:21,119 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:05:21,119 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:05:21,120 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4e0dd25-90c9-46f8-8da6-32ee67cf0800/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 12:05:21,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:05:21,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:05:21,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:05:21,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:05:21,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:05:21,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:05:21,338 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:05:21,338 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 12:05:21,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:05:21 BoogieIcfgContainer [2018-11-23 12:05:21,338 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:05:21,339 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 12:05:21,339 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 12:05:21,342 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 12:05:21,343 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 12:05:21,344 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 12:05:20" (1/3) ... [2018-11-23 12:05:21,345 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@59ac36bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 12:05:21, skipping insertion in model container [2018-11-23 12:05:21,345 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 12:05:21,345 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:21" (2/3) ... [2018-11-23 12:05:21,345 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@59ac36bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 12:05:21, skipping insertion in model container [2018-11-23 12:05:21,345 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 12:05:21,345 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:05:21" (3/3) ... [2018-11-23 12:05:21,348 INFO L375 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-11-23 12:05:21,390 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:05:21,391 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 12:05:21,391 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 12:05:21,391 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 12:05:21,391 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:05:21,391 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:05:21,391 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 12:05:21,391 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:05:21,391 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 12:05:21,404 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-23 12:05:21,421 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-23 12:05:21,422 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 12:05:21,422 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 12:05:21,426 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-23 12:05:21,426 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 12:05:21,426 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 12:05:21,426 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-23 12:05:21,428 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-23 12:05:21,428 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 12:05:21,428 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 12:05:21,428 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-23 12:05:21,428 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 12:05:21,433 INFO L794 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~ret12, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 16#L563true assume !(main_~length~0 < 1); 19#L563-2true assume !(main_~n~1 < 1); 10#L566-1true call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 5#L546true assume 0 != cstrlcpy_~n~0 % 4294967296; 9#L547-3true [2018-11-23 12:05:21,434 INFO L796 eck$LassoCheckResult]: Loop: 9#L547-3true cstrlcpy_#t~pre2 := cstrlcpy_~n~0 - 1;cstrlcpy_~n~0 := cstrlcpy_~n~0 - 1; 6#L547-1true assume !!(0 != cstrlcpy_#t~pre2 % 4294967296);havoc cstrlcpy_#t~pre2;cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset := cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_#t~post3.base, 1 + cstrlcpy_#t~post3.offset;cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post4.base, 1 + cstrlcpy_#t~post4.offset;call cstrlcpy_#t~mem5 := read~int(cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, 1);call write~int(cstrlcpy_#t~mem5, cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, 1); 3#L548true assume !(0 == cstrlcpy_#t~mem5);havoc cstrlcpy_#t~mem5;havoc cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset; 9#L547-3true [2018-11-23 12:05:21,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:21,438 INFO L82 PathProgramCache]: Analyzing trace with hash 889572236, now seen corresponding path program 1 times [2018-11-23 12:05:21,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:21,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:21,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:21,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:21,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:21,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:05:21,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:05:21,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:21,544 INFO L82 PathProgramCache]: Analyzing trace with hash 52795, now seen corresponding path program 1 times [2018-11-23 12:05:21,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:21,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:21,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:21,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:21,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:21,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:05:21,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:05:21,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:21,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1298289360, now seen corresponding path program 1 times [2018-11-23 12:05:21,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:21,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:21,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:21,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:21,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:21,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:05:21,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:05:21,990 WARN L180 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 94 [2018-11-23 12:05:22,094 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 12:05:22,095 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 12:05:22,095 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 12:05:22,095 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 12:05:22,095 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 12:05:22,095 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 12:05:22,095 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 12:05:22,096 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 12:05:22,096 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2018-11-23 12:05:22,096 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 12:05:22,096 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 12:05:22,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:05:22,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:05:22,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:05:22,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:05:22,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:05:22,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:05:22,379 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 82 [2018-11-23 12:05:22,496 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2018-11-23 12:05:22,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:05:22,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:05:22,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:05:22,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:05:22,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:05:22,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:05:22,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:05:22,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:05:22,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:05:22,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:05:22,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:05:22,723 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2018-11-23 12:05:22,826 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2018-11-23 12:05:23,062 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 12:05:23,064 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 12:05:23,066 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:05:23,067 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:05:23,067 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:05:23,067 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:05:23,067 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:05:23,067 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:05:23,069 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:05:23,069 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:05:23,070 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:05:23,070 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:05:23,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:05:23,071 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:05:23,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:05:23,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:05:23,071 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:05:23,071 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:05:23,072 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:05:23,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:05:23,073 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:05:23,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:05:23,074 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:05:23,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:05:23,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:05:23,074 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:05:23,075 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:05:23,075 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:05:23,075 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:05:23,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-23 12:05:23,076 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:05:23,076 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:05:23,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:05:23,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:05:23,076 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:05:23,077 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:05:23,077 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:05:23,077 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:05:23,078 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:05:23,078 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:05:23,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:05:23,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:05:23,079 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:05:23,080 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:05:23,081 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:05:23,083 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:05:23,083 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:05:23,084 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:05:23,084 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:05:23,084 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:05:23,084 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 12:05:23,084 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:05:23,085 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 12:05:23,085 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:05:23,087 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:05:23,088 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:05:23,088 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:05:23,088 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:05:23,088 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:05:23,089 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:05:23,089 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:05:23,089 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:05:23,089 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:05:23,090 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:05:23,090 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:05:23,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:05:23,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:05:23,090 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:05:23,091 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:05:23,092 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:05:23,092 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:05:23,097 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:05:23,097 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:05:23,098 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:05:23,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:05:23,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:05:23,098 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:05:23,099 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:05:23,099 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:05:23,101 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:05:23,102 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:05:23,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:05:23,102 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 12:05:23,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:05:23,102 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:05:23,105 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 12:05:23,105 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:05:23,121 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:05:23,121 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:05:23,122 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:05:23,122 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:05:23,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:05:23,122 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:05:23,123 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:05:23,123 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:05:23,126 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:05:23,126 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:05:23,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:05:23,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:05:23,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:05:23,127 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:05:23,128 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:05:23,128 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:05:23,130 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:05:23,130 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:05:23,131 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:05:23,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:05:23,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:05:23,131 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:05:23,132 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:05:23,133 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:05:23,140 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:05:23,141 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:05:23,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:05:23,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:05:23,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:05:23,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:05:23,148 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:05:23,149 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:05:23,205 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 12:05:23,251 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 12:05:23,251 INFO L444 ModelExtractionUtils]: 53 out of 58 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 12:05:23,253 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 12:05:23,254 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 12:05:23,255 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 12:05:23,255 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrlcpy_~s~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_1) = -1*ULTIMATE.start_cstrlcpy_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_1 Supporting invariants [] [2018-11-23 12:05:23,308 INFO L297 tatePredicateManager]: 15 out of 16 supporting invariants were superfluous and have been removed [2018-11-23 12:05:23,315 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 12:05:23,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:23,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:23,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:23,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:23,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:23,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:23,423 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-23 12:05:23,424 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 5 states. [2018-11-23 12:05:23,491 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 5 states. Result 49 states and 70 transitions. Complement of second has 7 states. [2018-11-23 12:05:23,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 12:05:23,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:05:23,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2018-11-23 12:05:23,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 50 transitions. Stem has 6 letters. Loop has 3 letters. [2018-11-23 12:05:23,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:05:23,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 50 transitions. Stem has 9 letters. Loop has 3 letters. [2018-11-23 12:05:23,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:05:23,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 50 transitions. Stem has 6 letters. Loop has 6 letters. [2018-11-23 12:05:23,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:05:23,497 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 70 transitions. [2018-11-23 12:05:23,500 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 12:05:23,503 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 10 states and 13 transitions. [2018-11-23 12:05:23,504 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 12:05:23,504 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 12:05:23,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2018-11-23 12:05:23,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 12:05:23,505 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-23 12:05:23,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2018-11-23 12:05:23,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-11-23 12:05:23,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:05:23,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-11-23 12:05:23,527 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-23 12:05:23,527 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-23 12:05:23,527 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 12:05:23,527 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2018-11-23 12:05:23,528 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 12:05:23,528 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 12:05:23,528 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 12:05:23,528 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:23,528 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 12:05:23,528 INFO L794 eck$LassoCheckResult]: Stem: 195#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 190#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~ret12, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 191#L563 assume !(main_~length~0 < 1); 196#L563-2 assume !(main_~n~1 < 1); 199#L566-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 197#L546 assume !(0 != cstrlcpy_~n~0 % 4294967296); 198#L546-1 assume 0 == cstrlcpy_~n~0 % 4294967296; 192#L553 assume !(0 != cstrlcpy_~siz % 4294967296); 193#L555-2 [2018-11-23 12:05:23,529 INFO L796 eck$LassoCheckResult]: Loop: 193#L555-2 cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post6.base, 1 + cstrlcpy_#t~post6.offset;call cstrlcpy_#t~mem7 := read~int(cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, 1); 194#L555 assume !!(0 != cstrlcpy_#t~mem7);havoc cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset;havoc cstrlcpy_#t~mem7; 193#L555-2 [2018-11-23 12:05:23,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:23,529 INFO L82 PathProgramCache]: Analyzing trace with hash 180447461, now seen corresponding path program 1 times [2018-11-23 12:05:23,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:23,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:23,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:23,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:23,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:23,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:05:23,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:05:23,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:23,550 INFO L82 PathProgramCache]: Analyzing trace with hash 2630, now seen corresponding path program 1 times [2018-11-23 12:05:23,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:23,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:23,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:23,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:23,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:23,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:05:23,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:05:23,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:23,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1611319850, now seen corresponding path program 1 times [2018-11-23 12:05:23,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:23,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:23,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:23,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:23,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:23,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:05:23,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:05:23,795 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 93 [2018-11-23 12:05:23,868 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 12:05:23,868 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 12:05:23,868 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 12:05:23,868 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 12:05:23,868 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 12:05:23,869 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 12:05:23,869 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 12:05:23,869 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 12:05:23,869 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-11-23 12:05:23,869 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 12:05:23,869 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 12:05:23,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:05:23,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:05:23,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:05:23,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:05:23,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:05:23,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:05:23,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:05:23,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:05:23,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:05:23,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:05:23,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:05:23,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:05:23,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:05:24,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:05:24,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:05:24,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:05:24,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:05:24,339 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 12:05:24,340 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 12:05:24,340 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:05:24,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:05:24,341 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:05:24,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:05:24,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:05:24,341 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:05:24,341 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:05:24,342 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:05:24,342 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:05:24,342 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:05:24,343 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:05:24,343 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:05:24,343 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:05:24,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:05:24,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:05:24,343 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:05:24,343 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:05:24,344 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:05:24,344 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:05:24,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:05:24,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:05:24,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:05:24,344 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:05:24,345 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:05:24,345 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:05:24,346 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:05:24,346 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:05:24,347 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:05:24,347 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:05:24,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:05:24,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:05:24,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:05:24,347 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:05:24,347 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:05:24,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:05:24,348 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:05:24,348 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:05:24,348 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:05:24,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:05:24,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:05:24,349 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:05:24,349 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:05:24,349 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:05:24,349 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:05:24,350 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:05:24,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:05:24,350 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:05:24,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:05:24,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:05:24,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:05:24,351 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:05:24,351 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:05:24,351 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:05:24,351 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:05:24,352 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:05:24,352 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:05:24,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:05:24,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:05:24,352 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:05:24,352 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:05:24,352 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:05:24,353 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:05:24,353 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:05:24,353 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:05:24,353 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:05:24,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:05:24,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:05:24,353 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:05:24,354 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:05:24,354 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:05:24,354 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:05:24,354 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:05:24,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:05:24,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:05:24,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:05:24,355 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:05:24,356 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:05:24,356 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:05:24,357 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:05:24,357 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:05:24,357 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:05:24,357 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:05:24,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:05:24,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:05:24,358 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:05:24,358 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:05:24,358 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:05:24,358 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:05:24,359 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:05:24,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:05:24,359 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:05:24,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:05:24,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:05:24,359 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:05:24,359 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:05:24,360 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:05:24,360 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:05:24,360 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:05:24,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:05:24,361 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:05:24,361 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:05:24,361 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:05:24,361 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:05:24,361 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:05:24,361 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:05:24,361 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:05:24,362 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:05:24,362 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:05:24,362 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:05:24,362 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:05:24,362 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:05:24,363 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:05:24,363 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:05:24,365 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:05:24,366 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:05:24,366 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:05:24,366 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:05:24,366 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:05:24,366 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:05:24,367 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:05:24,367 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:05:24,371 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:05:24,371 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:05:24,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:05:24,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:05:24,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:05:24,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:05:24,372 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:05:24,373 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:05:24,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:05:24,376 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:05:24,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:05:24,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:05:24,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:05:24,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:05:24,378 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:05:24,378 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:05:24,379 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:05:24,379 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:05:24,380 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:05:24,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:05:24,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:05:24,380 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:05:24,380 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:05:24,381 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:05:24,382 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:05:24,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:05:24,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:05:24,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:05:24,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:05:24,383 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:05:24,384 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:05:24,384 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:05:24,385 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:05:24,385 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:05:24,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:05:24,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:05:24,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:05:24,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:05:24,387 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:05:24,387 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:05:24,388 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:05:24,388 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:05:24,388 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:05:24,388 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 12:05:24,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:05:24,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:05:24,390 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 12:05:24,390 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:05:24,394 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:05:24,394 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:05:24,395 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:05:24,395 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 12:05:24,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:05:24,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:05:24,396 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 12:05:24,396 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:05:24,402 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:05:24,402 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 12:05:24,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:05:24,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:05:24,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:05:24,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:05:24,404 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:05:24,404 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:05:24,411 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 12:05:24,419 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 12:05:24,420 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 12:05:24,420 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 12:05:24,421 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 12:05:24,421 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 12:05:24,421 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrlcpy_~s~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_2) = -1*ULTIMATE.start_cstrlcpy_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_2 Supporting invariants [] [2018-11-23 12:05:24,463 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-11-23 12:05:24,464 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 12:05:24,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:24,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:24,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:24,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:24,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:24,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:24,509 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-23 12:05:24,509 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 4 states. [2018-11-23 12:05:24,529 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 14 states and 17 transitions. Complement of second has 5 states. [2018-11-23 12:05:24,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 12:05:24,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:05:24,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-11-23 12:05:24,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 8 letters. Loop has 2 letters. [2018-11-23 12:05:24,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:05:24,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 10 letters. Loop has 2 letters. [2018-11-23 12:05:24,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:05:24,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 8 letters. Loop has 4 letters. [2018-11-23 12:05:24,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:05:24,532 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2018-11-23 12:05:24,533 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 12:05:24,533 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 12 transitions. [2018-11-23 12:05:24,533 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 12:05:24,533 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 12:05:24,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 12 transitions. [2018-11-23 12:05:24,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 12:05:24,533 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-11-23 12:05:24,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 12 transitions. [2018-11-23 12:05:24,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-11-23 12:05:24,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:05:24,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2018-11-23 12:05:24,534 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-11-23 12:05:24,534 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-11-23 12:05:24,534 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 12:05:24,535 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2018-11-23 12:05:24,535 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 12:05:24,535 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 12:05:24,535 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 12:05:24,535 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:24,535 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 12:05:24,536 INFO L794 eck$LassoCheckResult]: Stem: 312#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 307#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~ret12, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 308#L563 assume !(main_~length~0 < 1); 313#L563-2 assume !(main_~n~1 < 1); 316#L566-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 314#L546 assume !(0 != cstrlcpy_~n~0 % 4294967296); 315#L546-1 assume 0 == cstrlcpy_~n~0 % 4294967296; 309#L553 assume 0 != cstrlcpy_~siz % 4294967296;call write~int(0, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, 1); 310#L555-2 [2018-11-23 12:05:24,536 INFO L796 eck$LassoCheckResult]: Loop: 310#L555-2 cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post6.base, 1 + cstrlcpy_#t~post6.offset;call cstrlcpy_#t~mem7 := read~int(cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, 1); 311#L555 assume !!(0 != cstrlcpy_#t~mem7);havoc cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset;havoc cstrlcpy_#t~mem7; 310#L555-2 [2018-11-23 12:05:24,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:24,536 INFO L82 PathProgramCache]: Analyzing trace with hash 180447459, now seen corresponding path program 1 times [2018-11-23 12:05:24,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:24,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:24,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:24,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:24,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:24,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:24,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:24,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:05:24,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:05:24,622 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 12:05:24,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:24,622 INFO L82 PathProgramCache]: Analyzing trace with hash 2630, now seen corresponding path program 2 times [2018-11-23 12:05:24,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:24,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:24,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:24,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:24,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:24,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:05:24,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:05:24,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:05:24,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:05:24,656 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-11-23 12:05:24,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:24,669 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2018-11-23 12:05:24,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:05:24,669 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8 states and 9 transitions. [2018-11-23 12:05:24,669 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 12:05:24,669 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8 states to 0 states and 0 transitions. [2018-11-23 12:05:24,669 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 12:05:24,670 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 12:05:24,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 12:05:24,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 12:05:24,670 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 12:05:24,670 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 12:05:24,670 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 12:05:24,670 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 12:05:24,670 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 12:05:24,670 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 12:05:24,670 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 12:05:24,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 12:05:24 BoogieIcfgContainer [2018-11-23 12:05:24,674 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 12:05:24,674 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:05:24,674 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:05:24,674 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:05:24,675 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:05:21" (3/4) ... [2018-11-23 12:05:24,677 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 12:05:24,677 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:05:24,678 INFO L168 Benchmark]: Toolchain (without parser) took 3925.11 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 322.4 MB). Free memory was 956.4 MB in the beginning and 1.2 GB in the end (delta: -280.7 MB). Peak memory consumption was 41.7 MB. Max. memory is 11.5 GB. [2018-11-23 12:05:24,678 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:05:24,679 INFO L168 Benchmark]: CACSL2BoogieTranslator took 320.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -178.5 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. [2018-11-23 12:05:24,679 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.53 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-23 12:05:24,679 INFO L168 Benchmark]: Boogie Preprocessor took 15.94 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:05:24,680 INFO L168 Benchmark]: RCFGBuilder took 219.60 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: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. [2018-11-23 12:05:24,680 INFO L168 Benchmark]: BuchiAutomizer took 3335.28 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 175.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -133.4 MB). Peak memory consumption was 41.7 MB. Max. memory is 11.5 GB. [2018-11-23 12:05:24,680 INFO L168 Benchmark]: Witness Printer took 3.09 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:05:24,682 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 320.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -178.5 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.53 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. * Boogie Preprocessor took 15.94 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 219.60 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: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3335.28 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 175.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -133.4 MB). Peak memory consumption was 41.7 MB. Max. memory is 11.5 GB. * Witness Printer took 3.09 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[__builtin_alloca (length * sizeof(char))] and consists of 5 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[__builtin_alloca (length * sizeof(char))] and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.3s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 10 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 46 SDtfs, 42 SDslu, 34 SDs, 0 SdLazy, 20 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital226 mio100 ax100 hnf99 lsp97 ukn83 mio100 lsp41 div150 bol100 ite100 ukn100 eq166 hnf75 smp97 dnf100 smp100 tf100 neg99 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms VariablesStem: 5 VariablesLoop: 4 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...