./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-libowfat/strlcpy_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0a4574dc-9604-47ed-988f-b43826d41284/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0a4574dc-9604-47ed-988f-b43826d41284/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0a4574dc-9604-47ed-988f-b43826d41284/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0a4574dc-9604-47ed-988f-b43826d41284/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_0a4574dc-9604-47ed-988f-b43826d41284/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0a4574dc-9604-47ed-988f-b43826d41284/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-5842f4b [2018-11-18 16:16:19,874 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 16:16:19,875 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 16:16:19,883 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 16:16:19,883 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 16:16:19,884 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 16:16:19,884 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 16:16:19,886 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 16:16:19,887 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 16:16:19,887 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 16:16:19,888 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 16:16:19,888 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 16:16:19,888 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 16:16:19,889 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 16:16:19,890 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 16:16:19,890 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 16:16:19,891 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 16:16:19,893 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 16:16:19,894 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 16:16:19,895 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 16:16:19,896 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 16:16:19,897 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 16:16:19,898 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 16:16:19,898 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 16:16:19,899 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 16:16:19,899 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 16:16:19,900 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 16:16:19,901 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 16:16:19,901 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 16:16:19,902 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 16:16:19,902 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 16:16:19,903 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 16:16:19,903 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 16:16:19,903 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 16:16:19,904 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 16:16:19,905 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 16:16:19,905 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0a4574dc-9604-47ed-988f-b43826d41284/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-18 16:16:19,915 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 16:16:19,915 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 16:16:19,916 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 16:16:19,916 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 16:16:19,916 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 16:16:19,917 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 16:16:19,917 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 16:16:19,917 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 16:16:19,917 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 16:16:19,917 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 16:16:19,917 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 16:16:19,917 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 16:16:19,917 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 16:16:19,918 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 16:16:19,918 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 16:16:19,918 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 16:16:19,918 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 16:16:19,918 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 16:16:19,918 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 16:16:19,918 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 16:16:19,919 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 16:16:19,919 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 16:16:19,919 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 16:16:19,919 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 16:16:19,919 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 16:16:19,919 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 16:16:19,919 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 16:16:19,919 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 16:16:19,922 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 16:16:19,923 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_0a4574dc-9604-47ed-988f-b43826d41284/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-18 16:16:19,949 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 16:16:19,956 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 16:16:19,958 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 16:16:19,959 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 16:16:19,959 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 16:16:19,959 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0a4574dc-9604-47ed-988f-b43826d41284/bin-2019/uautomizer/../../sv-benchmarks/c/termination-libowfat/strlcpy_true-termination.c.i [2018-11-18 16:16:19,993 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0a4574dc-9604-47ed-988f-b43826d41284/bin-2019/uautomizer/data/f1306d7a8/78bc08db12724f439ff3a49ea9902b25/FLAGa3d443643 [2018-11-18 16:16:20,431 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 16:16:20,432 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0a4574dc-9604-47ed-988f-b43826d41284/sv-benchmarks/c/termination-libowfat/strlcpy_true-termination.c.i [2018-11-18 16:16:20,441 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0a4574dc-9604-47ed-988f-b43826d41284/bin-2019/uautomizer/data/f1306d7a8/78bc08db12724f439ff3a49ea9902b25/FLAGa3d443643 [2018-11-18 16:16:20,450 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0a4574dc-9604-47ed-988f-b43826d41284/bin-2019/uautomizer/data/f1306d7a8/78bc08db12724f439ff3a49ea9902b25 [2018-11-18 16:16:20,452 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 16:16:20,453 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 16:16:20,454 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 16:16:20,454 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 16:16:20,457 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 16:16:20,458 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:16:20" (1/1) ... [2018-11-18 16:16:20,459 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d6e462a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:16:20, skipping insertion in model container [2018-11-18 16:16:20,459 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:16:20" (1/1) ... [2018-11-18 16:16:20,466 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 16:16:20,490 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 16:16:20,671 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:16:20,678 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 16:16:20,748 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:16:20,778 INFO L195 MainTranslator]: Completed translation [2018-11-18 16:16:20,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:16:20 WrapperNode [2018-11-18 16:16:20,779 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 16:16:20,779 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 16:16:20,779 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 16:16:20,779 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 16:16:20,785 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:16:20" (1/1) ... [2018-11-18 16:16:20,794 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:16:20" (1/1) ... [2018-11-18 16:16:20,808 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 16:16:20,808 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 16:16:20,809 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 16:16:20,809 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 16:16:20,814 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:16:20" (1/1) ... [2018-11-18 16:16:20,814 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:16:20" (1/1) ... [2018-11-18 16:16:20,816 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:16:20" (1/1) ... [2018-11-18 16:16:20,816 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:16:20" (1/1) ... [2018-11-18 16:16:20,820 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:16:20" (1/1) ... [2018-11-18 16:16:20,823 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:16:20" (1/1) ... [2018-11-18 16:16:20,824 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:16:20" (1/1) ... [2018-11-18 16:16:20,825 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 16:16:20,826 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 16:16:20,826 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 16:16:20,826 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 16:16:20,826 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:16:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a4574dc-9604-47ed-988f-b43826d41284/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-18 16:16:20,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 16:16:20,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 16:16:20,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 16:16:20,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 16:16:20,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 16:16:20,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 16:16:21,095 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 16:16:21,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:16:21 BoogieIcfgContainer [2018-11-18 16:16:21,095 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 16:16:21,096 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 16:16:21,096 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 16:16:21,098 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 16:16:21,099 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 16:16:21,099 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 04:16:20" (1/3) ... [2018-11-18 16:16:21,100 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@e71095b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 04:16:21, skipping insertion in model container [2018-11-18 16:16:21,100 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 16:16:21,100 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:16:20" (2/3) ... [2018-11-18 16:16:21,100 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@e71095b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 04:16:21, skipping insertion in model container [2018-11-18 16:16:21,100 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 16:16:21,100 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:16:21" (3/3) ... [2018-11-18 16:16:21,101 INFO L375 chiAutomizerObserver]: Analyzing ICFG strlcpy_true-termination.c.i [2018-11-18 16:16:21,134 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 16:16:21,135 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 16:16:21,135 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 16:16:21,135 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 16:16:21,135 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 16:16:21,135 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 16:16:21,135 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 16:16:21,135 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 16:16:21,135 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 16:16:21,143 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2018-11-18 16:16:21,158 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-18 16:16:21,159 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:16:21,159 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:16:21,163 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-18 16:16:21,163 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 16:16:21,163 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 16:16:21,163 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2018-11-18 16:16:21,164 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-18 16:16:21,164 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:16:21,164 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:16:21,165 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-18 16:16:21,165 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 16:16:21,170 INFO L794 eck$LassoCheckResult]: Stem: 17#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 15#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet10, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet10;havoc main_#t~nondet10; 20#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;assume { :begin_inline_strlcpy } true;strlcpy_#in~dst.base, strlcpy_#in~dst.offset, strlcpy_#in~src.base, strlcpy_#in~src.offset, strlcpy_#in~siz := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset, main_~out_len~0;havoc strlcpy_#res;havoc strlcpy_#t~pre2, strlcpy_#t~short3, strlcpy_#t~post5.base, strlcpy_#t~post5.offset, strlcpy_#t~post6.base, strlcpy_#t~post6.offset, strlcpy_#t~mem7, strlcpy_#t~pre4, strlcpy_#t~post8.base, strlcpy_#t~post8.offset, strlcpy_#t~mem9, strlcpy_~dst.base, strlcpy_~dst.offset, strlcpy_~src.base, strlcpy_~src.offset, strlcpy_~siz, strlcpy_~d~0.base, strlcpy_~d~0.offset, strlcpy_~s~0.base, strlcpy_~s~0.offset, strlcpy_~n~0;strlcpy_~dst.base, strlcpy_~dst.offset := strlcpy_#in~dst.base, strlcpy_#in~dst.offset;strlcpy_~src.base, strlcpy_~src.offset := strlcpy_#in~src.base, strlcpy_#in~src.offset;strlcpy_~siz := strlcpy_#in~siz;strlcpy_~d~0.base, strlcpy_~d~0.offset := strlcpy_~dst.base, strlcpy_~dst.offset;strlcpy_~s~0.base, strlcpy_~s~0.offset := strlcpy_~src.base, strlcpy_~src.offset;strlcpy_~n~0 := strlcpy_~siz;strlcpy_#t~short3 := 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; 13#L515-4true [2018-11-18 16:16:21,170 INFO L796 eck$LassoCheckResult]: Loop: 13#L515-4true assume true;strlcpy_#t~post5.base, strlcpy_#t~post5.offset := strlcpy_~d~0.base, strlcpy_~d~0.offset;strlcpy_~d~0.base, strlcpy_~d~0.offset := strlcpy_#t~post5.base, 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; 13#L515-4true [2018-11-18 16:16:21,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:16:21,174 INFO L82 PathProgramCache]: Analyzing trace with hash 889571278, now seen corresponding path program 1 times [2018-11-18 16:16:21,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:16:21,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:16:21,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:16:21,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:16:21,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:16:21,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:16:21,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:16:21,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:16:21,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1698155, now seen corresponding path program 1 times [2018-11-18 16:16:21,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:16:21,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:16:21,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:16:21,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:16:21,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:16:21,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:16:21,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:16:21,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:16:21,311 INFO L82 PathProgramCache]: Analyzing trace with hash 707592888, now seen corresponding path program 1 times [2018-11-18 16:16:21,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:16:21,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:16:21,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:16:21,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:16:21,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:16:21,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:16:21,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:16:21,804 WARN L180 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 106 [2018-11-18 16:16:21,920 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 16:16:21,921 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 16:16:21,921 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 16:16:21,921 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 16:16:21,921 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 16:16:21,921 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:16:21,922 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 16:16:21,922 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 16:16:21,922 INFO L131 ssoRankerPreferences]: Filename of dumped script: strlcpy_true-termination.c.i_Iteration1_Lasso [2018-11-18 16:16:21,922 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 16:16:21,922 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 16:16:21,940 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-18 16:16:21,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:16:21,954 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-18 16:16:21,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:16:21,960 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-18 16:16:21,962 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-18 16:16:21,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:16:21,965 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-18 16:16:21,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:16:21,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:16:21,970 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-18 16:16:21,972 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-18 16:16:21,974 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-18 16:16:21,975 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-18 16:16:21,976 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-18 16:16:21,978 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-18 16:16:21,979 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-18 16:16:22,207 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 86 [2018-11-18 16:16:22,357 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2018-11-18 16:16:22,358 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-18 16:16:22,359 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-18 16:16:22,730 WARN L180 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 81 [2018-11-18 16:16:23,012 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 16:16:23,016 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 16:16:23,018 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:16:23,019 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:16:23,019 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:16:23,020 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:16:23,020 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:16:23,020 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:16:23,022 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:16:23,022 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:16:23,024 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:16:23,025 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-18 16:16:23,025 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:16:23,025 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:16:23,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:16:23,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:16:23,028 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:16:23,028 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:16:23,029 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:16:23,029 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:16:23,030 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-18 16:16:23,030 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:16:23,030 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:16:23,030 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:16:23,030 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:16:23,031 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:16:23,031 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:16:23,031 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:16:23,032 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:16:23,032 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:16:23,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:16:23,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:16:23,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:16:23,033 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:16:23,035 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:16:23,035 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:16:23,038 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:16:23,039 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-18 16:16:23,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:16:23,040 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:16:23,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:16:23,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:16:23,040 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:16:23,041 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:16:23,041 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:16:23,042 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:16:23,042 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-18 16:16:23,042 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:16:23,042 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:16:23,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:16:23,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:16:23,043 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:16:23,043 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:16:23,043 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:16:23,046 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:16:23,046 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:16:23,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:16:23,047 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:16:23,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:16:23,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:16:23,047 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:16:23,047 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:16:23,048 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:16:23,048 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:16:23,048 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-18 16:16:23,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:16:23,049 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:16:23,049 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:16:23,049 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:16:23,050 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:16:23,051 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:16:23,053 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:16:23,053 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-18 16:16:23,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:16:23,054 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:16:23,054 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:16:23,054 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:16:23,054 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:16:23,054 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:16:23,054 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:16:23,055 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:16:23,055 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-18 16:16:23,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:16:23,056 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:16:23,056 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:16:23,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:16:23,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:16:23,056 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:16:23,057 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:16:23,057 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:16:23,057 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:16:23,058 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:16:23,058 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:16:23,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:16:23,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:16:23,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:16:23,059 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:16:23,059 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:16:23,059 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:16:23,060 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:16:23,060 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:16:23,060 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:16:23,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:16:23,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:16:23,061 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:16:23,061 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:16:23,061 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:16:23,062 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:16:23,062 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-18 16:16:23,062 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:16:23,062 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:16:23,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:16:23,063 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:16:23,063 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:16:23,063 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:16:23,063 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:16:23,064 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:16:23,064 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:16:23,064 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:16:23,064 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:16:23,065 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:16:23,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:16:23,065 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:16:23,065 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:16:23,065 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:16:23,066 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:16:23,066 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:16:23,066 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:16:23,066 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:16:23,067 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:16:23,067 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:16:23,067 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:16:23,067 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:16:23,067 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:16:23,067 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:16:23,068 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-18 16:16:23,068 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:16:23,068 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:16:23,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:16:23,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:16:23,068 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:16:23,069 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:16:23,069 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:16:23,070 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:16:23,071 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:16:23,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:16:23,071 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:16:23,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:16:23,071 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:16:23,071 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:16:23,072 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:16:23,072 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:16:23,074 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:16:23,075 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-18 16:16:23,075 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:16:23,075 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 16:16:23,075 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:16:23,075 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:16:23,078 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 16:16:23,078 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:16:23,092 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:16:23,093 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-18 16:16:23,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:16:23,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:16:23,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:16:23,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:16:23,101 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:16:23,101 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:16:23,164 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 16:16:23,214 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 16:16:23,214 INFO L444 ModelExtractionUtils]: 57 out of 61 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 16:16:23,216 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 16:16:23,217 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 16:16:23,217 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 16:16:23,218 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_1, ULTIMATE.start_strlcpy_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_1 - 1*ULTIMATE.start_strlcpy_~s~0.offset Supporting invariants [] [2018-11-18 16:16:23,261 INFO L297 tatePredicateManager]: 11 out of 13 supporting invariants were superfluous and have been removed [2018-11-18 16:16:23,270 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 16:16:23,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:16:23,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:16:23,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:16:23,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:16:23,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:16:23,385 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-18 16:16:23,394 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-18 16:16:23,395 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states. Second operand 5 states. [2018-11-18 16:16:23,497 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states.. Second operand 5 states. Result 60 states and 82 transitions. Complement of second has 8 states. [2018-11-18 16:16:23,497 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-18 16:16:23,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 16:16:23,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2018-11-18 16:16:23,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 57 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-18 16:16:23,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:16:23,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 57 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-18 16:16:23,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:16:23,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 57 transitions. Stem has 6 letters. Loop has 8 letters. [2018-11-18 16:16:23,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:16:23,503 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 82 transitions. [2018-11-18 16:16:23,506 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-18 16:16:23,510 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 28 states and 34 transitions. [2018-11-18 16:16:23,511 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-18 16:16:23,511 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-18 16:16:23,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 34 transitions. [2018-11-18 16:16:23,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 16:16:23,512 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2018-11-18 16:16:23,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 34 transitions. [2018-11-18 16:16:23,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 18. [2018-11-18 16:16:23,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-18 16:16:23,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2018-11-18 16:16:23,534 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2018-11-18 16:16:23,534 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2018-11-18 16:16:23,534 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 16:16:23,534 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 23 transitions. [2018-11-18 16:16:23,535 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 16:16:23,535 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:16:23,535 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:16:23,535 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:16:23,536 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 16:16:23,536 INFO L794 eck$LassoCheckResult]: Stem: 216#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 214#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet10, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet10;havoc main_#t~nondet10; 215#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; 208#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;assume { :begin_inline_strlcpy } true;strlcpy_#in~dst.base, strlcpy_#in~dst.offset, strlcpy_#in~src.base, strlcpy_#in~src.offset, strlcpy_#in~siz := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset, main_~out_len~0;havoc strlcpy_#res;havoc strlcpy_#t~pre2, strlcpy_#t~short3, strlcpy_#t~post5.base, strlcpy_#t~post5.offset, strlcpy_#t~post6.base, strlcpy_#t~post6.offset, strlcpy_#t~mem7, strlcpy_#t~pre4, strlcpy_#t~post8.base, strlcpy_#t~post8.offset, strlcpy_#t~mem9, strlcpy_~dst.base, strlcpy_~dst.offset, strlcpy_~src.base, strlcpy_~src.offset, strlcpy_~siz, strlcpy_~d~0.base, strlcpy_~d~0.offset, strlcpy_~s~0.base, strlcpy_~s~0.offset, strlcpy_~n~0;strlcpy_~dst.base, strlcpy_~dst.offset := strlcpy_#in~dst.base, strlcpy_#in~dst.offset;strlcpy_~src.base, strlcpy_~src.offset := strlcpy_#in~src.base, strlcpy_#in~src.offset;strlcpy_~siz := strlcpy_#in~siz;strlcpy_~d~0.base, strlcpy_~d~0.offset := strlcpy_~dst.base, strlcpy_~dst.offset;strlcpy_~s~0.base, strlcpy_~s~0.offset := strlcpy_~src.base, strlcpy_~src.offset;strlcpy_~n~0 := strlcpy_~siz;strlcpy_#t~short3 := 0 != strlcpy_~n~0 % 4294967296; 203#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; 204#L514-2 assume !strlcpy_#t~short3;havoc strlcpy_#t~pre2;havoc strlcpy_#t~short3; 200#L514-3 assume 0 == strlcpy_~n~0 % 4294967296; 213#L521 assume !(0 != strlcpy_~siz % 4294967296); 212#L523-3 [2018-11-18 16:16:23,536 INFO L796 eck$LassoCheckResult]: Loop: 212#L523-3 assume true; 209#L523 strlcpy_#t~post8.base, strlcpy_#t~post8.offset := strlcpy_~s~0.base, strlcpy_~s~0.offset;strlcpy_~s~0.base, strlcpy_~s~0.offset := strlcpy_#t~post8.base, 1 + strlcpy_#t~post8.offset;call strlcpy_#t~mem9 := read~int(strlcpy_#t~post8.base, strlcpy_#t~post8.offset, 1); 210#L523-1 assume !!(0 != strlcpy_#t~mem9);havoc strlcpy_#t~post8.base, strlcpy_#t~post8.offset;havoc strlcpy_#t~mem9; 212#L523-3 [2018-11-18 16:16:23,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:16:23,536 INFO L82 PathProgramCache]: Analyzing trace with hash 179527912, now seen corresponding path program 1 times [2018-11-18 16:16:23,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:16:23,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:16:23,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:16:23,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:16:23,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:16:23,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:16:23,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:16:23,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:16:23,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:16:23,622 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 16:16:23,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:16:23,622 INFO L82 PathProgramCache]: Analyzing trace with hash 84475, now seen corresponding path program 1 times [2018-11-18 16:16:23,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:16:23,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:16:23,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:16:23,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:16:23,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:16:23,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:16:23,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:16:23,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 16:16:23,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 16:16:23,655 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-11-18 16:16:23,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:16:23,713 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2018-11-18 16:16:23,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 16:16:23,714 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 40 transitions. [2018-11-18 16:16:23,715 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-18 16:16:23,716 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 40 transitions. [2018-11-18 16:16:23,716 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-11-18 16:16:23,716 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-11-18 16:16:23,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 40 transitions. [2018-11-18 16:16:23,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 16:16:23,716 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 40 transitions. [2018-11-18 16:16:23,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 40 transitions. [2018-11-18 16:16:23,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 21. [2018-11-18 16:16:23,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-18 16:16:23,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2018-11-18 16:16:23,718 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2018-11-18 16:16:23,718 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2018-11-18 16:16:23,718 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 16:16:23,719 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2018-11-18 16:16:23,719 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 16:16:23,719 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:16:23,719 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:16:23,721 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:16:23,721 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 16:16:23,721 INFO L794 eck$LassoCheckResult]: Stem: 276#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 274#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet10, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet10;havoc main_#t~nondet10; 275#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; 268#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;assume { :begin_inline_strlcpy } true;strlcpy_#in~dst.base, strlcpy_#in~dst.offset, strlcpy_#in~src.base, strlcpy_#in~src.offset, strlcpy_#in~siz := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset, main_~out_len~0;havoc strlcpy_#res;havoc strlcpy_#t~pre2, strlcpy_#t~short3, strlcpy_#t~post5.base, strlcpy_#t~post5.offset, strlcpy_#t~post6.base, strlcpy_#t~post6.offset, strlcpy_#t~mem7, strlcpy_#t~pre4, strlcpy_#t~post8.base, strlcpy_#t~post8.offset, strlcpy_#t~mem9, strlcpy_~dst.base, strlcpy_~dst.offset, strlcpy_~src.base, strlcpy_~src.offset, strlcpy_~siz, strlcpy_~d~0.base, strlcpy_~d~0.offset, strlcpy_~s~0.base, strlcpy_~s~0.offset, strlcpy_~n~0;strlcpy_~dst.base, strlcpy_~dst.offset := strlcpy_#in~dst.base, strlcpy_#in~dst.offset;strlcpy_~src.base, strlcpy_~src.offset := strlcpy_#in~src.base, strlcpy_#in~src.offset;strlcpy_~siz := strlcpy_#in~siz;strlcpy_~d~0.base, strlcpy_~d~0.offset := strlcpy_~dst.base, strlcpy_~dst.offset;strlcpy_~s~0.base, strlcpy_~s~0.offset := strlcpy_~src.base, strlcpy_~src.offset;strlcpy_~n~0 := strlcpy_~siz;strlcpy_#t~short3 := 0 != strlcpy_~n~0 % 4294967296; 264#L514 assume !strlcpy_#t~short3; 265#L514-2 assume !strlcpy_#t~short3;havoc strlcpy_#t~pre2;havoc strlcpy_#t~short3; 278#L514-3 assume 0 == strlcpy_~n~0 % 4294967296; 277#L521 assume !(0 != strlcpy_~siz % 4294967296); 272#L523-3 [2018-11-18 16:16:23,721 INFO L796 eck$LassoCheckResult]: Loop: 272#L523-3 assume true; 269#L523 strlcpy_#t~post8.base, strlcpy_#t~post8.offset := strlcpy_~s~0.base, strlcpy_~s~0.offset;strlcpy_~s~0.base, strlcpy_~s~0.offset := strlcpy_#t~post8.base, 1 + strlcpy_#t~post8.offset;call strlcpy_#t~mem9 := read~int(strlcpy_#t~post8.base, strlcpy_#t~post8.offset, 1); 270#L523-1 assume !!(0 != strlcpy_#t~mem9);havoc strlcpy_#t~post8.base, strlcpy_#t~post8.offset;havoc strlcpy_#t~mem9; 272#L523-3 [2018-11-18 16:16:23,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:16:23,721 INFO L82 PathProgramCache]: Analyzing trace with hash 179587494, now seen corresponding path program 1 times [2018-11-18 16:16:23,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:16:23,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:16:23,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:16:23,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:16:23,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:16:23,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:16:23,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:16:23,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:16:23,734 INFO L82 PathProgramCache]: Analyzing trace with hash 84475, now seen corresponding path program 2 times [2018-11-18 16:16:23,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:16:23,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:16:23,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:16:23,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:16:23,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:16:23,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:16:23,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:16:23,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:16:23,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1438162378, now seen corresponding path program 1 times [2018-11-18 16:16:23,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:16:23,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:16:23,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:16:23,740 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:16:23,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:16:23,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:16:23,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:16:23,982 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 97 [2018-11-18 16:16:24,053 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 16:16:24,053 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 16:16:24,053 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 16:16:24,053 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 16:16:24,053 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 16:16:24,053 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:16:24,054 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 16:16:24,054 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 16:16:24,054 INFO L131 ssoRankerPreferences]: Filename of dumped script: strlcpy_true-termination.c.i_Iteration3_Lasso [2018-11-18 16:16:24,054 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 16:16:24,054 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 16:16:24,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-18 16:16:24,061 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-18 16:16:24,063 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-18 16:16:24,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-18 16:16:24,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-18 16:16:24,067 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-18 16:16:24,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-18 16:16:24,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-18 16:16:24,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-18 16:16:24,208 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 75 [2018-11-18 16:16:24,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:16:24,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:16:24,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:16:24,236 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-18 16:16:24,237 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-18 16:16:24,238 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-18 16:16:24,239 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-18 16:16:24,240 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-18 16:16:24,241 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-18 16:16:24,242 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-18 16:16:24,554 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 16:16:24,554 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 16:16:24,554 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:16:24,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:16:24,555 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:16:24,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:16:24,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:16:24,555 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:16:24,555 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:16:24,556 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:16:24,558 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:16:24,558 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-18 16:16:24,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:16:24,559 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:16:24,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:16:24,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:16:24,559 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:16:24,559 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:16:24,559 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:16:24,562 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:16:24,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-18 16:16:24,563 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:16:24,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:16:24,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:16:24,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:16:24,564 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:16:24,564 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:16:24,565 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:16:24,566 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:16:24,566 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:16:24,566 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:16:24,566 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:16:24,566 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:16:24,566 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:16:24,567 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:16:24,567 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:16:24,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:16:24,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-18 16:16:24,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:16:24,568 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:16:24,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:16:24,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:16:24,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:16:24,568 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:16:24,569 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:16:24,569 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:16:24,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-18 16:16:24,569 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:16:24,570 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:16:24,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:16:24,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:16:24,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:16:24,570 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:16:24,570 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:16:24,570 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:16:24,571 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-18 16:16:24,571 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:16:24,571 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:16:24,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:16:24,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:16:24,571 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:16:24,572 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:16:24,572 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:16:24,572 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:16:24,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-18 16:16:24,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:16:24,573 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:16:24,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:16:24,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:16:24,573 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:16:24,573 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:16:24,574 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:16:24,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:16:24,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-18 16:16:24,575 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:16:24,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:16:24,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:16:24,575 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:16:24,576 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:16:24,576 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:16:24,577 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:16:24,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-18 16:16:24,577 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:16:24,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:16:24,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:16:24,578 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:16:24,579 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:16:24,579 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:16:24,583 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:16:24,584 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:16:24,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:16:24,584 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:16:24,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:16:24,585 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:16:24,585 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:16:24,587 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:16:24,587 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:16:24,589 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:16:24,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-18 16:16:24,589 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:16:24,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:16:24,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:16:24,589 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:16:24,590 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:16:24,590 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:16:24,594 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:16:24,595 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:16:24,595 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:16:24,595 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:16:24,595 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:16:24,595 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:16:24,596 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:16:24,596 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:16:24,597 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:16:24,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-18 16:16:24,598 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:16:24,598 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 16:16:24,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:16:24,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:16:24,600 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 16:16:24,600 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:16:24,608 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:16:24,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-18 16:16:24,609 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:16:24,609 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:16:24,609 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:16:24,609 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:16:24,610 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:16:24,611 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:16:24,614 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:16:24,614 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-18 16:16:24,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:16:24,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:16:24,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:16:24,615 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:16:24,617 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:16:24,617 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:16:24,629 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 16:16:24,639 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 16:16:24,639 INFO L444 ModelExtractionUtils]: 32 out of 37 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-18 16:16:24,639 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 16:16:24,641 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 16:16:24,641 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 16:16:24,641 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-18 16:16:24,670 INFO L297 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2018-11-18 16:16:24,672 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 16:16:24,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:16:24,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:16:24,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:16:24,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:16:24,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:16:24,736 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-18 16:16:24,736 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-18 16:16:24,736 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 27 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-11-18 16:16:24,771 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 27 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 28 states and 34 transitions. Complement of second has 5 states. [2018-11-18 16:16:24,772 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-18 16:16:24,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 16:16:24,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2018-11-18 16:16:24,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 8 letters. Loop has 3 letters. [2018-11-18 16:16:24,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:16:24,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 11 letters. Loop has 3 letters. [2018-11-18 16:16:24,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:16:24,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 8 letters. Loop has 6 letters. [2018-11-18 16:16:24,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:16:24,774 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 34 transitions. [2018-11-18 16:16:24,774 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 16:16:24,775 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 21 states and 26 transitions. [2018-11-18 16:16:24,775 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-18 16:16:24,775 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-18 16:16:24,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 26 transitions. [2018-11-18 16:16:24,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 16:16:24,775 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2018-11-18 16:16:24,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 26 transitions. [2018-11-18 16:16:24,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2018-11-18 16:16:24,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-18 16:16:24,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2018-11-18 16:16:24,778 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2018-11-18 16:16:24,778 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2018-11-18 16:16:24,778 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 16:16:24,778 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 22 transitions. [2018-11-18 16:16:24,779 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 16:16:24,779 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:16:24,779 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:16:24,779 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:16:24,779 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 16:16:24,779 INFO L794 eck$LassoCheckResult]: Stem: 412#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 410#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet10, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet10;havoc main_#t~nondet10; 411#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; 404#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;assume { :begin_inline_strlcpy } true;strlcpy_#in~dst.base, strlcpy_#in~dst.offset, strlcpy_#in~src.base, strlcpy_#in~src.offset, strlcpy_#in~siz := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset, main_~out_len~0;havoc strlcpy_#res;havoc strlcpy_#t~pre2, strlcpy_#t~short3, strlcpy_#t~post5.base, strlcpy_#t~post5.offset, strlcpy_#t~post6.base, strlcpy_#t~post6.offset, strlcpy_#t~mem7, strlcpy_#t~pre4, strlcpy_#t~post8.base, strlcpy_#t~post8.offset, strlcpy_#t~mem9, strlcpy_~dst.base, strlcpy_~dst.offset, strlcpy_~src.base, strlcpy_~src.offset, strlcpy_~siz, strlcpy_~d~0.base, strlcpy_~d~0.offset, strlcpy_~s~0.base, strlcpy_~s~0.offset, strlcpy_~n~0;strlcpy_~dst.base, strlcpy_~dst.offset := strlcpy_#in~dst.base, strlcpy_#in~dst.offset;strlcpy_~src.base, strlcpy_~src.offset := strlcpy_#in~src.base, strlcpy_#in~src.offset;strlcpy_~siz := strlcpy_#in~siz;strlcpy_~d~0.base, strlcpy_~d~0.offset := strlcpy_~dst.base, strlcpy_~dst.offset;strlcpy_~s~0.base, strlcpy_~s~0.offset := strlcpy_~src.base, strlcpy_~src.offset;strlcpy_~n~0 := strlcpy_~siz;strlcpy_#t~short3 := 0 != strlcpy_~n~0 % 4294967296; 399#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; 400#L514-2 assume !strlcpy_#t~short3;havoc strlcpy_#t~pre2;havoc strlcpy_#t~short3; 396#L514-3 assume 0 == strlcpy_~n~0 % 4294967296; 409#L521 assume 0 != strlcpy_~siz % 4294967296;call write~int(0, strlcpy_~d~0.base, strlcpy_~d~0.offset, 1); 408#L523-3 [2018-11-18 16:16:24,779 INFO L796 eck$LassoCheckResult]: Loop: 408#L523-3 assume true; 405#L523 strlcpy_#t~post8.base, strlcpy_#t~post8.offset := strlcpy_~s~0.base, strlcpy_~s~0.offset;strlcpy_~s~0.base, strlcpy_~s~0.offset := strlcpy_#t~post8.base, 1 + strlcpy_#t~post8.offset;call strlcpy_#t~mem9 := read~int(strlcpy_#t~post8.base, strlcpy_#t~post8.offset, 1); 406#L523-1 assume !!(0 != strlcpy_#t~mem9);havoc strlcpy_#t~post8.base, strlcpy_#t~post8.offset;havoc strlcpy_#t~mem9; 408#L523-3 [2018-11-18 16:16:24,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:16:24,780 INFO L82 PathProgramCache]: Analyzing trace with hash 179527910, now seen corresponding path program 1 times [2018-11-18 16:16:24,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:16:24,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:16:24,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:16:24,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:16:24,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:16:24,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:16:24,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:16:24,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:16:24,795 INFO L82 PathProgramCache]: Analyzing trace with hash 84475, now seen corresponding path program 3 times [2018-11-18 16:16:24,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:16:24,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:16:24,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:16:24,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:16:24,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:16:24,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:16:24,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:16:24,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:16:24,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1081737974, now seen corresponding path program 1 times [2018-11-18 16:16:24,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:16:24,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:16:24,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:16:24,799 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:16:24,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:16:24,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:16:24,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:16:25,089 WARN L180 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 108 [2018-11-18 16:16:25,180 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 16:16:25,180 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 16:16:25,180 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 16:16:25,180 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 16:16:25,180 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 16:16:25,180 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:16:25,180 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 16:16:25,180 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 16:16:25,181 INFO L131 ssoRankerPreferences]: Filename of dumped script: strlcpy_true-termination.c.i_Iteration4_Lasso [2018-11-18 16:16:25,181 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 16:16:25,181 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 16:16:25,183 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-18 16:16:25,189 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-18 16:16:25,190 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-18 16:16:25,192 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-18 16:16:25,193 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-18 16:16:25,195 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-18 16:16:25,197 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-18 16:16:25,199 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-18 16:16:25,201 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-18 16:16:25,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:16:25,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:16:25,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:16:25,208 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-18 16:16:25,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:16:25,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:16:25,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:16:25,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:16:25,218 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-18 16:16:25,388 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-18 16:16:25,689 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 16:16:25,689 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 16:16:25,690 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-18 16:16:25,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:16:25,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:16:25,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:16:25,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:16:25,691 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:16:25,691 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:16:25,692 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:16:25,692 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-18 16:16:25,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:16:25,693 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:16:25,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:16:25,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:16:25,693 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:16:25,694 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:16:25,694 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:16:25,694 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:16:25,695 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-18 16:16:25,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:16:25,695 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:16:25,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:16:25,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:16:25,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:16:25,696 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:16:25,696 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:16:25,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:16:25,697 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-18 16:16:25,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:16:25,697 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:16:25,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:16:25,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:16:25,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:16:25,698 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:16:25,698 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:16:25,699 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:16:25,699 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-18 16:16:25,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:16:25,699 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:16:25,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:16:25,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:16:25,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:16:25,704 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:16:25,704 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:16:25,705 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:16:25,705 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-18 16:16:25,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:16:25,705 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:16:25,706 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:16:25,706 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:16:25,706 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:16:25,706 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:16:25,706 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:16:25,707 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:16:25,707 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-18 16:16:25,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:16:25,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:16:25,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:16:25,708 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:16:25,709 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:16:25,709 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:16:25,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:16:25,711 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-18 16:16:25,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:16:25,711 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:16:25,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:16:25,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:16:25,712 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:16:25,712 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:16:25,712 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:16:25,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:16:25,713 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-18 16:16:25,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:16:25,714 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:16:25,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:16:25,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:16:25,714 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:16:25,714 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:16:25,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:16:25,715 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:16:25,715 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-18 16:16:25,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:16:25,716 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:16:25,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:16:25,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:16:25,717 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:16:25,717 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:16:25,717 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:16:25,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:16:25,718 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-18 16:16:25,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:16:25,718 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:16:25,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:16:25,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:16:25,719 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:16:25,719 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:16:25,719 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:16:25,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:16:25,727 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-18 16:16:25,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:16:25,728 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:16:25,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:16:25,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:16:25,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:16:25,729 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:16:25,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:16:25,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:16:25,730 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-18 16:16:25,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:16:25,730 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:16:25,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:16:25,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:16:25,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:16:25,731 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:16:25,731 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:16:25,732 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:16:25,739 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:16:25,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:16:25,740 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:16:25,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:16:25,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:16:25,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:16:25,741 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:16:25,741 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:16:25,741 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:16:25,742 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-18 16:16:25,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:16:25,742 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:16:25,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:16:25,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:16:25,743 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:16:25,743 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:16:25,743 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:16:25,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:16:25,744 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:16:25,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:16:25,744 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:16:25,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:16:25,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:16:25,745 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:16:25,745 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:16:25,745 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:16:25,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:16:25,746 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-18 16:16:25,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:16:25,746 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:16:25,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:16:25,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:16:25,747 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:16:25,747 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:16:25,747 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:16:25,748 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:16:25,749 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-18 16:16:25,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:16:25,750 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 16:16:25,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:16:25,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:16:25,751 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 16:16:25,752 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:16:25,759 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:16:25,764 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-18 16:16:25,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:16:25,764 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:16:25,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:16:25,765 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 16:16:25,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:16:25,765 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 16:16:25,765 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:16:25,767 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:16:25,767 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-18 16:16:25,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:16:25,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:16:25,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:16:25,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:16:25,775 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:16:25,776 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:16:25,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:16:25,779 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-18 16:16:25,779 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:16:25,780 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 16:16:25,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:16:25,780 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:16:25,781 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 16:16:25,781 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:16:25,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:16:25,786 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-18 16:16:25,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:16:25,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:16:25,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:16:25,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:16:25,788 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:16:25,788 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:16:25,789 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:16:25,790 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-18 16:16:25,790 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:16:25,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:16:25,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:16:25,791 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:16:25,793 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:16:25,793 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:16:25,807 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 16:16:25,824 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-18 16:16:25,825 INFO L444 ModelExtractionUtils]: 40 out of 46 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-18 16:16:25,825 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 16:16:25,826 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 16:16:25,826 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 16:16:25,826 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-18 16:16:25,872 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-11-18 16:16:25,874 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 16:16:25,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:16:25,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:16:25,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:16:25,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:16:25,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:16:25,926 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-18 16:16:25,926 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-18 16:16:25,926 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 22 transitions. cyclomatic complexity: 6 Second operand 5 states. [2018-11-18 16:16:25,950 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 22 transitions. cyclomatic complexity: 6. Second operand 5 states. Result 22 states and 26 transitions. Complement of second has 5 states. [2018-11-18 16:16:25,951 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-18 16:16:25,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 16:16:25,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2018-11-18 16:16:25,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 8 letters. Loop has 3 letters. [2018-11-18 16:16:25,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:16:25,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 11 letters. Loop has 3 letters. [2018-11-18 16:16:25,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:16:25,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 8 letters. Loop has 6 letters. [2018-11-18 16:16:25,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:16:25,953 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 26 transitions. [2018-11-18 16:16:25,953 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 16:16:25,953 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 0 states and 0 transitions. [2018-11-18 16:16:25,954 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 16:16:25,954 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 16:16:25,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 16:16:25,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 16:16:25,954 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 16:16:25,954 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 16:16:25,954 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 16:16:25,954 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 16:16:25,954 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 16:16:25,954 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 16:16:25,955 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 16:16:25,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 04:16:25 BoogieIcfgContainer [2018-11-18 16:16:25,962 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 16:16:25,963 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 16:16:25,963 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 16:16:25,963 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 16:16:25,964 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:16:21" (3/4) ... [2018-11-18 16:16:25,967 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 16:16:25,967 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 16:16:25,968 INFO L168 Benchmark]: Toolchain (without parser) took 5514.93 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 324.5 MB). Free memory was 951.1 MB in the beginning and 852.6 MB in the end (delta: 98.5 MB). Peak memory consumption was 423.0 MB. Max. memory is 11.5 GB. [2018-11-18 16:16:25,969 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:16:25,969 INFO L168 Benchmark]: CACSL2BoogieTranslator took 325.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 951.1 MB in the beginning and 1.1 GB in the end (delta: -176.6 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. [2018-11-18 16:16:25,970 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-18 16:16:25,970 INFO L168 Benchmark]: Boogie Preprocessor took 17.08 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-18 16:16:25,970 INFO L168 Benchmark]: RCFGBuilder took 269.74 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.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2018-11-18 16:16:25,971 INFO L168 Benchmark]: BuchiAutomizer took 4866.61 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 184.0 MB). Free memory was 1.1 GB in the beginning and 852.6 MB in the end (delta: 248.8 MB). Peak memory consumption was 432.8 MB. Max. memory is 11.5 GB. [2018-11-18 16:16:25,971 INFO L168 Benchmark]: Witness Printer took 4.30 ms. Allocated memory is still 1.4 GB. Free memory is still 852.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:16:25,974 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 325.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 951.1 MB in the beginning and 1.1 GB in the end (delta: -176.6 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.08 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 269.74 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.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4866.61 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 184.0 MB). Free memory was 1.1 GB in the beginning and 852.6 MB in the end (delta: 248.8 MB). Peak memory consumption was 432.8 MB. Max. memory is 11.5 GB. * Witness Printer took 4.30 ms. Allocated memory is still 1.4 GB. Free memory is still 852.6 MB. 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 unknown-#length-unknown[__builtin_alloca (in_len)] + -1 * s 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 4.8s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 4.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 24 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 21 states and ocurred in iteration 2. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 81 SDtfs, 108 SDslu, 46 SDs, 0 SdLazy, 55 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s 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: 17ms 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...