./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-libowfat/strlcpy_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_241b7b0f-f6b4-4fde-a176-79806117b710/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_241b7b0f-f6b4-4fde-a176-79806117b710/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_241b7b0f-f6b4-4fde-a176-79806117b710/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_241b7b0f-f6b4-4fde-a176-79806117b710/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-libowfat/strlcpy_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_241b7b0f-f6b4-4fde-a176-79806117b710/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_241b7b0f-f6b4-4fde-a176-79806117b710/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash fd4754e908bed6ae29d10e34d903201d1cfa0296 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 08:08:08,013 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 08:08:08,015 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 08:08:08,021 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 08:08:08,021 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 08:08:08,022 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 08:08:08,022 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 08:08:08,023 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 08:08:08,024 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 08:08:08,024 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 08:08:08,025 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 08:08:08,025 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 08:08:08,026 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 08:08:08,027 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 08:08:08,027 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 08:08:08,028 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 08:08:08,029 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 08:08:08,030 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 08:08:08,031 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 08:08:08,032 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 08:08:08,033 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 08:08:08,034 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 08:08:08,035 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 08:08:08,036 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 08:08:08,036 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 08:08:08,036 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 08:08:08,037 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 08:08:08,037 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 08:08:08,038 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 08:08:08,038 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 08:08:08,038 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 08:08:08,039 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 08:08:08,039 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 08:08:08,039 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 08:08:08,040 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 08:08:08,040 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 08:08:08,040 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_241b7b0f-f6b4-4fde-a176-79806117b710/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 08:08:08,049 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 08:08:08,049 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 08:08:08,050 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 08:08:08,050 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 08:08:08,050 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 08:08:08,050 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 08:08:08,051 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 08:08:08,051 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 08:08:08,051 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 08:08:08,051 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 08:08:08,051 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 08:08:08,051 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 08:08:08,051 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 08:08:08,051 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 08:08:08,052 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 08:08:08,052 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 08:08:08,052 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 08:08:08,052 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 08:08:08,052 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 08:08:08,052 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 08:08:08,052 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 08:08:08,052 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 08:08:08,053 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 08:08:08,053 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 08:08:08,053 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 08:08:08,053 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 08:08:08,053 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 08:08:08,053 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 08:08:08,054 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 08:08:08,054 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_241b7b0f-f6b4-4fde-a176-79806117b710/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fd4754e908bed6ae29d10e34d903201d1cfa0296 [2018-11-23 08:08:08,078 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 08:08:08,088 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 08:08:08,090 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 08:08:08,091 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 08:08:08,092 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 08:08:08,092 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_241b7b0f-f6b4-4fde-a176-79806117b710/bin-2019/uautomizer/../../sv-benchmarks/c/termination-libowfat/strlcpy_true-termination.c.i [2018-11-23 08:08:08,139 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_241b7b0f-f6b4-4fde-a176-79806117b710/bin-2019/uautomizer/data/f2556b77f/4782649639724cb1b704a88bb2afb359/FLAGd3c23caf9 [2018-11-23 08:08:08,504 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 08:08:08,504 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_241b7b0f-f6b4-4fde-a176-79806117b710/sv-benchmarks/c/termination-libowfat/strlcpy_true-termination.c.i [2018-11-23 08:08:08,513 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_241b7b0f-f6b4-4fde-a176-79806117b710/bin-2019/uautomizer/data/f2556b77f/4782649639724cb1b704a88bb2afb359/FLAGd3c23caf9 [2018-11-23 08:08:08,894 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_241b7b0f-f6b4-4fde-a176-79806117b710/bin-2019/uautomizer/data/f2556b77f/4782649639724cb1b704a88bb2afb359 [2018-11-23 08:08:08,896 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 08:08:08,897 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 08:08:08,898 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 08:08:08,898 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 08:08:08,901 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 08:08:08,902 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:08:08" (1/1) ... [2018-11-23 08:08:08,904 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@762406c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:08:08, skipping insertion in model container [2018-11-23 08:08:08,904 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:08:08" (1/1) ... [2018-11-23 08:08:08,910 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 08:08:08,937 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 08:08:09,128 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 08:08:09,134 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 08:08:09,204 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 08:08:09,236 INFO L195 MainTranslator]: Completed translation [2018-11-23 08:08:09,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:08:09 WrapperNode [2018-11-23 08:08:09,237 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 08:08:09,238 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 08:08:09,238 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 08:08:09,238 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 08:08:09,243 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:08:09" (1/1) ... [2018-11-23 08:08:09,251 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:08:09" (1/1) ... [2018-11-23 08:08:09,264 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 08:08:09,265 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 08:08:09,265 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 08:08:09,265 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 08:08:09,271 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:08:09" (1/1) ... [2018-11-23 08:08:09,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:08:09" (1/1) ... [2018-11-23 08:08:09,273 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:08:09" (1/1) ... [2018-11-23 08:08:09,273 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:08:09" (1/1) ... [2018-11-23 08:08:09,278 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:08:09" (1/1) ... [2018-11-23 08:08:09,282 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:08:09" (1/1) ... [2018-11-23 08:08:09,283 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:08:09" (1/1) ... [2018-11-23 08:08:09,285 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 08:08:09,286 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 08:08:09,286 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 08:08:09,286 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 08:08:09,287 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:08:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_241b7b0f-f6b4-4fde-a176-79806117b710/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 08:08:09,324 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 08:08:09,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 08:08:09,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 08:08:09,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 08:08:09,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 08:08:09,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 08:08:09,508 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 08:08:09,508 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 08:08:09,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:08:09 BoogieIcfgContainer [2018-11-23 08:08:09,509 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 08:08:09,509 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 08:08:09,510 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 08:08:09,513 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 08:08:09,513 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 08:08:09,513 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 08:08:08" (1/3) ... [2018-11-23 08:08:09,514 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4a56e58f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 08:08:09, skipping insertion in model container [2018-11-23 08:08:09,514 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 08:08:09,515 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:08:09" (2/3) ... [2018-11-23 08:08:09,515 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4a56e58f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 08:08:09, skipping insertion in model container [2018-11-23 08:08:09,515 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 08:08:09,515 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:08:09" (3/3) ... [2018-11-23 08:08:09,516 INFO L375 chiAutomizerObserver]: Analyzing ICFG strlcpy_true-termination.c.i [2018-11-23 08:08:09,560 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 08:08:09,560 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 08:08:09,560 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 08:08:09,560 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 08:08:09,560 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 08:08:09,560 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 08:08:09,561 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 08:08:09,561 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 08:08:09,561 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 08:08:09,571 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-11-23 08:08:09,587 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-23 08:08:09,587 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 08:08:09,587 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 08:08:09,592 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-23 08:08:09,592 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 08:08:09,592 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 08:08:09,592 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-11-23 08:08:09,593 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-23 08:08:09,593 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 08:08:09,593 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 08:08:09,594 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-23 08:08:09,594 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 08:08:09,599 INFO L794 eck$LassoCheckResult]: Stem: 17#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 14#L-1true havoc main_#res;havoc main_#t~nondet10, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet10;havoc main_#t~nondet10; 19#L530true assume !(main_~in_len~0 < 1);call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc11.base, main_#t~malloc11.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~nondet12;havoc main_#t~nondet12; 9#L534true assume !(main_~out_len~0 < 1);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;strlcpy_#in~dst.base, strlcpy_#in~dst.offset, strlcpy_#in~src.base, strlcpy_#in~src.offset, strlcpy_#in~siz := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset, main_~out_len~0;havoc strlcpy_#res;havoc strlcpy_#t~pre2, strlcpy_#t~short3, strlcpy_#t~post5.base, strlcpy_#t~post5.offset, strlcpy_#t~post6.base, strlcpy_#t~post6.offset, strlcpy_#t~mem7, strlcpy_#t~pre4, strlcpy_#t~post8.base, strlcpy_#t~post8.offset, strlcpy_#t~mem9, strlcpy_~dst.base, strlcpy_~dst.offset, strlcpy_~src.base, strlcpy_~src.offset, strlcpy_~siz, strlcpy_~d~0.base, strlcpy_~d~0.offset, strlcpy_~s~0.base, strlcpy_~s~0.offset, strlcpy_~n~0;strlcpy_~dst.base, strlcpy_~dst.offset := strlcpy_#in~dst.base, strlcpy_#in~dst.offset;strlcpy_~src.base, strlcpy_~src.offset := strlcpy_#in~src.base, strlcpy_#in~src.offset;strlcpy_~siz := strlcpy_#in~siz;strlcpy_~d~0.base, strlcpy_~d~0.offset := strlcpy_~dst.base, strlcpy_~dst.offset;strlcpy_~s~0.base, strlcpy_~s~0.offset := strlcpy_~src.base, strlcpy_~src.offset;strlcpy_~n~0 := strlcpy_~siz;strlcpy_#t~short3 := 0 != strlcpy_~n~0 % 4294967296; 6#L514true assume strlcpy_#t~short3;strlcpy_#t~pre2 := strlcpy_~n~0 - 1;strlcpy_~n~0 := strlcpy_~n~0 - 1;strlcpy_#t~short3 := 0 != strlcpy_#t~pre2 % 4294967296; 11#L514-2true assume strlcpy_#t~short3;havoc strlcpy_#t~pre2;havoc strlcpy_#t~short3; 12#L515-4true [2018-11-23 08:08:09,600 INFO L796 eck$LassoCheckResult]: Loop: 12#L515-4true strlcpy_#t~post5.base, strlcpy_#t~post5.offset := strlcpy_~d~0.base, strlcpy_~d~0.offset;strlcpy_~d~0.base, strlcpy_~d~0.offset := strlcpy_#t~post5.base, 1 + strlcpy_#t~post5.offset;strlcpy_#t~post6.base, strlcpy_#t~post6.offset := strlcpy_~s~0.base, strlcpy_~s~0.offset;strlcpy_~s~0.base, strlcpy_~s~0.offset := strlcpy_#t~post6.base, 1 + strlcpy_#t~post6.offset;call strlcpy_#t~mem7 := read~int(strlcpy_#t~post6.base, strlcpy_#t~post6.offset, 1);call write~int(strlcpy_#t~mem7, strlcpy_#t~post5.base, strlcpy_#t~post5.offset, 1); 3#L516true assume !(0 == strlcpy_#t~mem7);havoc strlcpy_#t~post6.base, strlcpy_#t~post6.offset;havoc strlcpy_#t~mem7;havoc strlcpy_#t~post5.base, strlcpy_#t~post5.offset; 7#L515-1true strlcpy_#t~pre4 := strlcpy_~n~0 - 1;strlcpy_~n~0 := strlcpy_~n~0 - 1; 8#L515-2true assume !!(0 != strlcpy_#t~pre4 % 4294967296);havoc strlcpy_#t~pre4; 12#L515-4true [2018-11-23 08:08:09,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:08:09,604 INFO L82 PathProgramCache]: Analyzing trace with hash 889571278, now seen corresponding path program 1 times [2018-11-23 08:08:09,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:08:09,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:08:09,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:08:09,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:08:09,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:08:09,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:08:09,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:08:09,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:08:09,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1698155, now seen corresponding path program 1 times [2018-11-23 08:08:09,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:08:09,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:08:09,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:08:09,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:08:09,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:08:09,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:08:09,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:08:09,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:08:09,732 INFO L82 PathProgramCache]: Analyzing trace with hash 707592888, now seen corresponding path program 1 times [2018-11-23 08:08:09,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:08:09,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:08:09,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:08:09,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:08:09,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:08:09,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:08:09,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:08:10,349 WARN L180 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 106 [2018-11-23 08:08:10,465 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2018-11-23 08:08:10,475 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 08:08:10,476 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 08:08:10,476 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 08:08:10,476 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 08:08:10,476 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 08:08:10,476 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 08:08:10,477 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 08:08:10,477 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 08:08:10,477 INFO L131 ssoRankerPreferences]: Filename of dumped script: strlcpy_true-termination.c.i_Iteration1_Lasso [2018-11-23 08:08:10,477 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 08:08:10,477 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 08:08:10,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:08:10,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:08:10,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:08:10,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:08:10,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:08:10,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:08:10,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:08:10,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:08:10,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:08:10,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:08:10,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:08:10,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:08:10,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:08:10,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:08:10,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:08:10,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:08:10,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:08:10,767 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 86 [2018-11-23 08:08:10,877 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2018-11-23 08:08:10,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:08:10,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:08:11,218 WARN L180 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 81 [2018-11-23 08:08:11,516 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 08:08:11,521 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 08:08:11,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:08:11,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:08:11,525 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:08:11,525 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:08:11,525 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:08:11,526 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:08:11,527 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:08:11,527 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:08:11,529 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:08:11,529 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:08:11,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:08:11,530 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:08:11,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:08:11,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:08:11,530 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:08:11,530 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:08:11,530 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:08:11,531 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:08:11,531 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:08:11,531 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:08:11,532 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:08:11,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:08:11,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:08:11,532 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:08:11,532 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:08:11,532 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:08:11,533 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:08:11,533 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:08:11,534 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:08:11,534 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:08:11,534 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:08:11,534 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:08:11,536 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 08:08:11,536 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 08:08:11,540 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:08:11,540 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:08:11,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:08:11,541 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:08:11,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:08:11,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:08:11,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:08:11,542 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:08:11,542 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:08:11,542 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:08:11,543 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:08:11,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:08:11,543 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:08:11,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:08:11,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:08:11,543 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:08:11,544 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:08:11,544 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:08:11,544 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:08:11,544 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:08:11,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:08:11,545 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:08:11,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:08:11,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:08:11,545 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:08:11,547 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:08:11,547 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:08:11,548 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:08:11,548 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:08:11,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:08:11,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:08:11,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:08:11,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:08:11,550 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 08:08:11,550 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 08:08:11,553 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:08:11,553 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:08:11,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:08:11,553 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:08:11,554 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:08:11,554 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:08:11,554 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:08:11,554 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:08:11,554 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:08:11,555 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:08:11,555 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:08:11,556 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:08:11,556 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:08:11,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:08:11,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:08:11,556 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:08:11,556 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:08:11,556 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:08:11,557 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:08:11,557 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:08:11,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:08:11,557 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:08:11,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:08:11,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:08:11,558 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:08:11,558 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:08:11,558 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:08:11,559 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:08:11,559 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:08:11,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:08:11,560 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:08:11,560 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:08:11,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:08:11,560 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:08:11,560 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:08:11,560 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:08:11,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:08:11,561 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:08:11,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:08:11,562 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:08:11,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:08:11,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:08:11,562 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:08:11,562 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:08:11,562 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:08:11,563 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:08:11,563 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:08:11,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:08:11,564 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:08:11,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:08:11,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:08:11,564 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:08:11,564 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:08:11,564 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:08:11,565 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:08:11,565 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:08:11,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:08:11,565 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:08:11,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:08:11,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:08:11,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:08:11,566 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:08:11,566 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:08:11,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:08:11,567 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:08:11,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:08:11,567 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:08:11,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:08:11,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:08:11,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:08:11,568 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:08:11,568 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:08:11,569 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:08:11,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-11-23 08:08:11,569 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:08:11,570 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:08:11,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:08:11,570 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 08:08:11,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:08:11,570 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 08:08:11,571 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:08:11,573 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:08:11,573 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:08:11,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:08:11,574 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 08:08:11,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:08:11,574 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:08:11,577 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 08:08:11,577 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 08:08:11,592 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:08:11,592 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:08:11,592 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:08:11,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:08:11,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:08:11,593 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:08:11,599 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 08:08:11,599 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 08:08:11,657 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 08:08:11,696 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 08:08:11,696 INFO L444 ModelExtractionUtils]: 57 out of 61 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 08:08:11,698 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 08:08:11,699 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 08:08:11,699 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 08:08:11,699 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strlcpy_~s~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_1) = -1*ULTIMATE.start_strlcpy_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_1 Supporting invariants [] [2018-11-23 08:08:11,747 INFO L297 tatePredicateManager]: 11 out of 13 supporting invariants were superfluous and have been removed [2018-11-23 08:08:11,754 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 08:08:11,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:08:11,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:08:11,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:08:11,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:08:11,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:08:11,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:08:11,922 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-11-23 08:08:11,923 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states. Second operand 5 states. [2018-11-23 08:08:12,047 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states.. Second operand 5 states. Result 54 states and 76 transitions. Complement of second has 8 states. [2018-11-23 08:08:12,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 08:08:12,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 08:08:12,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2018-11-23 08:08:12,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 53 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-23 08:08:12,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 08:08:12,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 53 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-23 08:08:12,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 08:08:12,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 53 transitions. Stem has 6 letters. Loop has 8 letters. [2018-11-23 08:08:12,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 08:08:12,054 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 76 transitions. [2018-11-23 08:08:12,057 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-23 08:08:12,061 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 24 states and 30 transitions. [2018-11-23 08:08:12,062 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-23 08:08:12,062 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-23 08:08:12,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 30 transitions. [2018-11-23 08:08:12,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 08:08:12,063 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2018-11-23 08:08:12,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 30 transitions. [2018-11-23 08:08:12,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 17. [2018-11-23 08:08:12,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 08:08:12,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2018-11-23 08:08:12,089 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2018-11-23 08:08:12,089 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2018-11-23 08:08:12,089 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 08:08:12,089 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 22 transitions. [2018-11-23 08:08:12,090 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 08:08:12,090 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 08:08:12,090 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 08:08:12,091 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:08:12,091 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 08:08:12,091 INFO L794 eck$LassoCheckResult]: Stem: 208#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 206#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet10;havoc main_#t~nondet10; 207#L530 assume !(main_~in_len~0 < 1);call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc11.base, main_#t~malloc11.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~nondet12;havoc main_#t~nondet12; 201#L534 assume !(main_~out_len~0 < 1);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;strlcpy_#in~dst.base, strlcpy_#in~dst.offset, strlcpy_#in~src.base, strlcpy_#in~src.offset, strlcpy_#in~siz := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset, main_~out_len~0;havoc strlcpy_#res;havoc strlcpy_#t~pre2, strlcpy_#t~short3, strlcpy_#t~post5.base, strlcpy_#t~post5.offset, strlcpy_#t~post6.base, strlcpy_#t~post6.offset, strlcpy_#t~mem7, strlcpy_#t~pre4, strlcpy_#t~post8.base, strlcpy_#t~post8.offset, strlcpy_#t~mem9, strlcpy_~dst.base, strlcpy_~dst.offset, strlcpy_~src.base, strlcpy_~src.offset, strlcpy_~siz, strlcpy_~d~0.base, strlcpy_~d~0.offset, strlcpy_~s~0.base, strlcpy_~s~0.offset, strlcpy_~n~0;strlcpy_~dst.base, strlcpy_~dst.offset := strlcpy_#in~dst.base, strlcpy_#in~dst.offset;strlcpy_~src.base, strlcpy_~src.offset := strlcpy_#in~src.base, strlcpy_#in~src.offset;strlcpy_~siz := strlcpy_#in~siz;strlcpy_~d~0.base, strlcpy_~d~0.offset := strlcpy_~dst.base, strlcpy_~dst.offset;strlcpy_~s~0.base, strlcpy_~s~0.offset := strlcpy_~src.base, strlcpy_~src.offset;strlcpy_~n~0 := strlcpy_~siz;strlcpy_#t~short3 := 0 != strlcpy_~n~0 % 4294967296; 196#L514 assume strlcpy_#t~short3;strlcpy_#t~pre2 := strlcpy_~n~0 - 1;strlcpy_~n~0 := strlcpy_~n~0 - 1;strlcpy_#t~short3 := 0 != strlcpy_#t~pre2 % 4294967296; 197#L514-2 assume !strlcpy_#t~short3;havoc strlcpy_#t~pre2;havoc strlcpy_#t~short3; 193#L514-3 assume 0 == strlcpy_~n~0 % 4294967296; 205#L521 assume !(0 != strlcpy_~siz % 4294967296); 203#L523-2 [2018-11-23 08:08:12,091 INFO L796 eck$LassoCheckResult]: Loop: 203#L523-2 strlcpy_#t~post8.base, strlcpy_#t~post8.offset := strlcpy_~s~0.base, strlcpy_~s~0.offset;strlcpy_~s~0.base, strlcpy_~s~0.offset := strlcpy_#t~post8.base, 1 + strlcpy_#t~post8.offset;call strlcpy_#t~mem9 := read~int(strlcpy_#t~post8.base, strlcpy_#t~post8.offset, 1); 202#L523 assume !!(0 != strlcpy_#t~mem9);havoc strlcpy_#t~post8.base, strlcpy_#t~post8.offset;havoc strlcpy_#t~mem9; 203#L523-2 [2018-11-23 08:08:12,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:08:12,091 INFO L82 PathProgramCache]: Analyzing trace with hash 179527912, now seen corresponding path program 1 times [2018-11-23 08:08:12,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:08:12,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:08:12,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:08:12,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:08:12,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:08:12,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:08:12,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:08:12,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:08:12,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:08:12,226 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 08:08:12,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:08:12,226 INFO L82 PathProgramCache]: Analyzing trace with hash 2758, now seen corresponding path program 1 times [2018-11-23 08:08:12,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:08:12,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:08:12,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:08:12,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:08:12,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:08:12,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:08:12,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:08:12,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 08:08:12,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 08:08:12,265 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-11-23 08:08:12,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:08:12,344 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2018-11-23 08:08:12,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 08:08:12,346 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 37 transitions. [2018-11-23 08:08:12,347 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-23 08:08:12,347 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 37 transitions. [2018-11-23 08:08:12,347 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-23 08:08:12,348 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-23 08:08:12,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2018-11-23 08:08:12,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 08:08:12,348 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 37 transitions. [2018-11-23 08:08:12,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2018-11-23 08:08:12,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 20. [2018-11-23 08:08:12,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 08:08:12,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2018-11-23 08:08:12,351 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2018-11-23 08:08:12,351 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2018-11-23 08:08:12,351 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 08:08:12,352 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2018-11-23 08:08:12,352 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 08:08:12,352 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 08:08:12,352 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 08:08:12,354 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:08:12,354 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 08:08:12,354 INFO L794 eck$LassoCheckResult]: Stem: 264#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 262#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet10;havoc main_#t~nondet10; 263#L530 assume !(main_~in_len~0 < 1);call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc11.base, main_#t~malloc11.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~nondet12;havoc main_#t~nondet12; 257#L534 assume !(main_~out_len~0 < 1);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;strlcpy_#in~dst.base, strlcpy_#in~dst.offset, strlcpy_#in~src.base, strlcpy_#in~src.offset, strlcpy_#in~siz := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset, main_~out_len~0;havoc strlcpy_#res;havoc strlcpy_#t~pre2, strlcpy_#t~short3, strlcpy_#t~post5.base, strlcpy_#t~post5.offset, strlcpy_#t~post6.base, strlcpy_#t~post6.offset, strlcpy_#t~mem7, strlcpy_#t~pre4, strlcpy_#t~post8.base, strlcpy_#t~post8.offset, strlcpy_#t~mem9, strlcpy_~dst.base, strlcpy_~dst.offset, strlcpy_~src.base, strlcpy_~src.offset, strlcpy_~siz, strlcpy_~d~0.base, strlcpy_~d~0.offset, strlcpy_~s~0.base, strlcpy_~s~0.offset, strlcpy_~n~0;strlcpy_~dst.base, strlcpy_~dst.offset := strlcpy_#in~dst.base, strlcpy_#in~dst.offset;strlcpy_~src.base, strlcpy_~src.offset := strlcpy_#in~src.base, strlcpy_#in~src.offset;strlcpy_~siz := strlcpy_#in~siz;strlcpy_~d~0.base, strlcpy_~d~0.offset := strlcpy_~dst.base, strlcpy_~dst.offset;strlcpy_~s~0.base, strlcpy_~s~0.offset := strlcpy_~src.base, strlcpy_~src.offset;strlcpy_~n~0 := strlcpy_~siz;strlcpy_#t~short3 := 0 != strlcpy_~n~0 % 4294967296; 251#L514 assume !strlcpy_#t~short3; 252#L514-2 assume !strlcpy_#t~short3;havoc strlcpy_#t~pre2;havoc strlcpy_#t~short3; 266#L514-3 assume 0 == strlcpy_~n~0 % 4294967296; 265#L521 assume !(0 != strlcpy_~siz % 4294967296); 259#L523-2 [2018-11-23 08:08:12,354 INFO L796 eck$LassoCheckResult]: Loop: 259#L523-2 strlcpy_#t~post8.base, strlcpy_#t~post8.offset := strlcpy_~s~0.base, strlcpy_~s~0.offset;strlcpy_~s~0.base, strlcpy_~s~0.offset := strlcpy_#t~post8.base, 1 + strlcpy_#t~post8.offset;call strlcpy_#t~mem9 := read~int(strlcpy_#t~post8.base, strlcpy_#t~post8.offset, 1); 258#L523 assume !!(0 != strlcpy_#t~mem9);havoc strlcpy_#t~post8.base, strlcpy_#t~post8.offset;havoc strlcpy_#t~mem9; 259#L523-2 [2018-11-23 08:08:12,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:08:12,355 INFO L82 PathProgramCache]: Analyzing trace with hash 179587494, now seen corresponding path program 1 times [2018-11-23 08:08:12,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:08:12,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:08:12,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:08:12,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:08:12,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:08:12,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:08:12,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:08:12,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:08:12,371 INFO L82 PathProgramCache]: Analyzing trace with hash 2758, now seen corresponding path program 2 times [2018-11-23 08:08:12,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:08:12,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:08:12,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:08:12,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:08:12,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:08:12,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:08:12,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:08:12,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:08:12,376 INFO L82 PathProgramCache]: Analyzing trace with hash 784891691, now seen corresponding path program 1 times [2018-11-23 08:08:12,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:08:12,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:08:12,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:08:12,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:08:12,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:08:12,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:08:12,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:08:12,714 WARN L180 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 97 [2018-11-23 08:08:12,819 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2018-11-23 08:08:12,821 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 08:08:12,821 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 08:08:12,821 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 08:08:12,821 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 08:08:12,821 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 08:08:12,821 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 08:08:12,821 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 08:08:12,821 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 08:08:12,822 INFO L131 ssoRankerPreferences]: Filename of dumped script: strlcpy_true-termination.c.i_Iteration3_Lasso [2018-11-23 08:08:12,822 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 08:08:12,822 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 08:08:12,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:08:12,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:08:12,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:08:12,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:08:12,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:08:12,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:08:12,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:08:12,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:08:12,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:08:12,997 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 75 [2018-11-23 08:08:13,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:08:13,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:08:13,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:08:13,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:08:13,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:08:13,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:08:13,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:08:13,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:08:13,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:08:13,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:08:13,393 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 08:08:13,393 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 08:08:13,394 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:08:13,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:08:13,394 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:08:13,395 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:08:13,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:08:13,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:08:13,395 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:08:13,396 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:08:13,396 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:08:13,397 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:08:13,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:08:13,398 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:08:13,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:08:13,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:08:13,398 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:08:13,398 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:08:13,398 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:08:13,399 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:08:13,399 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:08:13,400 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:08:13,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:08:13,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:08:13,400 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:08:13,401 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 08:08:13,402 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 08:08:13,403 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:08:13,404 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:08:13,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:08:13,404 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:08:13,404 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:08:13,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:08:13,405 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:08:13,405 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:08:13,405 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:08:13,406 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:08:13,406 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:08:13,407 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:08:13,407 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:08:13,407 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:08:13,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:08:13,407 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:08:13,408 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:08:13,408 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:08:13,408 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:08:13,409 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:08:13,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:08:13,410 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:08:13,410 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:08:13,410 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:08:13,410 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:08:13,410 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:08:13,411 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:08:13,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:08:13,412 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:08:13,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:08:13,412 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:08:13,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:08:13,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:08:13,413 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:08:13,413 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:08:13,413 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:08:13,414 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:08:13,415 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:08:13,415 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:08:13,415 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:08:13,415 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:08:13,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:08:13,416 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:08:13,416 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:08:13,416 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:08:13,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:08:13,418 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:08:13,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:08:13,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:08:13,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:08:13,419 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:08:13,419 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 08:08:13,420 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 08:08:13,424 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:08:13,424 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:08:13,425 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:08:13,425 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:08:13,425 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:08:13,425 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:08:13,426 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 08:08:13,427 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 08:08:13,431 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:08:13,431 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:08:13,432 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:08:13,432 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:08:13,432 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:08:13,432 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 08:08:13,432 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:08:13,433 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 08:08:13,433 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:08:13,434 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:08:13,435 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:08:13,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:08:13,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:08:13,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:08:13,436 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:08:13,436 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 08:08:13,436 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 08:08:13,438 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:08:13,438 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:08:13,439 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:08:13,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:08:13,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:08:13,439 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:08:13,440 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 08:08:13,440 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 08:08:13,441 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:08:13,442 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:08:13,442 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:08:13,442 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 08:08:13,442 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:08:13,442 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:08:13,444 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 08:08:13,444 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 08:08:13,450 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:08:13,451 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:08:13,451 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:08:13,451 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:08:13,452 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:08:13,452 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:08:13,453 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 08:08:13,453 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 08:08:13,457 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:08:13,458 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:08:13,458 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:08:13,458 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:08:13,458 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:08:13,458 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:08:13,460 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 08:08:13,461 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 08:08:13,493 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 08:08:13,505 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 08:08:13,505 INFO L444 ModelExtractionUtils]: 32 out of 37 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 08:08:13,505 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 08:08:13,506 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 08:08:13,506 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 08:08:13,507 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_2, ULTIMATE.start_strlcpy_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_2 - 1*ULTIMATE.start_strlcpy_~s~0.offset Supporting invariants [] [2018-11-23 08:08:13,537 INFO L297 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2018-11-23 08:08:13,539 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 08:08:13,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:08:13,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:08:13,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:08:13,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:08:13,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:08:13,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:08:13,600 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-23 08:08:13,600 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 26 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-23 08:08:13,638 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 26 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 24 states and 30 transitions. Complement of second has 5 states. [2018-11-23 08:08:13,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 08:08:13,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 08:08:13,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2018-11-23 08:08:13,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 8 letters. Loop has 2 letters. [2018-11-23 08:08:13,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 08:08:13,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 10 letters. Loop has 2 letters. [2018-11-23 08:08:13,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 08:08:13,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 8 letters. Loop has 4 letters. [2018-11-23 08:08:13,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 08:08:13,640 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 30 transitions. [2018-11-23 08:08:13,641 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 08:08:13,641 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 20 states and 25 transitions. [2018-11-23 08:08:13,641 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-23 08:08:13,642 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-23 08:08:13,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 25 transitions. [2018-11-23 08:08:13,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 08:08:13,642 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2018-11-23 08:08:13,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 25 transitions. [2018-11-23 08:08:13,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2018-11-23 08:08:13,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 08:08:13,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2018-11-23 08:08:13,643 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-11-23 08:08:13,644 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-11-23 08:08:13,644 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 08:08:13,644 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2018-11-23 08:08:13,644 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 08:08:13,644 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 08:08:13,644 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 08:08:13,644 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:08:13,645 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 08:08:13,645 INFO L794 eck$LassoCheckResult]: Stem: 392#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 390#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet10;havoc main_#t~nondet10; 391#L530 assume !(main_~in_len~0 < 1);call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc11.base, main_#t~malloc11.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~nondet12;havoc main_#t~nondet12; 385#L534 assume !(main_~out_len~0 < 1);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;strlcpy_#in~dst.base, strlcpy_#in~dst.offset, strlcpy_#in~src.base, strlcpy_#in~src.offset, strlcpy_#in~siz := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset, main_~out_len~0;havoc strlcpy_#res;havoc strlcpy_#t~pre2, strlcpy_#t~short3, strlcpy_#t~post5.base, strlcpy_#t~post5.offset, strlcpy_#t~post6.base, strlcpy_#t~post6.offset, strlcpy_#t~mem7, strlcpy_#t~pre4, strlcpy_#t~post8.base, strlcpy_#t~post8.offset, strlcpy_#t~mem9, strlcpy_~dst.base, strlcpy_~dst.offset, strlcpy_~src.base, strlcpy_~src.offset, strlcpy_~siz, strlcpy_~d~0.base, strlcpy_~d~0.offset, strlcpy_~s~0.base, strlcpy_~s~0.offset, strlcpy_~n~0;strlcpy_~dst.base, strlcpy_~dst.offset := strlcpy_#in~dst.base, strlcpy_#in~dst.offset;strlcpy_~src.base, strlcpy_~src.offset := strlcpy_#in~src.base, strlcpy_#in~src.offset;strlcpy_~siz := strlcpy_#in~siz;strlcpy_~d~0.base, strlcpy_~d~0.offset := strlcpy_~dst.base, strlcpy_~dst.offset;strlcpy_~s~0.base, strlcpy_~s~0.offset := strlcpy_~src.base, strlcpy_~src.offset;strlcpy_~n~0 := strlcpy_~siz;strlcpy_#t~short3 := 0 != strlcpy_~n~0 % 4294967296; 382#L514 assume strlcpy_#t~short3;strlcpy_#t~pre2 := strlcpy_~n~0 - 1;strlcpy_~n~0 := strlcpy_~n~0 - 1;strlcpy_#t~short3 := 0 != strlcpy_#t~pre2 % 4294967296; 383#L514-2 assume !strlcpy_#t~short3;havoc strlcpy_#t~pre2;havoc strlcpy_#t~short3; 377#L514-3 assume 0 == strlcpy_~n~0 % 4294967296; 389#L521 assume 0 != strlcpy_~siz % 4294967296;call write~int(0, strlcpy_~d~0.base, strlcpy_~d~0.offset, 1); 387#L523-2 [2018-11-23 08:08:13,645 INFO L796 eck$LassoCheckResult]: Loop: 387#L523-2 strlcpy_#t~post8.base, strlcpy_#t~post8.offset := strlcpy_~s~0.base, strlcpy_~s~0.offset;strlcpy_~s~0.base, strlcpy_~s~0.offset := strlcpy_#t~post8.base, 1 + strlcpy_#t~post8.offset;call strlcpy_#t~mem9 := read~int(strlcpy_#t~post8.base, strlcpy_#t~post8.offset, 1); 386#L523 assume !!(0 != strlcpy_#t~mem9);havoc strlcpy_#t~post8.base, strlcpy_#t~post8.offset;havoc strlcpy_#t~mem9; 387#L523-2 [2018-11-23 08:08:13,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:08:13,645 INFO L82 PathProgramCache]: Analyzing trace with hash 179527910, now seen corresponding path program 1 times [2018-11-23 08:08:13,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:08:13,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:08:13,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:08:13,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:08:13,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:08:13,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:08:13,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:08:13,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:08:13,679 INFO L82 PathProgramCache]: Analyzing trace with hash 2758, now seen corresponding path program 3 times [2018-11-23 08:08:13,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:08:13,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:08:13,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:08:13,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:08:13,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:08:13,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:08:13,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:08:13,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:08:13,684 INFO L82 PathProgramCache]: Analyzing trace with hash 727631467, now seen corresponding path program 1 times [2018-11-23 08:08:13,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:08:13,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:08:13,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:08:13,685 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:08:13,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:08:13,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:08:13,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:08:13,977 WARN L180 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 108 [2018-11-23 08:08:14,052 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 08:08:14,052 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 08:08:14,052 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 08:08:14,052 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 08:08:14,052 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 08:08:14,052 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 08:08:14,052 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 08:08:14,052 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 08:08:14,053 INFO L131 ssoRankerPreferences]: Filename of dumped script: strlcpy_true-termination.c.i_Iteration4_Lasso [2018-11-23 08:08:14,053 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 08:08:14,053 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 08:08:14,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:08:14,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:08:14,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:08:14,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:08:14,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:08:14,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:08:14,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:08:14,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:08:14,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:08:14,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:08:14,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:08:14,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:08:14,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:08:14,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:08:14,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:08:14,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:08:14,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:08:14,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:08:14,249 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 77 [2018-11-23 08:08:14,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 08:08:14,572 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 08:08:14,572 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 08:08:14,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-11-23 08:08:14,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:08:14,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:08:14,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:08:14,573 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:08:14,573 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 08:08:14,573 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 08:08:14,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:08:14,574 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:08:14,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:08:14,574 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:08:14,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:08:14,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:08:14,575 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:08:14,575 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:08:14,575 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:08:14,575 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:08:14,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-11-23 08:08:14,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:08:14,576 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:08:14,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:08:14,576 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:08:14,576 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:08:14,576 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:08:14,576 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:08:14,577 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:08:14,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-11-23 08:08:14,587 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:08:14,587 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:08:14,587 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:08:14,587 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:08:14,587 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:08:14,587 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:08:14,587 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:08:14,587 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:08:14,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-11-23 08:08:14,588 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:08:14,588 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:08:14,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:08:14,588 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:08:14,588 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:08:14,588 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:08:14,588 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:08:14,589 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:08:14,589 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:08:14,589 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:08:14,589 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:08:14,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:08:14,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:08:14,589 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:08:14,590 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:08:14,590 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:08:14,590 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:08:14,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-11-23 08:08:14,591 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:08:14,591 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:08:14,591 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:08:14,591 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:08:14,591 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 08:08:14,591 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 08:08:14,592 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:08:14,593 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:08:14,593 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:08:14,593 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:08:14,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:08:14,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:08:14,593 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:08:14,594 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:08:14,594 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:08:14,594 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:08:14,594 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:08:14,595 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:08:14,595 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:08:14,595 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:08:14,595 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:08:14,595 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:08:14,595 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:08:14,595 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:08:14,596 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:08:14,596 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:08:14,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:08:14,596 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:08:14,597 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:08:14,597 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:08:14,597 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:08:14,597 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:08:14,597 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:08:14,597 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:08:14,598 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:08:14,598 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:08:14,598 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:08:14,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:08:14,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:08:14,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:08:14,599 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:08:14,599 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:08:14,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:08:14,599 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:08:14,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:08:14,600 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:08:14,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:08:14,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:08:14,600 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:08:14,600 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:08:14,600 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:08:14,601 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:08:14,601 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:08:14,601 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:08:14,601 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:08:14,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:08:14,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:08:14,602 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:08:14,602 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:08:14,602 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:08:14,602 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:08:14,603 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:08:14,603 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:08:14,603 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:08:14,603 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:08:14,603 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:08:14,604 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:08:14,604 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:08:14,604 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:08:14,604 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:08:14,605 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:08:14,605 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:08:14,605 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:08:14,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:08:14,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:08:14,605 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:08:14,605 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:08:14,606 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:08:14,606 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:08:14,606 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:08:14,606 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:08:14,607 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:08:14,607 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:08:14,607 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:08:14,607 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:08:14,607 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:08:14,607 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:08:14,607 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:08:14,608 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:08:14,608 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:08:14,608 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:08:14,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:08:14,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:08:14,608 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:08:14,609 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 08:08:14,609 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:08:14,609 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:08:14,609 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:08:14,610 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:08:14,610 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 08:08:14,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:08:14,610 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:08:14,611 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 08:08:14,611 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 08:08:14,617 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:08:14,617 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:08:14,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:08:14,617 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 08:08:14,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:08:14,618 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 08:08:14,618 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:08:14,618 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 08:08:14,618 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 08:08:14,619 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:08:14,620 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:08:14,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:08:14,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:08:14,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:08:14,620 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:08:14,621 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 08:08:14,621 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 08:08:14,624 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:08:14,625 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:08:14,625 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:08:14,625 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 08:08:14,625 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:08:14,626 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:08:14,626 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 08:08:14,627 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 08:08:14,631 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:08:14,646 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:08:14,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:08:14,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:08:14,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:08:14,647 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:08:14,648 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 08:08:14,648 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 08:08:14,649 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 08:08:14,650 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 08:08:14,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 08:08:14,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 08:08:14,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 08:08:14,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 08:08:14,652 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 08:08:14,652 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 08:08:14,668 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 08:08:14,687 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-23 08:08:14,687 INFO L444 ModelExtractionUtils]: 40 out of 46 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-23 08:08:14,688 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 08:08:14,688 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 08:08:14,689 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 08:08:14,689 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strlcpy_~s~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_3) = -1*ULTIMATE.start_strlcpy_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_3 Supporting invariants [] [2018-11-23 08:08:14,719 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-11-23 08:08:14,721 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 08:08:14,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:08:14,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:08:14,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:08:14,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:08:14,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:08:14,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:08:14,778 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-23 08:08:14,778 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-11-23 08:08:14,796 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 19 states and 23 transitions. Complement of second has 5 states. [2018-11-23 08:08:14,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 08:08:14,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 08:08:14,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2018-11-23 08:08:14,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 8 letters. Loop has 2 letters. [2018-11-23 08:08:14,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 08:08:14,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 10 letters. Loop has 2 letters. [2018-11-23 08:08:14,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 08:08:14,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 8 letters. Loop has 4 letters. [2018-11-23 08:08:14,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 08:08:14,798 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 23 transitions. [2018-11-23 08:08:14,799 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 08:08:14,799 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 0 states and 0 transitions. [2018-11-23 08:08:14,799 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 08:08:14,799 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 08:08:14,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 08:08:14,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 08:08:14,799 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 08:08:14,799 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 08:08:14,799 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 08:08:14,799 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 08:08:14,800 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 08:08:14,800 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 08:08:14,800 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 08:08:14,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 08:08:14 BoogieIcfgContainer [2018-11-23 08:08:14,805 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 08:08:14,805 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 08:08:14,805 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 08:08:14,805 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 08:08:14,806 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:08:09" (3/4) ... [2018-11-23 08:08:14,808 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 08:08:14,808 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 08:08:14,809 INFO L168 Benchmark]: Toolchain (without parser) took 5912.30 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 252.7 MB). Free memory was 955.5 MB in the beginning and 1.2 GB in the end (delta: -264.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 08:08:14,810 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 08:08:14,810 INFO L168 Benchmark]: CACSL2BoogieTranslator took 339.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 955.5 MB in the beginning and 1.1 GB in the end (delta: -161.1 MB). Peak memory consumption was 26.7 MB. Max. memory is 11.5 GB. [2018-11-23 08:08:14,811 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 08:08:14,811 INFO L168 Benchmark]: Boogie Preprocessor took 20.78 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 08:08:14,812 INFO L168 Benchmark]: RCFGBuilder took 223.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2018-11-23 08:08:14,812 INFO L168 Benchmark]: BuchiAutomizer took 5295.44 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 124.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -131.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 08:08:14,812 INFO L168 Benchmark]: Witness Printer took 3.33 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 08:08:14,815 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 339.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 955.5 MB in the beginning and 1.1 GB in the end (delta: -161.1 MB). Peak memory consumption was 26.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.78 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 223.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5295.44 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 124.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -131.0 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 3.33 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - 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 4 terminating modules (1 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[__builtin_alloca (in_len)] and consists of 6 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (out_len)] + -1 * s and consists of 4 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[__builtin_alloca (out_len)] and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.2s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 4.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 19 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 20 states and ocurred in iteration 2. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 74 SDtfs, 112 SDslu, 40 SDs, 0 SdLazy, 55 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital206 mio100 ax100 hnf99 lsp97 ukn85 mio100 lsp48 div173 bol100 ite100 ukn100 eq175 hnf68 smp95 dnf100 smp100 tf100 neg99 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 18ms 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...