./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-libowfat/strlcat_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_7531f08c-2d43-4577-ba43-c33d1508e792/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7531f08c-2d43-4577-ba43-c33d1508e792/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7531f08c-2d43-4577-ba43-c33d1508e792/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7531f08c-2d43-4577-ba43-c33d1508e792/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-libowfat/strlcat_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_7531f08c-2d43-4577-ba43-c33d1508e792/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7531f08c-2d43-4577-ba43-c33d1508e792/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 31c220d29d6dec1ef33d2c1aa086e47a745ff101 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 01:14:11,349 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 01:14:11,350 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 01:14:11,356 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 01:14:11,356 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 01:14:11,357 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 01:14:11,358 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 01:14:11,358 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 01:14:11,359 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 01:14:11,360 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 01:14:11,360 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 01:14:11,360 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 01:14:11,361 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 01:14:11,361 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 01:14:11,362 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 01:14:11,362 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 01:14:11,362 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 01:14:11,363 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 01:14:11,364 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 01:14:11,365 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 01:14:11,365 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 01:14:11,366 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 01:14:11,367 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 01:14:11,367 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 01:14:11,367 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 01:14:11,367 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 01:14:11,368 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 01:14:11,368 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 01:14:11,369 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 01:14:11,369 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 01:14:11,369 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 01:14:11,370 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 01:14:11,370 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 01:14:11,370 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 01:14:11,370 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 01:14:11,371 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 01:14:11,371 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7531f08c-2d43-4577-ba43-c33d1508e792/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-09 01:14:11,378 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 01:14:11,379 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 01:14:11,379 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 01:14:11,379 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 01:14:11,379 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 01:14:11,379 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-09 01:14:11,380 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-09 01:14:11,380 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-09 01:14:11,380 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-09 01:14:11,380 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-09 01:14:11,380 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-09 01:14:11,380 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 01:14:11,380 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 01:14:11,380 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 01:14:11,380 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 01:14:11,380 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-09 01:14:11,380 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-09 01:14:11,380 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-09 01:14:11,380 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 01:14:11,381 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-09 01:14:11,381 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 01:14:11,381 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-09 01:14:11,381 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 01:14:11,381 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 01:14:11,381 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-09 01:14:11,381 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 01:14:11,381 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 01:14:11,381 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-09 01:14:11,382 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-09 01:14:11,382 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_7531f08c-2d43-4577-ba43-c33d1508e792/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 31c220d29d6dec1ef33d2c1aa086e47a745ff101 [2018-12-09 01:14:11,398 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 01:14:11,404 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 01:14:11,406 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 01:14:11,407 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 01:14:11,407 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 01:14:11,408 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7531f08c-2d43-4577-ba43-c33d1508e792/bin-2019/uautomizer/../../sv-benchmarks/c/termination-libowfat/strlcat_true-termination.c.i [2018-12-09 01:14:11,441 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7531f08c-2d43-4577-ba43-c33d1508e792/bin-2019/uautomizer/data/663b56844/046a07ce9ddc41ff8ca1df75ebdc433f/FLAG30e2f623a [2018-12-09 01:14:11,893 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 01:14:11,893 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7531f08c-2d43-4577-ba43-c33d1508e792/sv-benchmarks/c/termination-libowfat/strlcat_true-termination.c.i [2018-12-09 01:14:11,900 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7531f08c-2d43-4577-ba43-c33d1508e792/bin-2019/uautomizer/data/663b56844/046a07ce9ddc41ff8ca1df75ebdc433f/FLAG30e2f623a [2018-12-09 01:14:11,909 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7531f08c-2d43-4577-ba43-c33d1508e792/bin-2019/uautomizer/data/663b56844/046a07ce9ddc41ff8ca1df75ebdc433f [2018-12-09 01:14:11,912 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 01:14:11,913 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 01:14:11,913 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 01:14:11,913 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 01:14:11,915 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 01:14:11,916 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:14:11" (1/1) ... [2018-12-09 01:14:11,918 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@561b3c46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:14:11, skipping insertion in model container [2018-12-09 01:14:11,918 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:14:11" (1/1) ... [2018-12-09 01:14:11,922 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 01:14:11,945 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 01:14:12,107 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 01:14:12,150 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 01:14:12,173 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 01:14:12,193 INFO L195 MainTranslator]: Completed translation [2018-12-09 01:14:12,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:14:12 WrapperNode [2018-12-09 01:14:12,193 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 01:14:12,193 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 01:14:12,193 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 01:14:12,194 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 01:14:12,199 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:14:12" (1/1) ... [2018-12-09 01:14:12,206 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:14:12" (1/1) ... [2018-12-09 01:14:12,219 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 01:14:12,219 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 01:14:12,219 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 01:14:12,219 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 01:14:12,224 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:14:12" (1/1) ... [2018-12-09 01:14:12,225 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:14:12" (1/1) ... [2018-12-09 01:14:12,226 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:14:12" (1/1) ... [2018-12-09 01:14:12,226 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:14:12" (1/1) ... [2018-12-09 01:14:12,230 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:14:12" (1/1) ... [2018-12-09 01:14:12,232 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:14:12" (1/1) ... [2018-12-09 01:14:12,234 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:14:12" (1/1) ... [2018-12-09 01:14:12,235 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 01:14:12,235 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 01:14:12,235 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 01:14:12,235 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 01:14:12,236 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:14:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7531f08c-2d43-4577-ba43-c33d1508e792/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-12-09 01:14:12,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 01:14:12,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 01:14:12,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 01:14:12,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 01:14:12,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 01:14:12,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 01:14:12,408 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 01:14:12,408 INFO L280 CfgBuilder]: Removed 11 assue(true) statements. [2018-12-09 01:14:12,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:14:12 BoogieIcfgContainer [2018-12-09 01:14:12,408 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 01:14:12,409 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-09 01:14:12,409 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-09 01:14:12,411 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-09 01:14:12,411 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 01:14:12,411 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.12 01:14:11" (1/3) ... [2018-12-09 01:14:12,412 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6c60a6ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 01:14:12, skipping insertion in model container [2018-12-09 01:14:12,412 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 01:14:12,412 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:14:12" (2/3) ... [2018-12-09 01:14:12,412 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6c60a6ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 01:14:12, skipping insertion in model container [2018-12-09 01:14:12,412 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 01:14:12,412 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:14:12" (3/3) ... [2018-12-09 01:14:12,413 INFO L375 chiAutomizerObserver]: Analyzing ICFG strlcat_true-termination.c.i [2018-12-09 01:14:12,445 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 01:14:12,446 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-09 01:14:12,446 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-09 01:14:12,446 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-09 01:14:12,446 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 01:14:12,446 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 01:14:12,446 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-09 01:14:12,446 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 01:14:12,446 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-09 01:14:12,456 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2018-12-09 01:14:12,470 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-12-09 01:14:12,470 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 01:14:12,470 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 01:14:12,475 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-09 01:14:12,475 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 01:14:12,475 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-09 01:14:12,475 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2018-12-09 01:14:12,476 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-12-09 01:14:12,476 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 01:14:12,476 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 01:14:12,476 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-09 01:14:12,476 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 01:14:12,481 INFO L794 eck$LassoCheckResult]: Stem: 17#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 15#L-1true havoc main_#res;havoc main_#t~nondet15, main_#t~malloc16.base, main_#t~malloc16.offset, main_#t~nondet17, main_#t~malloc18.base, main_#t~malloc18.offset, main_#t~ret19, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet15;havoc main_#t~nondet15; 23#L539true assume !(main_~in_len~0 < 1);call main_#t~malloc16.base, main_#t~malloc16.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc16.base, main_#t~malloc16.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet17;havoc main_#t~nondet17; 14#L543true assume !(main_~out_len~0 < 1);call main_#t~malloc18.base, main_#t~malloc18.offset := #Ultimate.alloc(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc18.base, main_#t~malloc18.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + (main_~out_len~0 - 1), 1);strlcat_#in~dst.base, strlcat_#in~dst.offset, strlcat_#in~src.base, strlcat_#in~src.offset, strlcat_#in~siz := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset, main_~out_len~0;havoc strlcat_#res;havoc strlcat_#t~post8.base, strlcat_#t~post8.offset, strlcat_#t~mem5, strlcat_#t~post6, strlcat_#t~short7, strlcat_#t~ret9, strlcat_#t~post11.base, strlcat_#t~post11.offset, strlcat_#t~mem12, strlcat_#t~post13, strlcat_#t~post14.base, strlcat_#t~post14.offset, strlcat_#t~mem10, strlcat_~dst.base, strlcat_~dst.offset, strlcat_~src.base, strlcat_~src.offset, strlcat_~siz, strlcat_~d~0.base, strlcat_~d~0.offset, strlcat_~s~0.base, strlcat_~s~0.offset, strlcat_~n~0, strlcat_~dlen~0;strlcat_~dst.base, strlcat_~dst.offset := strlcat_#in~dst.base, strlcat_#in~dst.offset;strlcat_~src.base, strlcat_~src.offset := strlcat_#in~src.base, strlcat_#in~src.offset;strlcat_~siz := strlcat_#in~siz;strlcat_~d~0.base, strlcat_~d~0.offset := strlcat_~dst.base, strlcat_~dst.offset;strlcat_~s~0.base, strlcat_~s~0.offset := strlcat_~src.base, strlcat_~src.offset;strlcat_~n~0 := strlcat_~siz;havoc strlcat_~dlen~0; 3#L521-5true [2018-12-09 01:14:12,482 INFO L796 eck$LassoCheckResult]: Loop: 3#L521-5true call strlcat_#t~mem5 := read~int(strlcat_~d~0.base, strlcat_~d~0.offset, 1);strlcat_#t~short7 := 0 != strlcat_#t~mem5; 18#L521-1true assume strlcat_#t~short7;strlcat_#t~post6 := strlcat_~n~0;strlcat_~n~0 := strlcat_#t~post6 - 1;strlcat_#t~short7 := 0 != strlcat_#t~post6 % 4294967296; 22#L521-3true assume !!strlcat_#t~short7;havoc strlcat_#t~short7;havoc strlcat_#t~mem5;havoc strlcat_#t~post6;strlcat_#t~post8.base, strlcat_#t~post8.offset := strlcat_~d~0.base, strlcat_~d~0.offset;strlcat_~d~0.base, strlcat_~d~0.offset := strlcat_#t~post8.base, 1 + strlcat_#t~post8.offset;havoc strlcat_#t~post8.base, strlcat_#t~post8.offset; 3#L521-5true [2018-12-09 01:14:12,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:14:12,485 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2018-12-09 01:14:12,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:14:12,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:14:12,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:14:12,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:14:12,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:14:12,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:14:12,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:14:12,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:14:12,569 INFO L82 PathProgramCache]: Analyzing trace with hash 46776, now seen corresponding path program 1 times [2018-12-09 01:14:12,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:14:12,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:14:12,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:14:12,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:14:12,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:14:12,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:14:12,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:14:12,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:14:12,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1806907761, now seen corresponding path program 1 times [2018-12-09 01:14:12,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:14:12,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:14:12,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:14:12,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:14:12,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:14:12,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:14:12,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:14:12,888 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 100 [2018-12-09 01:14:12,968 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 01:14:12,969 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 01:14:12,969 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 01:14:12,969 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 01:14:12,969 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 01:14:12,969 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 01:14:12,969 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 01:14:12,969 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 01:14:12,969 INFO L131 ssoRankerPreferences]: Filename of dumped script: strlcat_true-termination.c.i_Iteration1_Lasso [2018-12-09 01:14:12,970 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 01:14:12,970 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 01:14:12,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:12,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:13,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:13,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:13,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:13,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:13,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:13,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:13,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:13,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:13,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:13,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:13,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:13,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:13,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:13,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:13,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:13,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:13,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:13,193 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2018-12-09 01:14:13,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:13,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:13,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:13,545 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 01:14:13,548 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 01:14:13,550 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-12-09 01:14:13,551 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:14:13,551 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:14:13,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:14:13,552 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:14:13,552 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:14:13,553 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:14:13,553 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:14:13,554 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:14:13,554 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-12-09 01:14:13,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:14:13,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:14:13,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:14:13,555 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:14:13,557 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:14:13,557 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:14:13,559 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:14:13,560 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-12-09 01:14:13,560 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:14:13,560 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:14:13,560 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:14:13,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:14:13,560 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:14:13,561 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:14:13,561 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:14:13,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:14:13,562 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-12-09 01:14:13,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:14:13,562 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:14:13,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:14:13,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:14:13,562 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:14:13,563 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:14:13,563 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:14:13,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:14:13,564 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-12-09 01:14:13,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:14:13,564 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:14:13,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:14:13,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:14:13,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:14:13,565 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:14:13,565 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:14:13,566 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:14:13,566 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-12-09 01:14:13,566 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:14:13,566 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:14:13,566 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:14:13,566 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:14:13,567 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:14:13,567 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:14:13,567 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:14:13,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:14:13,568 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-12-09 01:14:13,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:14:13,568 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:14:13,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:14:13,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:14:13,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:14:13,568 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:14:13,569 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:14:13,569 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:14:13,569 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-12-09 01:14:13,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:14:13,570 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:14:13,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:14:13,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:14:13,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:14:13,571 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:14:13,571 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:14:13,572 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:14:13,572 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-12-09 01:14:13,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:14:13,572 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:14:13,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:14:13,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:14:13,573 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:14:13,573 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:14:13,573 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:14:13,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:14:13,575 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-12-09 01:14:13,575 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:14:13,575 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:14:13,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:14:13,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:14:13,575 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:14:13,576 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:14:13,576 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:14:13,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:14:13,577 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-12-09 01:14:13,577 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:14:13,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:14:13,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:14:13,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:14:13,578 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:14:13,579 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:14:13,581 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:14:13,581 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-12-09 01:14:13,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:14:13,582 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:14:13,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:14:13,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:14:13,582 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:14:13,583 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:14:13,583 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:14:13,584 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:14:13,584 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-12-09 01:14:13,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:14:13,584 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:14:13,585 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:14:13,585 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:14:13,585 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:14:13,585 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:14:13,585 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:14:13,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:14:13,586 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:14:13,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:14:13,586 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:14:13,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:14:13,587 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:14:13,587 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:14:13,587 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:14:13,587 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:14:13,588 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:14:13,588 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-12-09 01:14:13,589 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:14:13,589 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:14:13,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:14:13,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:14:13,589 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:14:13,589 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:14:13,589 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:14:13,590 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:14:13,590 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-12-09 01:14:13,591 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:14:13,591 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:14:13,591 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:14:13,591 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:14:13,591 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:14:13,592 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:14:13,592 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:14:13,592 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:14:13,593 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:14:13,593 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:14:13,593 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:14:13,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:14:13,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:14:13,593 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:14:13,594 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:14:13,594 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:14:13,594 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:14:13,595 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-12-09 01:14:13,595 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:14:13,595 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:14:13,595 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:14:13,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:14:13,596 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:14:13,596 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:14:13,596 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:14:13,597 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:14:13,597 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-12-09 01:14:13,598 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:14:13,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:14:13,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:14:13,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:14:13,602 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:14:13,602 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:14:13,630 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 01:14:13,653 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-09 01:14:13,653 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-09 01:14:13,654 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 01:14:13,655 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 01:14:13,655 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 01:14:13,656 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strlcat_~d~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc16.base)_1) = -1*ULTIMATE.start_strlcat_~d~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc16.base)_1 Supporting invariants [] [2018-12-09 01:14:13,678 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-12-09 01:14:13,683 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-09 01:14:13,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:14:13,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:14:13,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:14:13,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:14:13,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:14:13,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:14:13,763 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-12-09 01:14:13,764 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states. Second operand 4 states. [2018-12-09 01:14:13,828 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states.. Second operand 4 states. Result 73 states and 101 transitions. Complement of second has 9 states. [2018-12-09 01:14:13,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-09 01:14:13,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-09 01:14:13,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2018-12-09 01:14:13,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 66 transitions. Stem has 4 letters. Loop has 3 letters. [2018-12-09 01:14:13,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 01:14:13,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 66 transitions. Stem has 7 letters. Loop has 3 letters. [2018-12-09 01:14:13,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 01:14:13,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 66 transitions. Stem has 4 letters. Loop has 6 letters. [2018-12-09 01:14:13,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 01:14:13,832 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 101 transitions. [2018-12-09 01:14:13,834 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2018-12-09 01:14:13,837 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 36 states and 45 transitions. [2018-12-09 01:14:13,837 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-12-09 01:14:13,837 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-12-09 01:14:13,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 45 transitions. [2018-12-09 01:14:13,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 01:14:13,838 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2018-12-09 01:14:13,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 45 transitions. [2018-12-09 01:14:13,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2018-12-09 01:14:13,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-09 01:14:13,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2018-12-09 01:14:13,854 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-12-09 01:14:13,854 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-12-09 01:14:13,854 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-09 01:14:13,854 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 35 transitions. [2018-12-09 01:14:13,854 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-12-09 01:14:13,854 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 01:14:13,854 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 01:14:13,855 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:14:13,855 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 01:14:13,855 INFO L794 eck$LassoCheckResult]: Stem: 212#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 210#L-1 havoc main_#res;havoc main_#t~nondet15, main_#t~malloc16.base, main_#t~malloc16.offset, main_#t~nondet17, main_#t~malloc18.base, main_#t~malloc18.offset, main_#t~ret19, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet15;havoc main_#t~nondet15; 211#L539 assume !(main_~in_len~0 < 1);call main_#t~malloc16.base, main_#t~malloc16.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc16.base, main_#t~malloc16.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet17;havoc main_#t~nondet17; 209#L543 assume !(main_~out_len~0 < 1);call main_#t~malloc18.base, main_#t~malloc18.offset := #Ultimate.alloc(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc18.base, main_#t~malloc18.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + (main_~out_len~0 - 1), 1);strlcat_#in~dst.base, strlcat_#in~dst.offset, strlcat_#in~src.base, strlcat_#in~src.offset, strlcat_#in~siz := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset, main_~out_len~0;havoc strlcat_#res;havoc strlcat_#t~post8.base, strlcat_#t~post8.offset, strlcat_#t~mem5, strlcat_#t~post6, strlcat_#t~short7, strlcat_#t~ret9, strlcat_#t~post11.base, strlcat_#t~post11.offset, strlcat_#t~mem12, strlcat_#t~post13, strlcat_#t~post14.base, strlcat_#t~post14.offset, strlcat_#t~mem10, strlcat_~dst.base, strlcat_~dst.offset, strlcat_~src.base, strlcat_~src.offset, strlcat_~siz, strlcat_~d~0.base, strlcat_~d~0.offset, strlcat_~s~0.base, strlcat_~s~0.offset, strlcat_~n~0, strlcat_~dlen~0;strlcat_~dst.base, strlcat_~dst.offset := strlcat_#in~dst.base, strlcat_#in~dst.offset;strlcat_~src.base, strlcat_~src.offset := strlcat_#in~src.base, strlcat_#in~src.offset;strlcat_~siz := strlcat_#in~siz;strlcat_~d~0.base, strlcat_~d~0.offset := strlcat_~dst.base, strlcat_~dst.offset;strlcat_~s~0.base, strlcat_~s~0.offset := strlcat_~src.base, strlcat_~src.offset;strlcat_~n~0 := strlcat_~siz;havoc strlcat_~dlen~0; 190#L521-5 call strlcat_#t~mem5 := read~int(strlcat_~d~0.base, strlcat_~d~0.offset, 1);strlcat_#t~short7 := 0 != strlcat_#t~mem5; 192#L521-1 assume !strlcat_#t~short7; 213#L521-3 assume !strlcat_#t~short7;havoc strlcat_#t~short7;havoc strlcat_#t~mem5;havoc strlcat_#t~post6; 204#L521-6 assume strlcat_~d~0.base == strlcat_~dst.base;strlcat_~dlen~0 := (if strlcat_~d~0.offset - strlcat_~dst.offset < 0 && 0 != (strlcat_~d~0.offset - strlcat_~dst.offset) % 1 then 1 + (strlcat_~d~0.offset - strlcat_~dst.offset) / 1 else (strlcat_~d~0.offset - strlcat_~dst.offset) / 1);strlcat_~n~0 := strlcat_~siz - strlcat_~dlen~0; 205#L525 assume !(0 == strlcat_~n~0 % 4294967296); 201#L527-3 [2018-12-09 01:14:13,855 INFO L796 eck$LassoCheckResult]: Loop: 201#L527-3 call strlcat_#t~mem10 := read~int(strlcat_~s~0.base, strlcat_~s~0.offset, 1); 196#L527-1 assume !!(0 != strlcat_#t~mem10);havoc strlcat_#t~mem10; 197#L528 assume !(1 != strlcat_~n~0 % 4294967296); 200#L528-2 strlcat_#t~post14.base, strlcat_#t~post14.offset := strlcat_~s~0.base, strlcat_~s~0.offset;strlcat_~s~0.base, strlcat_~s~0.offset := strlcat_#t~post14.base, 1 + strlcat_#t~post14.offset;havoc strlcat_#t~post14.base, strlcat_#t~post14.offset; 201#L527-3 [2018-12-09 01:14:13,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:14:13,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1271629448, now seen corresponding path program 1 times [2018-12-09 01:14:13,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:14:13,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:14:13,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:14:13,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:14:13,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:14:13,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:14:13,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:14:13,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:14:13,873 INFO L82 PathProgramCache]: Analyzing trace with hash 2898824, now seen corresponding path program 1 times [2018-12-09 01:14:13,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:14:13,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:14:13,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:14:13,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:14:13,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:14:13,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:14:13,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:14:13,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:14:13,879 INFO L82 PathProgramCache]: Analyzing trace with hash -701290865, now seen corresponding path program 1 times [2018-12-09 01:14:13,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:14:13,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:14:13,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:14:13,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:14:13,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:14:13,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:14:13,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:14:14,215 WARN L180 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 129 [2018-12-09 01:14:14,478 WARN L180 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 104 [2018-12-09 01:14:14,479 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 01:14:14,479 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 01:14:14,479 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 01:14:14,479 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 01:14:14,479 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 01:14:14,480 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 01:14:14,480 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 01:14:14,480 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 01:14:14,480 INFO L131 ssoRankerPreferences]: Filename of dumped script: strlcat_true-termination.c.i_Iteration2_Lasso [2018-12-09 01:14:14,480 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 01:14:14,480 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 01:14:14,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:14,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:14,694 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 89 [2018-12-09 01:14:14,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:14,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:14,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:14,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:14,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:14,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:14,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:14,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:14,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:14,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:14,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:14,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:14,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:14,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:14,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:14,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:14,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:14,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:14,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:14,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:14,937 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2018-12-09 01:14:15,149 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 01:14:15,149 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 01:14:15,149 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-12-09 01:14:15,150 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:14:15,150 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:14:15,150 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:14:15,150 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:14:15,150 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:14:15,150 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 01:14:15,150 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:14:15,151 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:14:15,151 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-12-09 01:14:15,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:14:15,151 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 01:14:15,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:14:15,151 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:14:15,153 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 01:14:15,153 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:14:15,162 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:14:15,162 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-12-09 01:14:15,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:14:15,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:14:15,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:14:15,163 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:14:15,164 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:14:15,164 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:14:15,166 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:14:15,166 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-12-09 01:14:15,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:14:15,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:14:15,167 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:14:15,167 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:14:15,168 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:14:15,168 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:14:15,169 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:14:15,170 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-12-09 01:14:15,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:14:15,170 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:14:15,170 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:14:15,170 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:14:15,170 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:14:15,171 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:14:15,171 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:14:15,172 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-12-09 01:14:15,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:14:15,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:14:15,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:14:15,172 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:14:15,173 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:14:15,173 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:14:15,177 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:14:15,178 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-12-09 01:14:15,178 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:14:15,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:14:15,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:14:15,178 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:14:15,179 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:14:15,179 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:14:15,180 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:14:15,181 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:14:15,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:14:15,181 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 01:14:15,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:14:15,181 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 01:14:15,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:14:15,182 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 01:14:15,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 01:14:15,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:14:15,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:14:15,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:14:15,184 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 01:14:15,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:14:15,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:14:15,185 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 01:14:15,186 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:14:15,191 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:14:15,191 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-12-09 01:14:15,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:14:15,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:14:15,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:14:15,192 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:14:15,193 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:14:15,193 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:14:15,194 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:14:15,195 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 01:14:15,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:14:15,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:14:15,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:14:15,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:14:15,199 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:14:15,199 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:14:15,221 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 01:14:15,244 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-09 01:14:15,245 INFO L444 ModelExtractionUtils]: 53 out of 61 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-12-09 01:14:15,245 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 01:14:15,246 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 01:14:15,246 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 01:14:15,246 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strlcat_~s~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc18.base)_2) = -1*ULTIMATE.start_strlcat_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc18.base)_2 Supporting invariants [] [2018-12-09 01:14:15,283 INFO L297 tatePredicateManager]: 13 out of 14 supporting invariants were superfluous and have been removed [2018-12-09 01:14:15,285 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-09 01:14:15,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:14:15,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:14:15,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:14:15,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:14:15,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:14:15,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:14:15,332 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-12-09 01:14:15,332 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 35 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-12-09 01:14:15,370 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 35 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 35 states and 44 transitions. Complement of second has 5 states. [2018-12-09 01:14:15,371 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-12-09 01:14:15,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-09 01:14:15,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2018-12-09 01:14:15,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 9 letters. Loop has 4 letters. [2018-12-09 01:14:15,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 01:14:15,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 13 letters. Loop has 4 letters. [2018-12-09 01:14:15,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 01:14:15,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 9 letters. Loop has 8 letters. [2018-12-09 01:14:15,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 01:14:15,372 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 44 transitions. [2018-12-09 01:14:15,373 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-09 01:14:15,373 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 16 states and 20 transitions. [2018-12-09 01:14:15,373 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-12-09 01:14:15,373 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-12-09 01:14:15,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2018-12-09 01:14:15,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 01:14:15,374 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-12-09 01:14:15,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2018-12-09 01:14:15,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-09 01:14:15,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-09 01:14:15,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2018-12-09 01:14:15,375 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-12-09 01:14:15,375 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-12-09 01:14:15,375 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-09 01:14:15,375 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2018-12-09 01:14:15,375 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-09 01:14:15,375 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 01:14:15,375 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 01:14:15,376 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:14:15,376 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 01:14:15,376 INFO L794 eck$LassoCheckResult]: Stem: 386#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 384#L-1 havoc main_#res;havoc main_#t~nondet15, main_#t~malloc16.base, main_#t~malloc16.offset, main_#t~nondet17, main_#t~malloc18.base, main_#t~malloc18.offset, main_#t~ret19, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet15;havoc main_#t~nondet15; 385#L539 assume !(main_~in_len~0 < 1);call main_#t~malloc16.base, main_#t~malloc16.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc16.base, main_#t~malloc16.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet17;havoc main_#t~nondet17; 383#L543 assume !(main_~out_len~0 < 1);call main_#t~malloc18.base, main_#t~malloc18.offset := #Ultimate.alloc(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc18.base, main_#t~malloc18.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + (main_~out_len~0 - 1), 1);strlcat_#in~dst.base, strlcat_#in~dst.offset, strlcat_#in~src.base, strlcat_#in~src.offset, strlcat_#in~siz := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset, main_~out_len~0;havoc strlcat_#res;havoc strlcat_#t~post8.base, strlcat_#t~post8.offset, strlcat_#t~mem5, strlcat_#t~post6, strlcat_#t~short7, strlcat_#t~ret9, strlcat_#t~post11.base, strlcat_#t~post11.offset, strlcat_#t~mem12, strlcat_#t~post13, strlcat_#t~post14.base, strlcat_#t~post14.offset, strlcat_#t~mem10, strlcat_~dst.base, strlcat_~dst.offset, strlcat_~src.base, strlcat_~src.offset, strlcat_~siz, strlcat_~d~0.base, strlcat_~d~0.offset, strlcat_~s~0.base, strlcat_~s~0.offset, strlcat_~n~0, strlcat_~dlen~0;strlcat_~dst.base, strlcat_~dst.offset := strlcat_#in~dst.base, strlcat_#in~dst.offset;strlcat_~src.base, strlcat_~src.offset := strlcat_#in~src.base, strlcat_#in~src.offset;strlcat_~siz := strlcat_#in~siz;strlcat_~d~0.base, strlcat_~d~0.offset := strlcat_~dst.base, strlcat_~dst.offset;strlcat_~s~0.base, strlcat_~s~0.offset := strlcat_~src.base, strlcat_~src.offset;strlcat_~n~0 := strlcat_~siz;havoc strlcat_~dlen~0; 374#L521-5 call strlcat_#t~mem5 := read~int(strlcat_~d~0.base, strlcat_~d~0.offset, 1);strlcat_#t~short7 := 0 != strlcat_#t~mem5; 375#L521-1 assume !strlcat_#t~short7; 387#L521-3 assume !strlcat_#t~short7;havoc strlcat_#t~short7;havoc strlcat_#t~mem5;havoc strlcat_#t~post6; 380#L521-6 assume strlcat_~d~0.base == strlcat_~dst.base;strlcat_~dlen~0 := (if strlcat_~d~0.offset - strlcat_~dst.offset < 0 && 0 != (strlcat_~d~0.offset - strlcat_~dst.offset) % 1 then 1 + (strlcat_~d~0.offset - strlcat_~dst.offset) / 1 else (strlcat_~d~0.offset - strlcat_~dst.offset) / 1);strlcat_~n~0 := strlcat_~siz - strlcat_~dlen~0; 381#L525 assume 0 == strlcat_~n~0 % 4294967296;strlen_#in~s.base, strlen_#in~s.offset := strlcat_~s~0.base, strlcat_~s~0.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 382#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 378#L509-4 [2018-12-09 01:14:15,376 INFO L796 eck$LassoCheckResult]: Loop: 378#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 379#L509-1 assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 389#L509-3 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 378#L509-4 [2018-12-09 01:14:15,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:14:15,376 INFO L82 PathProgramCache]: Analyzing trace with hash 765806520, now seen corresponding path program 1 times [2018-12-09 01:14:15,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:14:15,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:14:15,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:14:15,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:14:15,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:14:15,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:14:15,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:14:15,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:14:15,398 INFO L82 PathProgramCache]: Analyzing trace with hash 73645, now seen corresponding path program 1 times [2018-12-09 01:14:15,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:14:15,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:14:15,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:14:15,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:14:15,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:14:15,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:14:15,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:14:15,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:14:15,403 INFO L82 PathProgramCache]: Analyzing trace with hash -724195178, now seen corresponding path program 1 times [2018-12-09 01:14:15,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:14:15,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:14:15,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:14:15,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:14:15,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:14:15,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:14:15,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:14:15,772 WARN L180 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 137 [2018-12-09 01:14:16,047 WARN L180 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 112 [2018-12-09 01:14:16,049 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 01:14:16,049 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 01:14:16,049 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 01:14:16,049 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 01:14:16,049 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 01:14:16,049 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 01:14:16,049 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 01:14:16,049 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 01:14:16,049 INFO L131 ssoRankerPreferences]: Filename of dumped script: strlcat_true-termination.c.i_Iteration3_Lasso [2018-12-09 01:14:16,049 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 01:14:16,049 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 01:14:16,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:16,276 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 96 [2018-12-09 01:14:16,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:16,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:16,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:16,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:16,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:16,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:16,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:16,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:16,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:16,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:16,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:16,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:16,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:16,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:16,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:16,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:16,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:16,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:16,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:16,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:16,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:16,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:16,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:16,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:16,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:16,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 01:14:16,497 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2018-12-09 01:14:16,736 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 01:14:16,736 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 01:14:16,737 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-12-09 01:14:16,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:14:16,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:14:16,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:14:16,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:14:16,738 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:14:16,738 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:14:16,739 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:14:16,739 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-12-09 01:14:16,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:14:16,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:14:16,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:14:16,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:14:16,740 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:14:16,740 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:14:16,740 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:14:16,741 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-12-09 01:14:16,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:14:16,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:14:16,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:14:16,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:14:16,741 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:14:16,742 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:14:16,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:14:16,744 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-12-09 01:14:16,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:14:16,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:14:16,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:14:16,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:14:16,745 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:14:16,745 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:14:16,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 01:14:16,745 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-12-09 01:14:16,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 01:14:16,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 01:14:16,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 01:14:16,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 01:14:16,747 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 01:14:16,747 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 01:14:16,757 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 01:14:16,763 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 01:14:16,763 INFO L444 ModelExtractionUtils]: 56 out of 61 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-09 01:14:16,763 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 01:14:16,764 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 01:14:16,764 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 01:14:16,764 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc18.base)_3, ULTIMATE.start_strlen_~s.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc18.base)_3 - 1*ULTIMATE.start_strlen_~s.offset Supporting invariants [] [2018-12-09 01:14:16,797 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2018-12-09 01:14:16,798 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-09 01:14:16,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:14:16,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:14:16,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:14:16,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:14:16,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:14:16,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:14:16,843 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-12-09 01:14:16,843 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 6 Second operand 5 states. [2018-12-09 01:14:16,869 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 6. Second operand 5 states. Result 19 states and 24 transitions. Complement of second has 6 states. [2018-12-09 01:14:16,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-09 01:14:16,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-09 01:14:16,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2018-12-09 01:14:16,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 10 letters. Loop has 3 letters. [2018-12-09 01:14:16,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 01:14:16,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 13 letters. Loop has 3 letters. [2018-12-09 01:14:16,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 01:14:16,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 10 letters. Loop has 6 letters. [2018-12-09 01:14:16,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 01:14:16,871 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 24 transitions. [2018-12-09 01:14:16,871 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 01:14:16,871 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 0 states and 0 transitions. [2018-12-09 01:14:16,871 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-09 01:14:16,871 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-09 01:14:16,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-09 01:14:16,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 01:14:16,871 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 01:14:16,871 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 01:14:16,871 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 01:14:16,871 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-09 01:14:16,871 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-09 01:14:16,871 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 01:14:16,872 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-09 01:14:16,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.12 01:14:16 BoogieIcfgContainer [2018-12-09 01:14:16,876 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-09 01:14:16,876 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 01:14:16,876 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 01:14:16,876 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 01:14:16,876 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:14:12" (3/4) ... [2018-12-09 01:14:16,879 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 01:14:16,879 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 01:14:16,879 INFO L168 Benchmark]: Toolchain (without parser) took 4967.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 190.3 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -106.3 MB). Peak memory consumption was 84.0 MB. Max. memory is 11.5 GB. [2018-12-09 01:14:16,880 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 01:14:16,880 INFO L168 Benchmark]: CACSL2BoogieTranslator took 280.04 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 96.5 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -131.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. [2018-12-09 01:14:16,880 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.61 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 01:14:16,880 INFO L168 Benchmark]: Boogie Preprocessor took 15.69 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 01:14:16,881 INFO L168 Benchmark]: RCFGBuilder took 173.32 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2018-12-09 01:14:16,881 INFO L168 Benchmark]: BuchiAutomizer took 4467.13 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 93.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 213.6 kB). Peak memory consumption was 94.1 MB. Max. memory is 11.5 GB. [2018-12-09 01:14:16,881 INFO L168 Benchmark]: Witness Printer took 2.85 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-12-09 01:14:16,883 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 280.04 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 96.5 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -131.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.61 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.69 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 173.32 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4467.13 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 93.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 213.6 kB). Peak memory consumption was 94.1 MB. Max. memory is 11.5 GB. * Witness Printer took 2.85 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. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (0 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * d + unknown-#length-unknown[__builtin_alloca (in_len)] and consists of 6 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[__builtin_alloca (out_len)] and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (out_len)] + -1 * s and consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.4s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 4.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 9 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 27 states and ocurred in iteration 1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 51 SDtfs, 75 SDslu, 40 SDs, 0 SdLazy, 36 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital228 mio100 ax100 hnf99 lsp95 ukn82 mio100 lsp45 div198 bol100 ite100 ukn100 eq162 hnf64 smp93 dnf100 smp100 tf100 neg99 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms 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...