./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-libowfat/build_fullname_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_64bb85de-9b38-4940-a1f9-2ee99a15992f/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_64bb85de-9b38-4940-a1f9-2ee99a15992f/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_64bb85de-9b38-4940-a1f9-2ee99a15992f/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_64bb85de-9b38-4940-a1f9-2ee99a15992f/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-libowfat/build_fullname_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_64bb85de-9b38-4940-a1f9-2ee99a15992f/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_64bb85de-9b38-4940-a1f9-2ee99a15992f/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 d5a9d2464f90cb604e81a75f4f55e926d182d9fa .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 15:41:54,047 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 15:41:54,048 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 15:41:54,054 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 15:41:54,054 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 15:41:54,055 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 15:41:54,055 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 15:41:54,056 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 15:41:54,057 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 15:41:54,057 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 15:41:54,058 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 15:41:54,058 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 15:41:54,059 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 15:41:54,059 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 15:41:54,060 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 15:41:54,061 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 15:41:54,061 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 15:41:54,062 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 15:41:54,063 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 15:41:54,063 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 15:41:54,064 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 15:41:54,064 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 15:41:54,066 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 15:41:54,066 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 15:41:54,066 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 15:41:54,066 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 15:41:54,067 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 15:41:54,067 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 15:41:54,067 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 15:41:54,068 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 15:41:54,068 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 15:41:54,068 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 15:41:54,068 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 15:41:54,068 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 15:41:54,069 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 15:41:54,069 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 15:41:54,069 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_64bb85de-9b38-4940-a1f9-2ee99a15992f/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-09 15:41:54,077 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 15:41:54,077 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 15:41:54,077 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 15:41:54,078 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 15:41:54,078 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 15:41:54,078 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-09 15:41:54,078 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-09 15:41:54,078 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-09 15:41:54,078 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-09 15:41:54,078 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-09 15:41:54,078 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-09 15:41:54,078 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 15:41:54,078 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 15:41:54,079 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 15:41:54,079 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 15:41:54,079 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-09 15:41:54,079 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-09 15:41:54,079 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-09 15:41:54,079 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 15:41:54,079 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-09 15:41:54,079 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 15:41:54,079 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-09 15:41:54,079 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 15:41:54,079 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 15:41:54,080 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-09 15:41:54,080 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 15:41:54,080 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 15:41:54,080 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-09 15:41:54,080 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-09 15:41:54,080 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_64bb85de-9b38-4940-a1f9-2ee99a15992f/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 -> d5a9d2464f90cb604e81a75f4f55e926d182d9fa [2018-12-09 15:41:54,096 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 15:41:54,103 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 15:41:54,105 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 15:41:54,106 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 15:41:54,106 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 15:41:54,106 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_64bb85de-9b38-4940-a1f9-2ee99a15992f/bin-2019/uautomizer/../../sv-benchmarks/c/termination-libowfat/build_fullname_true-termination.c.i [2018-12-09 15:41:54,141 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_64bb85de-9b38-4940-a1f9-2ee99a15992f/bin-2019/uautomizer/data/3daada71b/30e0ee0dbed3447b9a150e820c3a8af3/FLAGd831e4878 [2018-12-09 15:41:54,592 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 15:41:54,593 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_64bb85de-9b38-4940-a1f9-2ee99a15992f/sv-benchmarks/c/termination-libowfat/build_fullname_true-termination.c.i [2018-12-09 15:41:54,599 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_64bb85de-9b38-4940-a1f9-2ee99a15992f/bin-2019/uautomizer/data/3daada71b/30e0ee0dbed3447b9a150e820c3a8af3/FLAGd831e4878 [2018-12-09 15:41:54,607 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_64bb85de-9b38-4940-a1f9-2ee99a15992f/bin-2019/uautomizer/data/3daada71b/30e0ee0dbed3447b9a150e820c3a8af3 [2018-12-09 15:41:54,609 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 15:41:54,610 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 15:41:54,610 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 15:41:54,610 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 15:41:54,612 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 15:41:54,613 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:41:54" (1/1) ... [2018-12-09 15:41:54,614 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@469267af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:41:54, skipping insertion in model container [2018-12-09 15:41:54,615 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:41:54" (1/1) ... [2018-12-09 15:41:54,619 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 15:41:54,636 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 15:41:54,783 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 15:41:54,825 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 15:41:54,858 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 15:41:54,881 INFO L195 MainTranslator]: Completed translation [2018-12-09 15:41:54,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:41:54 WrapperNode [2018-12-09 15:41:54,881 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 15:41:54,882 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 15:41:54,882 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 15:41:54,882 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 15:41:54,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:41:54" (1/1) ... [2018-12-09 15:41:54,895 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:41:54" (1/1) ... [2018-12-09 15:41:54,908 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 15:41:54,908 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 15:41:54,909 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 15:41:54,909 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 15:41:54,914 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:41:54" (1/1) ... [2018-12-09 15:41:54,914 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:41:54" (1/1) ... [2018-12-09 15:41:54,916 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:41:54" (1/1) ... [2018-12-09 15:41:54,916 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:41:54" (1/1) ... [2018-12-09 15:41:54,920 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:41:54" (1/1) ... [2018-12-09 15:41:54,923 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:41:54" (1/1) ... [2018-12-09 15:41:54,923 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:41:54" (1/1) ... [2018-12-09 15:41:54,925 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 15:41:54,925 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 15:41:54,925 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 15:41:54,925 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 15:41:54,926 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:41:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_64bb85de-9b38-4940-a1f9-2ee99a15992f/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 15:41:54,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 15:41:54,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 15:41:54,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 15:41:54,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 15:41:54,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 15:41:54,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 15:41:55,127 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 15:41:55,127 INFO L280 CfgBuilder]: Removed 15 assue(true) statements. [2018-12-09 15:41:55,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:41:55 BoogieIcfgContainer [2018-12-09 15:41:55,128 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 15:41:55,128 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-09 15:41:55,128 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-09 15:41:55,130 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-09 15:41:55,130 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 15:41:55,130 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.12 03:41:54" (1/3) ... [2018-12-09 15:41:55,131 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@13e7e4fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 03:41:55, skipping insertion in model container [2018-12-09 15:41:55,131 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 15:41:55,131 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:41:54" (2/3) ... [2018-12-09 15:41:55,131 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@13e7e4fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 03:41:55, skipping insertion in model container [2018-12-09 15:41:55,131 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 15:41:55,132 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:41:55" (3/3) ... [2018-12-09 15:41:55,132 INFO L375 chiAutomizerObserver]: Analyzing ICFG build_fullname_true-termination.c.i [2018-12-09 15:41:55,164 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 15:41:55,164 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-09 15:41:55,164 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-09 15:41:55,164 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-09 15:41:55,164 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 15:41:55,165 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 15:41:55,165 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-09 15:41:55,165 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 15:41:55,165 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-09 15:41:55,173 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2018-12-09 15:41:55,186 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2018-12-09 15:41:55,187 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 15:41:55,187 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 15:41:55,190 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:41:55,191 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 15:41:55,191 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-09 15:41:55,191 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2018-12-09 15:41:55,192 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2018-12-09 15:41:55,192 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 15:41:55,192 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 15:41:55,192 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:41:55,192 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 15:41:55,197 INFO L794 eck$LassoCheckResult]: Stem: 25#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet19, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_~dir_len~0, main_~file_len~0, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset, main_~output~0.base, main_~output~0.offset;main_~dir_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 9#L532true assume !(main_~dir_len~0 < 1);main_~file_len~0 := main_#t~nondet20;havoc main_#t~nondet20; 20#L534true assume !(main_~file_len~0 < 1);call main_#t~malloc21.base, main_#t~malloc21.offset := #Ultimate.alloc(main_~dir_len~0);main_~dir~0.base, main_~dir~0.offset := main_#t~malloc21.base, main_#t~malloc21.offset;call write~int(0, main_~dir~0.base, main_~dir~0.offset + (main_~dir_len~0 - 1), 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.alloc(main_~file_len~0);main_~file~0.base, main_~file~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~file~0.base, main_~file~0.offset + (main_~file_len~0 - 1), 1);call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.alloc(2 + (main_~dir_len~0 + main_~file_len~0));main_~output~0.base, main_~output~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset, build_fullname_#in~directory.base, build_fullname_#in~directory.offset, build_fullname_#in~filename.base, build_fullname_#in~filename.offset := main_~output~0.base, main_~output~0.offset, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset;havoc build_fullname_#t~mem8, build_fullname_#t~mem9, build_fullname_#t~short10, build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset, build_fullname_#t~mem12, build_fullname_#t~mem13, build_fullname_#t~short14, build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset, build_fullname_#t~ret16.base, build_fullname_#t~ret16.offset, build_fullname_#t~pre17.base, build_fullname_#t~pre17.offset, build_fullname_#t~ret18.base, build_fullname_#t~ret18.offset, build_fullname_~fullname.base, build_fullname_~fullname.offset, build_fullname_~directory.base, build_fullname_~directory.offset, build_fullname_~filename.base, build_fullname_~filename.offset, build_fullname_~dest~0.base, build_fullname_~dest~0.offset;build_fullname_~fullname.base, build_fullname_~fullname.offset := build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset;build_fullname_~directory.base, build_fullname_~directory.offset := build_fullname_#in~directory.base, build_fullname_#in~directory.offset;build_fullname_~filename.base, build_fullname_~filename.offset := build_fullname_#in~filename.base, build_fullname_#in~filename.offset;build_fullname_~dest~0.base, build_fullname_~dest~0.offset := build_fullname_~fullname.base, build_fullname_~fullname.offset;call build_fullname_#t~mem8 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 47 == build_fullname_#t~mem8; 10#L521true assume build_fullname_#t~short10;call build_fullname_#t~mem9 := read~int(build_fullname_~directory.base, 1 + build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 0 == build_fullname_#t~mem9; 13#L521-2true assume build_fullname_#t~short10;havoc build_fullname_#t~short10;havoc build_fullname_#t~mem9;havoc build_fullname_#t~mem8;call write~int(47, build_fullname_~dest~0.base, build_fullname_~dest~0.offset, 1);build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset := build_fullname_~dest~0.base, 1 + build_fullname_~dest~0.offset;build_fullname_~dest~0.base, build_fullname_~dest~0.offset := build_fullname_~dest~0.base, 1 + build_fullname_~dest~0.offset;havoc build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset; 14#L523-4true strcpy_#in~s1.base, strcpy_#in~s1.offset, strcpy_#in~s2.base, strcpy_#in~s2.offset := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, build_fullname_~filename.base, build_fullname_~filename.offset;havoc strcpy_#res.base, strcpy_#res.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset, strcpy_#t~post3.base, strcpy_#t~post3.offset, strcpy_#t~mem4, strcpy_~s1.base, strcpy_~s1.offset, strcpy_~s2.base, strcpy_~s2.offset, strcpy_~res~0.base, strcpy_~res~0.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#in~s1.base, strcpy_#in~s1.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#in~s2.base, strcpy_#in~s2.offset;strcpy_~res~0.base, strcpy_~res~0.offset := strcpy_~s1.base, strcpy_~s1.offset; 24#L508-8true [2018-12-09 15:41:55,197 INFO L796 eck$LassoCheckResult]: Loop: 24#L508-8true strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); 7#L508-6true assume !!(0 != strcpy_#t~mem4);havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset;havoc strcpy_#t~mem4; 24#L508-8true [2018-12-09 15:41:55,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:41:55,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1806905919, now seen corresponding path program 1 times [2018-12-09 15:41:55,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:41:55,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:41:55,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:55,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:41:55,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:55,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:41:55,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:41:55,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:41:55,312 INFO L82 PathProgramCache]: Analyzing trace with hash 3590, now seen corresponding path program 1 times [2018-12-09 15:41:55,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:41:55,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:41:55,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:55,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:41:55,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:55,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:41:55,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:41:55,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:41:55,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1269803204, now seen corresponding path program 1 times [2018-12-09 15:41:55,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:41:55,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:41:55,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:55,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:41:55,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:55,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:41:55,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:41:55,974 WARN L180 SmtUtils]: Spent 525.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 150 [2018-12-09 15:41:56,236 WARN L180 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2018-12-09 15:41:56,244 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 15:41:56,245 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 15:41:56,245 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 15:41:56,245 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 15:41:56,245 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 15:41:56,246 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 15:41:56,246 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 15:41:56,246 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 15:41:56,246 INFO L131 ssoRankerPreferences]: Filename of dumped script: build_fullname_true-termination.c.i_Iteration1_Lasso [2018-12-09 15:41:56,246 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 15:41:56,246 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 15:41:56,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:41:56,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:41:56,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:41:56,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:41:56,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:41:56,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:41:56,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:41:56,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:41:56,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:41:56,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:41:56,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:41:56,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:41:56,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:41:56,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:41:56,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:41:56,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:41:56,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:41:56,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:41:56,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:41:56,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:41:56,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:41:56,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:41:56,762 WARN L180 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 115 [2018-12-09 15:41:56,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:41:56,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:41:56,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:41:56,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:41:56,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:41:56,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:41:56,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:41:57,351 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 15:41:57,354 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 15:41:57,356 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:41:57,357 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:41:57,357 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:41:57,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:41:57,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:41:57,357 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:41:57,358 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:41:57,358 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:41:57,360 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:41:57,360 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:41:57,361 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:41:57,361 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:41:57,361 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:41:57,361 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:41:57,361 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:41:57,362 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:41:57,362 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:41:57,363 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:41:57,363 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:41:57,364 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:41:57,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:41:57,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:41:57,364 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:41:57,366 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:41:57,366 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:41:57,369 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:41:57,369 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:41:57,370 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:41:57,370 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:41:57,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:41:57,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:41:57,370 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:41:57,371 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:41:57,371 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:41:57,371 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:41:57,372 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:41:57,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:41:57,372 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:41:57,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:41:57,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:41:57,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:41:57,373 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:41:57,373 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:41:57,373 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:41:57,374 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:41:57,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:41:57,374 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:41:57,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:41:57,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:41:57,375 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:41:57,375 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:41:57,375 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:41:57,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:41:57,376 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:41:57,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:41:57,377 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:41:57,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:41:57,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:41:57,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:41:57,378 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:41:57,378 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:41:57,378 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:41:57,379 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:41:57,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:41:57,379 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:41:57,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:41:57,379 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:41:57,379 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:41:57,380 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:41:57,380 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:41:57,380 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:41:57,381 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:41:57,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:41:57,381 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:41:57,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:41:57,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:41:57,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:41:57,382 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:41:57,382 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:41:57,382 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:41:57,383 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:41:57,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:41:57,383 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:41:57,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:41:57,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:41:57,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:41:57,384 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:41:57,384 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:41:57,385 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:41:57,385 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:41:57,385 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:41:57,385 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:41:57,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:41:57,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:41:57,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:41:57,386 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:41:57,386 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:41:57,387 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:41:57,387 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:41:57,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:41:57,388 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:41:57,388 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:41:57,388 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:41:57,388 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:41:57,388 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:41:57,388 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:41:57,388 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:41:57,389 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:41:57,389 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:41:57,389 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:41:57,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:41:57,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:41:57,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:41:57,389 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:41:57,389 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:41:57,390 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:41:57,390 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:41:57,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:41:57,390 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:41:57,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:41:57,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:41:57,390 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:41:57,391 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:41:57,391 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:41:57,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:41:57,391 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:41:57,391 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:41:57,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:41:57,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:41:57,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:41:57,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:41:57,392 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:41:57,392 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:41:57,392 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:41:57,393 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:41:57,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:41:57,393 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:41:57,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:41:57,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:41:57,393 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:41:57,393 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:41:57,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:41:57,394 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:41:57,394 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:41:57,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:41:57,394 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:41:57,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:41:57,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:41:57,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:41:57,395 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:41:57,395 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:41:57,395 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:41:57,395 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:41:57,395 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:41:57,395 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:41:57,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:41:57,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:41:57,396 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:41:57,396 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:41:57,396 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:41:57,396 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:41:57,397 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:41:57,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:41:57,397 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:41:57,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:41:57,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:41:57,398 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:41:57,398 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:41:57,398 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:41:57,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:41:57,399 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:41:57,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:41:57,399 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:41:57,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:41:57,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:41:57,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:41:57,399 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:41:57,399 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:41:57,400 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:41:57,400 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:41:57,400 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:41:57,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:41:57,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:41:57,400 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:41:57,401 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:41:57,401 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:41:57,402 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:41:57,402 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:41:57,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:41:57,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:41:57,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:41:57,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:41:57,404 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:41:57,404 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:41:57,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:41:57,411 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:41:57,411 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:41:57,411 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 15:41:57,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:41:57,411 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:41:57,414 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 15:41:57,414 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:41:57,429 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:41:57,429 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:41:57,430 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:41:57,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:41:57,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:41:57,430 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:41:57,431 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:41:57,431 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:41:57,433 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:41:57,434 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:41:57,434 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:41:57,434 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:41:57,434 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:41:57,435 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 15:41:57,435 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:41:57,435 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 15:41:57,435 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:41:57,437 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:41:57,437 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:41:57,438 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:41:57,438 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:41:57,438 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:41:57,438 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:41:57,438 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:41:57,439 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:41:57,439 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:41:57,439 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:41:57,440 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:41:57,440 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:41:57,440 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:41:57,440 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:41:57,440 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:41:57,441 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:41:57,441 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:41:57,444 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:41:57,444 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:41:57,444 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:41:57,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:41:57,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:41:57,445 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:41:57,446 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:41:57,446 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:41:57,447 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:41:57,448 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:41:57,448 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:41:57,448 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 15:41:57,448 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:41:57,449 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:41:57,451 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 15:41:57,451 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:41:57,460 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:41:57,461 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:41:57,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:41:57,461 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 15:41:57,461 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:41:57,462 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:41:57,463 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 15:41:57,463 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:41:57,468 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:41:57,469 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:41:57,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:41:57,469 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:41:57,469 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:41:57,469 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:41:57,470 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:41:57,470 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:41:57,472 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:41:57,472 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:41:57,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:41:57,473 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:41:57,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:41:57,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:41:57,473 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:41:57,474 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:41:57,474 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:41:57,474 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:41:57,475 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:41:57,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:41:57,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:41:57,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:41:57,475 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:41:57,476 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:41:57,476 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:41:57,478 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:41:57,478 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:41:57,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:41:57,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:41:57,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:41:57,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:41:57,483 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:41:57,483 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:41:57,525 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 15:41:57,548 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-09 15:41:57,548 INFO L444 ModelExtractionUtils]: 72 out of 79 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-09 15:41:57,550 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 15:41:57,551 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 15:41:57,551 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 15:41:57,552 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strcpy_~s1.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc23.base)_1) = -1*ULTIMATE.start_strcpy_~s1.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc23.base)_1 Supporting invariants [] [2018-12-09 15:41:57,684 INFO L297 tatePredicateManager]: 34 out of 35 supporting invariants were superfluous and have been removed [2018-12-09 15:41:57,691 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-09 15:41:57,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:41:57,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:41:57,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:41:57,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:41:57,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:41:57,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:41:57,780 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-12-09 15:41:57,781 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states. Second operand 4 states. [2018-12-09 15:41:57,851 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states.. Second operand 4 states. Result 59 states and 81 transitions. Complement of second has 8 states. [2018-12-09 15:41:57,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 1 non-accepting loop states 2 accepting loop states [2018-12-09 15:41:57,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-09 15:41:57,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2018-12-09 15:41:57,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 63 transitions. Stem has 7 letters. Loop has 2 letters. [2018-12-09 15:41:57,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 15:41:57,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 63 transitions. Stem has 9 letters. Loop has 2 letters. [2018-12-09 15:41:57,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 15:41:57,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 63 transitions. Stem has 7 letters. Loop has 4 letters. [2018-12-09 15:41:57,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 15:41:57,856 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 81 transitions. [2018-12-09 15:41:57,858 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2018-12-09 15:41:57,860 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 22 states and 27 transitions. [2018-12-09 15:41:57,861 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-12-09 15:41:57,861 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-12-09 15:41:57,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 27 transitions. [2018-12-09 15:41:57,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 15:41:57,862 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-12-09 15:41:57,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 27 transitions. [2018-12-09 15:41:57,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2018-12-09 15:41:57,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-09 15:41:57,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2018-12-09 15:41:57,878 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2018-12-09 15:41:57,878 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2018-12-09 15:41:57,878 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-09 15:41:57,878 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2018-12-09 15:41:57,878 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2018-12-09 15:41:57,878 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 15:41:57,878 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 15:41:57,879 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:41:57,879 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 15:41:57,879 INFO L794 eck$LassoCheckResult]: Stem: 308#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 305#L-1 havoc main_#res;havoc main_#t~nondet19, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_~dir_len~0, main_~file_len~0, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset, main_~output~0.base, main_~output~0.offset;main_~dir_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 306#L532 assume !(main_~dir_len~0 < 1);main_~file_len~0 := main_#t~nondet20;havoc main_#t~nondet20; 301#L534 assume !(main_~file_len~0 < 1);call main_#t~malloc21.base, main_#t~malloc21.offset := #Ultimate.alloc(main_~dir_len~0);main_~dir~0.base, main_~dir~0.offset := main_#t~malloc21.base, main_#t~malloc21.offset;call write~int(0, main_~dir~0.base, main_~dir~0.offset + (main_~dir_len~0 - 1), 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.alloc(main_~file_len~0);main_~file~0.base, main_~file~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~file~0.base, main_~file~0.offset + (main_~file_len~0 - 1), 1);call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.alloc(2 + (main_~dir_len~0 + main_~file_len~0));main_~output~0.base, main_~output~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset, build_fullname_#in~directory.base, build_fullname_#in~directory.offset, build_fullname_#in~filename.base, build_fullname_#in~filename.offset := main_~output~0.base, main_~output~0.offset, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset;havoc build_fullname_#t~mem8, build_fullname_#t~mem9, build_fullname_#t~short10, build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset, build_fullname_#t~mem12, build_fullname_#t~mem13, build_fullname_#t~short14, build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset, build_fullname_#t~ret16.base, build_fullname_#t~ret16.offset, build_fullname_#t~pre17.base, build_fullname_#t~pre17.offset, build_fullname_#t~ret18.base, build_fullname_#t~ret18.offset, build_fullname_~fullname.base, build_fullname_~fullname.offset, build_fullname_~directory.base, build_fullname_~directory.offset, build_fullname_~filename.base, build_fullname_~filename.offset, build_fullname_~dest~0.base, build_fullname_~dest~0.offset;build_fullname_~fullname.base, build_fullname_~fullname.offset := build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset;build_fullname_~directory.base, build_fullname_~directory.offset := build_fullname_#in~directory.base, build_fullname_#in~directory.offset;build_fullname_~filename.base, build_fullname_~filename.offset := build_fullname_#in~filename.base, build_fullname_#in~filename.offset;build_fullname_~dest~0.base, build_fullname_~dest~0.offset := build_fullname_~fullname.base, build_fullname_~fullname.offset;call build_fullname_#t~mem8 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 47 == build_fullname_#t~mem8; 302#L521 assume build_fullname_#t~short10;call build_fullname_#t~mem9 := read~int(build_fullname_~directory.base, 1 + build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 0 == build_fullname_#t~mem9; 307#L521-2 assume !build_fullname_#t~short10;havoc build_fullname_#t~short10;havoc build_fullname_#t~mem9;havoc build_fullname_#t~mem8;call build_fullname_#t~mem12 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short14 := 46 != build_fullname_#t~mem12; 303#L523 assume !build_fullname_#t~short14;call build_fullname_#t~mem13 := read~int(build_fullname_~directory.base, 1 + build_fullname_~directory.offset, 1);build_fullname_#t~short14 := 0 != build_fullname_#t~mem13; 304#L523-2 assume build_fullname_#t~short14;havoc build_fullname_#t~mem12;havoc build_fullname_#t~mem13;havoc build_fullname_#t~short14;strcpy_#in~s1.base, strcpy_#in~s1.offset, strcpy_#in~s2.base, strcpy_#in~s2.offset := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, build_fullname_~directory.base, build_fullname_~directory.offset;havoc strcpy_#res.base, strcpy_#res.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset, strcpy_#t~post3.base, strcpy_#t~post3.offset, strcpy_#t~mem4, strcpy_~s1.base, strcpy_~s1.offset, strcpy_~s2.base, strcpy_~s2.offset, strcpy_~res~0.base, strcpy_~res~0.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#in~s1.base, strcpy_#in~s1.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#in~s2.base, strcpy_#in~s2.offset;strcpy_~res~0.base, strcpy_~res~0.offset := strcpy_~s1.base, strcpy_~s1.offset; 290#L508-3 [2018-12-09 15:41:57,879 INFO L796 eck$LassoCheckResult]: Loop: 290#L508-3 strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); 291#L508-1 assume !!(0 != strcpy_#t~mem4);havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset;havoc strcpy_#t~mem4; 290#L508-3 [2018-12-09 15:41:57,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:41:57,879 INFO L82 PathProgramCache]: Analyzing trace with hash 179509076, now seen corresponding path program 1 times [2018-12-09 15:41:57,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:41:57,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:41:57,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:57,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:41:57,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:57,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:41:57,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:41:57,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:41:57,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 15:41:57,928 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 15:41:57,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:41:57,928 INFO L82 PathProgramCache]: Analyzing trace with hash 2150, now seen corresponding path program 1 times [2018-12-09 15:41:57,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:41:57,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:41:57,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:57,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:41:57,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:57,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:41:57,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:41:57,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 15:41:57,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 15:41:57,991 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-12-09 15:41:58,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:41:58,023 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2018-12-09 15:41:58,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 15:41:58,024 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 30 transitions. [2018-12-09 15:41:58,025 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2018-12-09 15:41:58,025 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 30 transitions. [2018-12-09 15:41:58,025 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-12-09 15:41:58,025 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2018-12-09 15:41:58,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 30 transitions. [2018-12-09 15:41:58,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 15:41:58,025 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2018-12-09 15:41:58,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 30 transitions. [2018-12-09 15:41:58,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2018-12-09 15:41:58,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-09 15:41:58,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2018-12-09 15:41:58,027 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-12-09 15:41:58,027 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-12-09 15:41:58,027 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-09 15:41:58,027 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2018-12-09 15:41:58,027 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2018-12-09 15:41:58,027 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 15:41:58,028 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 15:41:58,028 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:41:58,028 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 15:41:58,028 INFO L794 eck$LassoCheckResult]: Stem: 364#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 361#L-1 havoc main_#res;havoc main_#t~nondet19, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_~dir_len~0, main_~file_len~0, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset, main_~output~0.base, main_~output~0.offset;main_~dir_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 360#L532 assume !(main_~dir_len~0 < 1);main_~file_len~0 := main_#t~nondet20;havoc main_#t~nondet20; 354#L534 assume !(main_~file_len~0 < 1);call main_#t~malloc21.base, main_#t~malloc21.offset := #Ultimate.alloc(main_~dir_len~0);main_~dir~0.base, main_~dir~0.offset := main_#t~malloc21.base, main_#t~malloc21.offset;call write~int(0, main_~dir~0.base, main_~dir~0.offset + (main_~dir_len~0 - 1), 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.alloc(main_~file_len~0);main_~file~0.base, main_~file~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~file~0.base, main_~file~0.offset + (main_~file_len~0 - 1), 1);call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.alloc(2 + (main_~dir_len~0 + main_~file_len~0));main_~output~0.base, main_~output~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset, build_fullname_#in~directory.base, build_fullname_#in~directory.offset, build_fullname_#in~filename.base, build_fullname_#in~filename.offset := main_~output~0.base, main_~output~0.offset, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset;havoc build_fullname_#t~mem8, build_fullname_#t~mem9, build_fullname_#t~short10, build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset, build_fullname_#t~mem12, build_fullname_#t~mem13, build_fullname_#t~short14, build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset, build_fullname_#t~ret16.base, build_fullname_#t~ret16.offset, build_fullname_#t~pre17.base, build_fullname_#t~pre17.offset, build_fullname_#t~ret18.base, build_fullname_#t~ret18.offset, build_fullname_~fullname.base, build_fullname_~fullname.offset, build_fullname_~directory.base, build_fullname_~directory.offset, build_fullname_~filename.base, build_fullname_~filename.offset, build_fullname_~dest~0.base, build_fullname_~dest~0.offset;build_fullname_~fullname.base, build_fullname_~fullname.offset := build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset;build_fullname_~directory.base, build_fullname_~directory.offset := build_fullname_#in~directory.base, build_fullname_#in~directory.offset;build_fullname_~filename.base, build_fullname_~filename.offset := build_fullname_#in~filename.base, build_fullname_#in~filename.offset;build_fullname_~dest~0.base, build_fullname_~dest~0.offset := build_fullname_~fullname.base, build_fullname_~fullname.offset;call build_fullname_#t~mem8 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 47 == build_fullname_#t~mem8; 355#L521 assume !build_fullname_#t~short10; 362#L521-2 assume !build_fullname_#t~short10;havoc build_fullname_#t~short10;havoc build_fullname_#t~mem9;havoc build_fullname_#t~mem8;call build_fullname_#t~mem12 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short14 := 46 != build_fullname_#t~mem12; 365#L523 assume !build_fullname_#t~short14;call build_fullname_#t~mem13 := read~int(build_fullname_~directory.base, 1 + build_fullname_~directory.offset, 1);build_fullname_#t~short14 := 0 != build_fullname_#t~mem13; 359#L523-2 assume build_fullname_#t~short14;havoc build_fullname_#t~mem12;havoc build_fullname_#t~mem13;havoc build_fullname_#t~short14;strcpy_#in~s1.base, strcpy_#in~s1.offset, strcpy_#in~s2.base, strcpy_#in~s2.offset := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, build_fullname_~directory.base, build_fullname_~directory.offset;havoc strcpy_#res.base, strcpy_#res.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset, strcpy_#t~post3.base, strcpy_#t~post3.offset, strcpy_#t~mem4, strcpy_~s1.base, strcpy_~s1.offset, strcpy_~s2.base, strcpy_~s2.offset, strcpy_~res~0.base, strcpy_~res~0.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#in~s1.base, strcpy_#in~s1.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#in~s2.base, strcpy_#in~s2.offset;strcpy_~res~0.base, strcpy_~res~0.offset := strcpy_~s1.base, strcpy_~s1.offset; 345#L508-3 [2018-12-09 15:41:58,028 INFO L796 eck$LassoCheckResult]: Loop: 345#L508-3 strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); 346#L508-1 assume !!(0 != strcpy_#t~mem4);havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset;havoc strcpy_#t~mem4; 345#L508-3 [2018-12-09 15:41:58,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:41:58,028 INFO L82 PathProgramCache]: Analyzing trace with hash 179568658, now seen corresponding path program 1 times [2018-12-09 15:41:58,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:41:58,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:41:58,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:58,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:41:58,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:58,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:41:58,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:41:58,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:41:58,042 INFO L82 PathProgramCache]: Analyzing trace with hash 2150, now seen corresponding path program 2 times [2018-12-09 15:41:58,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:41:58,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:41:58,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:58,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:41:58,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:58,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:41:58,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:41:58,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:41:58,047 INFO L82 PathProgramCache]: Analyzing trace with hash 766789687, now seen corresponding path program 1 times [2018-12-09 15:41:58,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:41:58,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:41:58,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:58,048 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 15:41:58,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:58,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:41:58,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:41:58,545 WARN L180 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 149 [2018-12-09 15:41:58,687 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2018-12-09 15:41:58,688 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 15:41:58,689 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 15:41:58,689 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 15:41:58,689 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 15:41:58,689 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 15:41:58,689 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 15:41:58,689 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 15:41:58,689 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 15:41:58,689 INFO L131 ssoRankerPreferences]: Filename of dumped script: build_fullname_true-termination.c.i_Iteration3_Lasso [2018-12-09 15:41:58,689 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 15:41:58,689 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 15:41:58,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:41:58,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:41:58,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:41:58,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:41:58,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:41:58,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:41:58,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:41:58,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:41:58,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:41:58,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:41:58,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:41:58,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:41:58,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:41:58,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:41:58,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:41:58,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:41:58,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:41:58,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:41:58,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:41:58,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:41:59,107 WARN L180 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 122 [2018-12-09 15:41:59,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-12-09 15:41:59,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:41:59,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:41:59,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-12-09 15:41:59,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:41:59,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-12-09 15:41:59,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:41:59,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:41:59,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-12-09 15:41:59,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-12-09 15:41:59,714 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 15:41:59,715 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 15:41:59,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-12-09 15:41:59,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:41:59,715 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:41:59,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:41:59,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:41:59,716 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:41:59,716 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:41:59,716 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:41:59,716 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:41:59,716 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:41:59,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:41:59,717 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:41:59,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:41:59,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:41:59,717 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:41:59,717 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:41:59,717 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:41:59,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:41:59,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-12-09 15:41:59,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:41:59,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:41:59,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:41:59,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:41:59,718 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:41:59,718 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:41:59,719 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:41:59,719 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:41:59,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:41:59,720 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:41:59,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:41:59,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:41:59,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:41:59,720 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:41:59,720 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:41:59,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:41:59,720 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:41:59,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:41:59,720 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:41:59,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:41:59,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:41:59,721 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:41:59,721 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:41:59,721 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:41:59,721 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:41:59,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:41:59,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:41:59,721 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:41:59,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:41:59,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:41:59,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:41:59,722 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:41:59,722 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:41:59,722 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:41:59,722 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:41:59,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:41:59,722 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:41:59,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:41:59,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:41:59,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:41:59,723 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:41:59,723 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:41:59,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:41:59,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:41:59,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:41:59,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:41:59,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:41:59,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:41:59,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:41:59,724 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:41:59,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:41:59,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:41:59,724 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:41:59,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:41:59,724 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:41:59,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:41:59,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:41:59,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:41:59,725 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:41:59,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:41:59,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:41:59,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:41:59,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:41:59,725 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:41:59,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:41:59,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:41:59,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:41:59,726 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:41:59,726 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:41:59,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:41:59,726 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:41:59,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:41:59,726 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:41:59,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:41:59,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:41:59,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:41:59,727 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:41:59,727 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:41:59,727 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:41:59,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-12-09 15:41:59,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:41:59,728 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:41:59,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:41:59,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:41:59,728 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:41:59,728 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:41:59,728 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:41:59,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:41:59,728 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:41:59,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:41:59,729 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:41:59,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:41:59,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:41:59,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:41:59,729 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:41:59,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:41:59,729 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:41:59,729 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:41:59,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:41:59,730 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:41:59,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:41:59,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:41:59,730 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:41:59,730 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:41:59,730 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:41:59,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:41:59,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-12-09 15:41:59,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:41:59,731 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:41:59,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:41:59,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:41:59,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:41:59,731 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:41:59,731 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:41:59,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:41:59,732 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:41:59,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:41:59,732 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:41:59,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:41:59,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:41:59,732 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:41:59,732 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:41:59,732 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:41:59,732 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:41:59,733 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:41:59,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:41:59,733 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:41:59,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:41:59,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:41:59,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:41:59,733 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:41:59,733 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:41:59,734 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:41:59,734 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:41:59,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:41:59,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:41:59,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:41:59,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:41:59,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:41:59,734 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:41:59,735 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:41:59,735 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:41:59,735 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:41:59,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:41:59,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:41:59,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:41:59,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:41:59,736 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:41:59,736 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:41:59,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:41:59,737 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:41:59,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:41:59,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:41:59,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:41:59,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:41:59,737 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:41:59,738 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:41:59,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:41:59,739 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:41:59,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:41:59,739 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 15:41:59,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:41:59,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:41:59,740 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 15:41:59,740 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:41:59,744 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:41:59,744 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:41:59,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:41:59,745 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 15:41:59,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:41:59,745 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:41:59,746 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 15:41:59,746 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:41:59,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:41:59,750 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:41:59,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:41:59,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:41:59,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:41:59,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:41:59,751 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:41:59,751 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:41:59,752 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:41:59,752 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:41:59,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:41:59,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:41:59,752 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 15:41:59,752 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:41:59,753 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-12-09 15:41:59,753 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-09 15:41:59,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:41:59,758 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:41:59,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:41:59,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:41:59,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:41:59,759 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:41:59,759 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:41:59,759 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:41:59,760 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:41:59,760 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:41:59,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:41:59,761 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 15:41:59,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:41:59,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:41:59,761 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 15:41:59,761 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:41:59,762 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:41:59,763 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:41:59,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:41:59,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:41:59,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:41:59,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:41:59,765 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:41:59,765 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:41:59,781 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 15:41:59,802 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-09 15:41:59,803 INFO L444 ModelExtractionUtils]: 55 out of 61 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-09 15:41:59,803 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 15:41:59,803 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 15:41:59,803 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 15:41:59,804 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strcpy_~s1.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc21.base)_2) = -1*ULTIMATE.start_strcpy_~s1.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc21.base)_2 Supporting invariants [] [2018-12-09 15:41:59,880 INFO L297 tatePredicateManager]: 30 out of 34 supporting invariants were superfluous and have been removed [2018-12-09 15:41:59,884 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-09 15:41:59,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:41:59,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:41:59,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:41:59,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:41:59,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:41:59,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:41:59,936 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-12-09 15:41:59,936 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-12-09 15:41:59,967 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 32 states and 39 transitions. Complement of second has 6 states. [2018-12-09 15:41:59,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-09 15:41:59,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-09 15:41:59,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2018-12-09 15:41:59,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 8 letters. Loop has 2 letters. [2018-12-09 15:41:59,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 15:41:59,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 10 letters. Loop has 2 letters. [2018-12-09 15:41:59,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 15:41:59,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 8 letters. Loop has 4 letters. [2018-12-09 15:41:59,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 15:41:59,969 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 39 transitions. [2018-12-09 15:41:59,970 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-12-09 15:41:59,970 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 23 states and 28 transitions. [2018-12-09 15:41:59,970 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-12-09 15:41:59,970 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-12-09 15:41:59,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2018-12-09 15:41:59,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 15:41:59,971 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2018-12-09 15:41:59,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2018-12-09 15:41:59,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-09 15:41:59,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-09 15:41:59,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2018-12-09 15:41:59,972 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2018-12-09 15:41:59,972 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2018-12-09 15:41:59,972 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-09 15:41:59,972 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 28 transitions. [2018-12-09 15:41:59,973 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-12-09 15:41:59,973 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 15:41:59,973 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 15:41:59,973 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:41:59,973 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 15:41:59,974 INFO L794 eck$LassoCheckResult]: Stem: 614#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 610#L-1 havoc main_#res;havoc main_#t~nondet19, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_~dir_len~0, main_~file_len~0, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset, main_~output~0.base, main_~output~0.offset;main_~dir_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 611#L532 assume !(main_~dir_len~0 < 1);main_~file_len~0 := main_#t~nondet20;havoc main_#t~nondet20; 604#L534 assume !(main_~file_len~0 < 1);call main_#t~malloc21.base, main_#t~malloc21.offset := #Ultimate.alloc(main_~dir_len~0);main_~dir~0.base, main_~dir~0.offset := main_#t~malloc21.base, main_#t~malloc21.offset;call write~int(0, main_~dir~0.base, main_~dir~0.offset + (main_~dir_len~0 - 1), 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.alloc(main_~file_len~0);main_~file~0.base, main_~file~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~file~0.base, main_~file~0.offset + (main_~file_len~0 - 1), 1);call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.alloc(2 + (main_~dir_len~0 + main_~file_len~0));main_~output~0.base, main_~output~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset, build_fullname_#in~directory.base, build_fullname_#in~directory.offset, build_fullname_#in~filename.base, build_fullname_#in~filename.offset := main_~output~0.base, main_~output~0.offset, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset;havoc build_fullname_#t~mem8, build_fullname_#t~mem9, build_fullname_#t~short10, build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset, build_fullname_#t~mem12, build_fullname_#t~mem13, build_fullname_#t~short14, build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset, build_fullname_#t~ret16.base, build_fullname_#t~ret16.offset, build_fullname_#t~pre17.base, build_fullname_#t~pre17.offset, build_fullname_#t~ret18.base, build_fullname_#t~ret18.offset, build_fullname_~fullname.base, build_fullname_~fullname.offset, build_fullname_~directory.base, build_fullname_~directory.offset, build_fullname_~filename.base, build_fullname_~filename.offset, build_fullname_~dest~0.base, build_fullname_~dest~0.offset;build_fullname_~fullname.base, build_fullname_~fullname.offset := build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset;build_fullname_~directory.base, build_fullname_~directory.offset := build_fullname_#in~directory.base, build_fullname_#in~directory.offset;build_fullname_~filename.base, build_fullname_~filename.offset := build_fullname_#in~filename.base, build_fullname_#in~filename.offset;build_fullname_~dest~0.base, build_fullname_~dest~0.offset := build_fullname_~fullname.base, build_fullname_~fullname.offset;call build_fullname_#t~mem8 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 47 == build_fullname_#t~mem8; 605#L521 assume !build_fullname_#t~short10; 612#L521-2 assume !build_fullname_#t~short10;havoc build_fullname_#t~short10;havoc build_fullname_#t~mem9;havoc build_fullname_#t~mem8;call build_fullname_#t~mem12 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short14 := 46 != build_fullname_#t~mem12; 616#L523 assume !build_fullname_#t~short14;call build_fullname_#t~mem13 := read~int(build_fullname_~directory.base, 1 + build_fullname_~directory.offset, 1);build_fullname_#t~short14 := 0 != build_fullname_#t~mem13; 609#L523-2 assume build_fullname_#t~short14;havoc build_fullname_#t~mem12;havoc build_fullname_#t~mem13;havoc build_fullname_#t~short14;strcpy_#in~s1.base, strcpy_#in~s1.offset, strcpy_#in~s2.base, strcpy_#in~s2.offset := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, build_fullname_~directory.base, build_fullname_~directory.offset;havoc strcpy_#res.base, strcpy_#res.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset, strcpy_#t~post3.base, strcpy_#t~post3.offset, strcpy_#t~mem4, strcpy_~s1.base, strcpy_~s1.offset, strcpy_~s2.base, strcpy_~s2.offset, strcpy_~res~0.base, strcpy_~res~0.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#in~s1.base, strcpy_#in~s1.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#in~s2.base, strcpy_#in~s2.offset;strcpy_~res~0.base, strcpy_~res~0.offset := strcpy_~s1.base, strcpy_~s1.offset; 594#L508-3 strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); 595#L508-1 assume !(0 != strcpy_#t~mem4);havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset;havoc strcpy_#t~mem4; 600#L508-4 strcpy_#res.base, strcpy_#res.offset := strcpy_~res~0.base, strcpy_~res~0.offset; 601#L509 build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset := strcpy_#res.base, strcpy_#res.offset;havoc build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset;strchr_#in~t.base, strchr_#in~t.offset, strchr_#in~c := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, 0;havoc strchr_#res.base, strchr_#res.offset;havoc strchr_#t~mem5, strchr_#t~mem6, strchr_#t~pre7.base, strchr_#t~pre7.offset, strchr_~t.base, strchr_~t.offset, strchr_~c, strchr_~ch~0;strchr_~t.base, strchr_~t.offset := strchr_#in~t.base, strchr_#in~t.offset;strchr_~c := strchr_#in~c;havoc strchr_~ch~0;strchr_~ch~0 := (if strchr_~c % 256 <= 127 then strchr_~c % 256 else strchr_~c % 256 - 256); 603#L514-2 [2018-12-09 15:41:59,974 INFO L796 eck$LassoCheckResult]: Loop: 603#L514-2 assume !false;call strchr_#t~mem5 := read~int(strchr_~t.base, strchr_~t.offset, 1); 597#L515 assume !(strchr_#t~mem5 == strchr_~ch~0);havoc strchr_#t~mem5;call strchr_#t~mem6 := read~int(strchr_~t.base, strchr_~t.offset, 1); 599#L515-2 assume !(0 == strchr_#t~mem6);havoc strchr_#t~mem6;strchr_#t~pre7.base, strchr_#t~pre7.offset := strchr_~t.base, 1 + strchr_~t.offset;strchr_~t.base, strchr_~t.offset := strchr_~t.base, 1 + strchr_~t.offset;havoc strchr_#t~pre7.base, strchr_#t~pre7.offset; 603#L514-2 [2018-12-09 15:41:59,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:41:59,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1849486153, now seen corresponding path program 1 times [2018-12-09 15:41:59,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:41:59,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:41:59,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:59,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:41:59,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:41:59,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:42:00,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:42:00,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:42:00,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 15:42:00,014 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 15:42:00,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:42:00,014 INFO L82 PathProgramCache]: Analyzing trace with hash 85564, now seen corresponding path program 1 times [2018-12-09 15:42:00,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:42:00,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:42:00,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:42:00,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:42:00,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:42:00,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:42:00,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:42:00,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 15:42:00,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 15:42:00,048 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. cyclomatic complexity: 8 Second operand 6 states. [2018-12-09 15:42:00,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:42:00,100 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2018-12-09 15:42:00,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 15:42:00,101 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 32 transitions. [2018-12-09 15:42:00,101 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-12-09 15:42:00,102 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 32 transitions. [2018-12-09 15:42:00,102 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-12-09 15:42:00,102 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-12-09 15:42:00,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 32 transitions. [2018-12-09 15:42:00,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 15:42:00,102 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-12-09 15:42:00,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 32 transitions. [2018-12-09 15:42:00,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-12-09 15:42:00,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-09 15:42:00,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2018-12-09 15:42:00,104 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 31 transitions. [2018-12-09 15:42:00,104 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 31 transitions. [2018-12-09 15:42:00,104 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-09 15:42:00,104 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 31 transitions. [2018-12-09 15:42:00,104 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-12-09 15:42:00,104 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 15:42:00,104 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 15:42:00,105 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:42:00,105 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 15:42:00,105 INFO L794 eck$LassoCheckResult]: Stem: 679#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 674#L-1 havoc main_#res;havoc main_#t~nondet19, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_~dir_len~0, main_~file_len~0, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset, main_~output~0.base, main_~output~0.offset;main_~dir_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 675#L532 assume !(main_~dir_len~0 < 1);main_~file_len~0 := main_#t~nondet20;havoc main_#t~nondet20; 670#L534 assume !(main_~file_len~0 < 1);call main_#t~malloc21.base, main_#t~malloc21.offset := #Ultimate.alloc(main_~dir_len~0);main_~dir~0.base, main_~dir~0.offset := main_#t~malloc21.base, main_#t~malloc21.offset;call write~int(0, main_~dir~0.base, main_~dir~0.offset + (main_~dir_len~0 - 1), 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.alloc(main_~file_len~0);main_~file~0.base, main_~file~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~file~0.base, main_~file~0.offset + (main_~file_len~0 - 1), 1);call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.alloc(2 + (main_~dir_len~0 + main_~file_len~0));main_~output~0.base, main_~output~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset, build_fullname_#in~directory.base, build_fullname_#in~directory.offset, build_fullname_#in~filename.base, build_fullname_#in~filename.offset := main_~output~0.base, main_~output~0.offset, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset;havoc build_fullname_#t~mem8, build_fullname_#t~mem9, build_fullname_#t~short10, build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset, build_fullname_#t~mem12, build_fullname_#t~mem13, build_fullname_#t~short14, build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset, build_fullname_#t~ret16.base, build_fullname_#t~ret16.offset, build_fullname_#t~pre17.base, build_fullname_#t~pre17.offset, build_fullname_#t~ret18.base, build_fullname_#t~ret18.offset, build_fullname_~fullname.base, build_fullname_~fullname.offset, build_fullname_~directory.base, build_fullname_~directory.offset, build_fullname_~filename.base, build_fullname_~filename.offset, build_fullname_~dest~0.base, build_fullname_~dest~0.offset;build_fullname_~fullname.base, build_fullname_~fullname.offset := build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset;build_fullname_~directory.base, build_fullname_~directory.offset := build_fullname_#in~directory.base, build_fullname_#in~directory.offset;build_fullname_~filename.base, build_fullname_~filename.offset := build_fullname_#in~filename.base, build_fullname_#in~filename.offset;build_fullname_~dest~0.base, build_fullname_~dest~0.offset := build_fullname_~fullname.base, build_fullname_~fullname.offset;call build_fullname_#t~mem8 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 47 == build_fullname_#t~mem8; 671#L521 assume !build_fullname_#t~short10; 676#L521-2 assume !build_fullname_#t~short10;havoc build_fullname_#t~short10;havoc build_fullname_#t~mem9;havoc build_fullname_#t~mem8;call build_fullname_#t~mem12 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short14 := 46 != build_fullname_#t~mem12; 682#L523 assume build_fullname_#t~short14; 673#L523-2 assume build_fullname_#t~short14;havoc build_fullname_#t~mem12;havoc build_fullname_#t~mem13;havoc build_fullname_#t~short14;strcpy_#in~s1.base, strcpy_#in~s1.offset, strcpy_#in~s2.base, strcpy_#in~s2.offset := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, build_fullname_~directory.base, build_fullname_~directory.offset;havoc strcpy_#res.base, strcpy_#res.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset, strcpy_#t~post3.base, strcpy_#t~post3.offset, strcpy_#t~mem4, strcpy_~s1.base, strcpy_~s1.offset, strcpy_~s2.base, strcpy_~s2.offset, strcpy_~res~0.base, strcpy_~res~0.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#in~s1.base, strcpy_#in~s1.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#in~s2.base, strcpy_#in~s2.offset;strcpy_~res~0.base, strcpy_~res~0.offset := strcpy_~s1.base, strcpy_~s1.offset; 681#L508-3 strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); 660#L508-1 assume !(0 != strcpy_#t~mem4);havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset;havoc strcpy_#t~mem4; 664#L508-4 strcpy_#res.base, strcpy_#res.offset := strcpy_~res~0.base, strcpy_~res~0.offset; 665#L509 build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset := strcpy_#res.base, strcpy_#res.offset;havoc build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset;strchr_#in~t.base, strchr_#in~t.offset, strchr_#in~c := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, 0;havoc strchr_#res.base, strchr_#res.offset;havoc strchr_#t~mem5, strchr_#t~mem6, strchr_#t~pre7.base, strchr_#t~pre7.offset, strchr_~t.base, strchr_~t.offset, strchr_~c, strchr_~ch~0;strchr_~t.base, strchr_~t.offset := strchr_#in~t.base, strchr_#in~t.offset;strchr_~c := strchr_#in~c;havoc strchr_~ch~0;strchr_~ch~0 := (if strchr_~c % 256 <= 127 then strchr_~c % 256 else strchr_~c % 256 - 256); 667#L514-2 [2018-12-09 15:42:00,105 INFO L796 eck$LassoCheckResult]: Loop: 667#L514-2 assume !false;call strchr_#t~mem5 := read~int(strchr_~t.base, strchr_~t.offset, 1); 661#L515 assume !(strchr_#t~mem5 == strchr_~ch~0);havoc strchr_#t~mem5;call strchr_#t~mem6 := read~int(strchr_~t.base, strchr_~t.offset, 1); 663#L515-2 assume !(0 == strchr_#t~mem6);havoc strchr_#t~mem6;strchr_#t~pre7.base, strchr_#t~pre7.offset := strchr_~t.base, 1 + strchr_~t.offset;strchr_~t.base, strchr_~t.offset := strchr_~t.base, 1 + strchr_~t.offset;havoc strchr_#t~pre7.base, strchr_#t~pre7.offset; 667#L514-2 [2018-12-09 15:42:00,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:42:00,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1906744455, now seen corresponding path program 1 times [2018-12-09 15:42:00,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:42:00,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:42:00,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:42:00,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:42:00,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:42:00,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:42:00,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:42:00,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:42:00,125 INFO L82 PathProgramCache]: Analyzing trace with hash 85564, now seen corresponding path program 2 times [2018-12-09 15:42:00,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:42:00,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:42:00,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:42:00,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:42:00,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:42:00,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:42:00,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:42:00,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:42:00,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1413453764, now seen corresponding path program 1 times [2018-12-09 15:42:00,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:42:00,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:42:00,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:42:00,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 15:42:00,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:42:00,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:42:00,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:42:00,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:42:00,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 15:42:00,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 15:42:00,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 15:42:00,199 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. cyclomatic complexity: 8 Second operand 7 states. [2018-12-09 15:42:00,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:42:00,271 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2018-12-09 15:42:00,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 15:42:00,272 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 43 transitions. [2018-12-09 15:42:00,272 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-12-09 15:42:00,273 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 43 transitions. [2018-12-09 15:42:00,273 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2018-12-09 15:42:00,273 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2018-12-09 15:42:00,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 43 transitions. [2018-12-09 15:42:00,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 15:42:00,273 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-12-09 15:42:00,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 43 transitions. [2018-12-09 15:42:00,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2018-12-09 15:42:00,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-09 15:42:00,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2018-12-09 15:42:00,276 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2018-12-09 15:42:00,276 INFO L608 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2018-12-09 15:42:00,276 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-09 15:42:00,276 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 39 transitions. [2018-12-09 15:42:00,276 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-12-09 15:42:00,276 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 15:42:00,276 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 15:42:00,277 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:42:00,277 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 15:42:00,277 INFO L794 eck$LassoCheckResult]: Stem: 756#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 752#L-1 havoc main_#res;havoc main_#t~nondet19, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_~dir_len~0, main_~file_len~0, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset, main_~output~0.base, main_~output~0.offset;main_~dir_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 753#L532 assume !(main_~dir_len~0 < 1);main_~file_len~0 := main_#t~nondet20;havoc main_#t~nondet20; 747#L534 assume !(main_~file_len~0 < 1);call main_#t~malloc21.base, main_#t~malloc21.offset := #Ultimate.alloc(main_~dir_len~0);main_~dir~0.base, main_~dir~0.offset := main_#t~malloc21.base, main_#t~malloc21.offset;call write~int(0, main_~dir~0.base, main_~dir~0.offset + (main_~dir_len~0 - 1), 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.alloc(main_~file_len~0);main_~file~0.base, main_~file~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~file~0.base, main_~file~0.offset + (main_~file_len~0 - 1), 1);call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.alloc(2 + (main_~dir_len~0 + main_~file_len~0));main_~output~0.base, main_~output~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset, build_fullname_#in~directory.base, build_fullname_#in~directory.offset, build_fullname_#in~filename.base, build_fullname_#in~filename.offset := main_~output~0.base, main_~output~0.offset, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset;havoc build_fullname_#t~mem8, build_fullname_#t~mem9, build_fullname_#t~short10, build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset, build_fullname_#t~mem12, build_fullname_#t~mem13, build_fullname_#t~short14, build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset, build_fullname_#t~ret16.base, build_fullname_#t~ret16.offset, build_fullname_#t~pre17.base, build_fullname_#t~pre17.offset, build_fullname_#t~ret18.base, build_fullname_#t~ret18.offset, build_fullname_~fullname.base, build_fullname_~fullname.offset, build_fullname_~directory.base, build_fullname_~directory.offset, build_fullname_~filename.base, build_fullname_~filename.offset, build_fullname_~dest~0.base, build_fullname_~dest~0.offset;build_fullname_~fullname.base, build_fullname_~fullname.offset := build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset;build_fullname_~directory.base, build_fullname_~directory.offset := build_fullname_#in~directory.base, build_fullname_#in~directory.offset;build_fullname_~filename.base, build_fullname_~filename.offset := build_fullname_#in~filename.base, build_fullname_#in~filename.offset;build_fullname_~dest~0.base, build_fullname_~dest~0.offset := build_fullname_~fullname.base, build_fullname_~fullname.offset;call build_fullname_#t~mem8 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 47 == build_fullname_#t~mem8; 748#L521 assume !build_fullname_#t~short10; 754#L521-2 assume !build_fullname_#t~short10;havoc build_fullname_#t~short10;havoc build_fullname_#t~mem9;havoc build_fullname_#t~mem8;call build_fullname_#t~mem12 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short14 := 46 != build_fullname_#t~mem12; 760#L523 assume build_fullname_#t~short14; 750#L523-2 assume build_fullname_#t~short14;havoc build_fullname_#t~mem12;havoc build_fullname_#t~mem13;havoc build_fullname_#t~short14;strcpy_#in~s1.base, strcpy_#in~s1.offset, strcpy_#in~s2.base, strcpy_#in~s2.offset := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, build_fullname_~directory.base, build_fullname_~directory.offset;havoc strcpy_#res.base, strcpy_#res.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset, strcpy_#t~post3.base, strcpy_#t~post3.offset, strcpy_#t~mem4, strcpy_~s1.base, strcpy_~s1.offset, strcpy_~s2.base, strcpy_~s2.offset, strcpy_~res~0.base, strcpy_~res~0.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#in~s1.base, strcpy_#in~s1.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#in~s2.base, strcpy_#in~s2.offset;strcpy_~res~0.base, strcpy_~res~0.offset := strcpy_~s1.base, strcpy_~s1.offset; 735#L508-3 strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); 736#L508-1 assume !!(0 != strcpy_#t~mem4);havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset;havoc strcpy_#t~mem4; 737#L508-3 strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); 738#L508-1 assume !(0 != strcpy_#t~mem4);havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset;havoc strcpy_#t~mem4; 742#L508-4 strcpy_#res.base, strcpy_#res.offset := strcpy_~res~0.base, strcpy_~res~0.offset; 743#L509 build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset := strcpy_#res.base, strcpy_#res.offset;havoc build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset;strchr_#in~t.base, strchr_#in~t.offset, strchr_#in~c := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, 0;havoc strchr_#res.base, strchr_#res.offset;havoc strchr_#t~mem5, strchr_#t~mem6, strchr_#t~pre7.base, strchr_#t~pre7.offset, strchr_~t.base, strchr_~t.offset, strchr_~c, strchr_~ch~0;strchr_~t.base, strchr_~t.offset := strchr_#in~t.base, strchr_#in~t.offset;strchr_~c := strchr_#in~c;havoc strchr_~ch~0;strchr_~ch~0 := (if strchr_~c % 256 <= 127 then strchr_~c % 256 else strchr_~c % 256 - 256); 757#L514-2 [2018-12-09 15:42:00,277 INFO L796 eck$LassoCheckResult]: Loop: 757#L514-2 assume !false;call strchr_#t~mem5 := read~int(strchr_~t.base, strchr_~t.offset, 1); 764#L515 assume !(strchr_#t~mem5 == strchr_~ch~0);havoc strchr_#t~mem5;call strchr_#t~mem6 := read~int(strchr_~t.base, strchr_~t.offset, 1); 762#L515-2 assume !(0 == strchr_#t~mem6);havoc strchr_#t~mem6;strchr_#t~pre7.base, strchr_#t~pre7.offset := strchr_~t.base, 1 + strchr_~t.offset;strchr_~t.base, strchr_~t.offset := strchr_~t.base, 1 + strchr_~t.offset;havoc strchr_#t~pre7.base, strchr_#t~pre7.offset; 757#L514-2 [2018-12-09 15:42:00,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:42:00,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1571186846, now seen corresponding path program 1 times [2018-12-09 15:42:00,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:42:00,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:42:00,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:42:00,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:42:00,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:42:00,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:42:00,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:42:00,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:42:00,294 INFO L82 PathProgramCache]: Analyzing trace with hash 85564, now seen corresponding path program 3 times [2018-12-09 15:42:00,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:42:00,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:42:00,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:42:00,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:42:00,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:42:00,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:42:00,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:42:00,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:42:00,298 INFO L82 PathProgramCache]: Analyzing trace with hash 673793151, now seen corresponding path program 1 times [2018-12-09 15:42:00,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:42:00,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:42:00,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:42:00,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 15:42:00,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:42:00,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:42:00,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:42:01,451 WARN L180 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 269 DAG size of output: 227 [2018-12-09 15:42:02,400 WARN L180 SmtUtils]: Spent 940.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 169 [2018-12-09 15:42:02,403 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 15:42:02,403 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 15:42:02,403 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 15:42:02,403 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 15:42:02,403 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 15:42:02,403 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 15:42:02,403 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 15:42:02,403 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 15:42:02,403 INFO L131 ssoRankerPreferences]: Filename of dumped script: build_fullname_true-termination.c.i_Iteration6_Lasso [2018-12-09 15:42:02,403 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 15:42:02,403 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 15:42:02,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:42:02,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:42:02,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:42:02,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:42:02,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:42:02,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:42:02,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:42:02,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:42:02,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:42:02,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:42:02,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:42:03,061 WARN L180 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 152 [2018-12-09 15:42:03,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:42:03,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:42:03,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:42:03,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:42:03,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:42:03,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:42:03,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:42:03,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:42:03,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:42:03,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:42:03,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:42:03,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:42:03,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:42:03,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:42:03,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:42:03,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:42:03,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:42:03,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:42:03,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:42:03,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:42:03,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:42:03,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:42:03,382 WARN L180 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 92 [2018-12-09 15:42:03,871 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 38 [2018-12-09 15:42:03,893 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 15:42:03,893 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 15:42:03,893 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:42:03,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:42:03,894 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:42:03,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:42:03,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:42:03,894 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:42:03,895 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:42:03,895 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:42:03,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:42:03,896 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:42:03,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:42:03,896 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:42:03,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:42:03,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:42:03,896 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:42:03,897 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:42:03,897 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:42:03,897 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:42:03,897 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:42:03,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:42:03,897 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:42:03,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:42:03,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:42:03,898 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:42:03,898 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:42:03,898 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:42:03,898 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:42:03,899 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:42:03,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:42:03,899 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:42:03,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:42:03,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:42:03,899 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:42:03,899 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:42:03,899 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:42:03,900 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:42:03,900 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:42:03,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:42:03,900 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:42:03,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:42:03,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:42:03,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:42:03,901 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:42:03,901 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:42:03,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:42:03,901 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:42:03,901 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:42:03,901 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:42:03,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:42:03,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:42:03,902 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:42:03,902 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:42:03,902 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:42:03,902 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:42:03,902 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:42:03,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:42:03,903 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:42:03,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:42:03,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:42:03,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:42:03,903 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:42:03,903 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:42:03,903 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:42:03,904 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:42:03,904 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:42:03,904 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:42:03,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:42:03,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:42:03,904 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:42:03,904 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:42:03,904 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:42:03,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:42:03,905 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:42:03,905 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:42:03,905 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:42:03,905 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:42:03,905 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:42:03,906 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:42:03,906 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:42:03,906 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:42:03,906 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:42:03,906 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:42:03,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:42:03,907 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:42:03,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:42:03,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:42:03,907 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:42:03,907 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:42:03,907 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:42:03,907 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:42:03,908 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:42:03,908 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:42:03,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:42:03,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:42:03,908 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:42:03,908 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:42:03,909 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:42:03,910 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:42:03,910 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:42:03,910 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:42:03,911 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:42:03,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:42:03,911 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:42:03,911 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:42:03,911 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:42:03,914 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:42:03,914 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:42:03,915 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:42:03,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:42:03,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:42:03,915 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:42:03,915 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:42:03,915 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:42:03,916 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:42:03,917 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:42:03,917 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:42:03,917 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:42:03,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:42:03,917 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:42:03,917 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:42:03,918 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:42:03,918 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:42:03,918 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:42:03,918 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:42:03,918 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:42:03,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:42:03,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:42:03,919 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:42:03,922 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:42:03,922 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:42:03,941 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 15:42:03,957 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-09 15:42:03,957 INFO L444 ModelExtractionUtils]: 86 out of 91 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-09 15:42:03,957 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 15:42:03,958 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 15:42:03,958 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 15:42:03,958 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc23.base)_3, ULTIMATE.start_strchr_~t.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc23.base)_3 - 1*ULTIMATE.start_strchr_~t.offset Supporting invariants [] [2018-12-09 15:42:04,088 INFO L297 tatePredicateManager]: 49 out of 50 supporting invariants were superfluous and have been removed [2018-12-09 15:42:04,090 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-09 15:42:04,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:42:04,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:42:04,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:42:04,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:42:04,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:42:04,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:42:04,139 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-12-09 15:42:04,139 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 39 transitions. cyclomatic complexity: 10 Second operand 4 states. [2018-12-09 15:42:04,168 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 39 transitions. cyclomatic complexity: 10. Second operand 4 states. Result 42 states and 54 transitions. Complement of second has 5 states. [2018-12-09 15:42:04,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-09 15:42:04,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-09 15:42:04,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2018-12-09 15:42:04,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 14 letters. Loop has 3 letters. [2018-12-09 15:42:04,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 15:42:04,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 17 letters. Loop has 3 letters. [2018-12-09 15:42:04,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 15:42:04,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 14 letters. Loop has 6 letters. [2018-12-09 15:42:04,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 15:42:04,169 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 54 transitions. [2018-12-09 15:42:04,169 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 15:42:04,170 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 35 states and 43 transitions. [2018-12-09 15:42:04,170 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-12-09 15:42:04,170 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-12-09 15:42:04,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 43 transitions. [2018-12-09 15:42:04,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 15:42:04,170 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 43 transitions. [2018-12-09 15:42:04,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 43 transitions. [2018-12-09 15:42:04,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-12-09 15:42:04,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-09 15:42:04,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2018-12-09 15:42:04,171 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2018-12-09 15:42:04,171 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2018-12-09 15:42:04,171 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-09 15:42:04,171 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 40 transitions. [2018-12-09 15:42:04,172 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 15:42:04,172 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 15:42:04,172 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 15:42:04,172 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:42:04,172 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 15:42:04,172 INFO L794 eck$LassoCheckResult]: Stem: 1113#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1108#L-1 havoc main_#res;havoc main_#t~nondet19, main_#t~nondet20, main_#t~malloc21.base, main_#t~malloc21.offset, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_~dir_len~0, main_~file_len~0, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset, main_~output~0.base, main_~output~0.offset;main_~dir_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 1109#L532 assume !(main_~dir_len~0 < 1);main_~file_len~0 := main_#t~nondet20;havoc main_#t~nondet20; 1101#L534 assume !(main_~file_len~0 < 1);call main_#t~malloc21.base, main_#t~malloc21.offset := #Ultimate.alloc(main_~dir_len~0);main_~dir~0.base, main_~dir~0.offset := main_#t~malloc21.base, main_#t~malloc21.offset;call write~int(0, main_~dir~0.base, main_~dir~0.offset + (main_~dir_len~0 - 1), 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.alloc(main_~file_len~0);main_~file~0.base, main_~file~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~file~0.base, main_~file~0.offset + (main_~file_len~0 - 1), 1);call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.alloc(2 + (main_~dir_len~0 + main_~file_len~0));main_~output~0.base, main_~output~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset, build_fullname_#in~directory.base, build_fullname_#in~directory.offset, build_fullname_#in~filename.base, build_fullname_#in~filename.offset := main_~output~0.base, main_~output~0.offset, main_~dir~0.base, main_~dir~0.offset, main_~file~0.base, main_~file~0.offset;havoc build_fullname_#t~mem8, build_fullname_#t~mem9, build_fullname_#t~short10, build_fullname_#t~pre11.base, build_fullname_#t~pre11.offset, build_fullname_#t~mem12, build_fullname_#t~mem13, build_fullname_#t~short14, build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset, build_fullname_#t~ret16.base, build_fullname_#t~ret16.offset, build_fullname_#t~pre17.base, build_fullname_#t~pre17.offset, build_fullname_#t~ret18.base, build_fullname_#t~ret18.offset, build_fullname_~fullname.base, build_fullname_~fullname.offset, build_fullname_~directory.base, build_fullname_~directory.offset, build_fullname_~filename.base, build_fullname_~filename.offset, build_fullname_~dest~0.base, build_fullname_~dest~0.offset;build_fullname_~fullname.base, build_fullname_~fullname.offset := build_fullname_#in~fullname.base, build_fullname_#in~fullname.offset;build_fullname_~directory.base, build_fullname_~directory.offset := build_fullname_#in~directory.base, build_fullname_#in~directory.offset;build_fullname_~filename.base, build_fullname_~filename.offset := build_fullname_#in~filename.base, build_fullname_#in~filename.offset;build_fullname_~dest~0.base, build_fullname_~dest~0.offset := build_fullname_~fullname.base, build_fullname_~fullname.offset;call build_fullname_#t~mem8 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short10 := 47 == build_fullname_#t~mem8; 1102#L521 assume !build_fullname_#t~short10; 1110#L521-2 assume !build_fullname_#t~short10;havoc build_fullname_#t~short10;havoc build_fullname_#t~mem9;havoc build_fullname_#t~mem8;call build_fullname_#t~mem12 := read~int(build_fullname_~directory.base, build_fullname_~directory.offset, 1);build_fullname_#t~short14 := 46 != build_fullname_#t~mem12; 1120#L523 assume build_fullname_#t~short14; 1106#L523-2 assume build_fullname_#t~short14;havoc build_fullname_#t~mem12;havoc build_fullname_#t~mem13;havoc build_fullname_#t~short14;strcpy_#in~s1.base, strcpy_#in~s1.offset, strcpy_#in~s2.base, strcpy_#in~s2.offset := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, build_fullname_~directory.base, build_fullname_~directory.offset;havoc strcpy_#res.base, strcpy_#res.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset, strcpy_#t~post3.base, strcpy_#t~post3.offset, strcpy_#t~mem4, strcpy_~s1.base, strcpy_~s1.offset, strcpy_~s2.base, strcpy_~s2.offset, strcpy_~res~0.base, strcpy_~res~0.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#in~s1.base, strcpy_#in~s1.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#in~s2.base, strcpy_#in~s2.offset;strcpy_~res~0.base, strcpy_~res~0.offset := strcpy_~s1.base, strcpy_~s1.offset; 1119#L508-3 strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); 1118#L508-1 assume !(0 != strcpy_#t~mem4);havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset;havoc strcpy_#t~mem4; 1097#L508-4 strcpy_#res.base, strcpy_#res.offset := strcpy_~res~0.base, strcpy_~res~0.offset; 1098#L509 build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset := strcpy_#res.base, strcpy_#res.offset;havoc build_fullname_#t~ret15.base, build_fullname_#t~ret15.offset;strchr_#in~t.base, strchr_#in~t.offset, strchr_#in~c := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, 0;havoc strchr_#res.base, strchr_#res.offset;havoc strchr_#t~mem5, strchr_#t~mem6, strchr_#t~pre7.base, strchr_#t~pre7.offset, strchr_~t.base, strchr_~t.offset, strchr_~c, strchr_~ch~0;strchr_~t.base, strchr_~t.offset := strchr_#in~t.base, strchr_#in~t.offset;strchr_~c := strchr_#in~c;havoc strchr_~ch~0;strchr_~ch~0 := (if strchr_~c % 256 <= 127 then strchr_~c % 256 else strchr_~c % 256 - 256); 1107#L514-2 assume !false;call strchr_#t~mem5 := read~int(strchr_~t.base, strchr_~t.offset, 1); 1092#L515 assume strchr_#t~mem5 == strchr_~ch~0;havoc strchr_#t~mem5; 1093#L514-3 strchr_#res.base, strchr_#res.offset := strchr_~t.base, strchr_~t.offset; 1099#L517 build_fullname_#t~ret16.base, build_fullname_#t~ret16.offset := strchr_#res.base, strchr_#res.offset;build_fullname_~dest~0.base, build_fullname_~dest~0.offset := build_fullname_#t~ret16.base, build_fullname_#t~ret16.offset;havoc build_fullname_#t~ret16.base, build_fullname_#t~ret16.offset;call write~int(47, build_fullname_~dest~0.base, build_fullname_~dest~0.offset, 1);build_fullname_#t~pre17.base, build_fullname_#t~pre17.offset := build_fullname_~dest~0.base, 1 + build_fullname_~dest~0.offset;build_fullname_~dest~0.base, build_fullname_~dest~0.offset := build_fullname_~dest~0.base, 1 + build_fullname_~dest~0.offset;havoc build_fullname_#t~pre17.base, build_fullname_#t~pre17.offset; 1116#L523-4 strcpy_#in~s1.base, strcpy_#in~s1.offset, strcpy_#in~s2.base, strcpy_#in~s2.offset := build_fullname_~dest~0.base, build_fullname_~dest~0.offset, build_fullname_~filename.base, build_fullname_~filename.offset;havoc strcpy_#res.base, strcpy_#res.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset, strcpy_#t~post3.base, strcpy_#t~post3.offset, strcpy_#t~mem4, strcpy_~s1.base, strcpy_~s1.offset, strcpy_~s2.base, strcpy_~s2.offset, strcpy_~res~0.base, strcpy_~res~0.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#in~s1.base, strcpy_#in~s1.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#in~s2.base, strcpy_#in~s2.offset;strcpy_~res~0.base, strcpy_~res~0.offset := strcpy_~s1.base, strcpy_~s1.offset; 1104#L508-8 [2018-12-09 15:42:04,172 INFO L796 eck$LassoCheckResult]: Loop: 1104#L508-8 strcpy_#t~post2.base, strcpy_#t~post2.offset := strcpy_~s1.base, strcpy_~s1.offset;strcpy_~s1.base, strcpy_~s1.offset := strcpy_#t~post2.base, 1 + strcpy_#t~post2.offset;strcpy_#t~post3.base, strcpy_#t~post3.offset := strcpy_~s2.base, strcpy_~s2.offset;strcpy_~s2.base, strcpy_~s2.offset := strcpy_#t~post3.base, 1 + strcpy_#t~post3.offset;call strcpy_#t~mem4 := read~int(strcpy_#t~post3.base, strcpy_#t~post3.offset, 1);call write~int(strcpy_#t~mem4, strcpy_#t~post2.base, strcpy_#t~post2.offset, 1); 1103#L508-6 assume !!(0 != strcpy_#t~mem4);havoc strcpy_#t~post3.base, strcpy_#t~post3.offset;havoc strcpy_#t~post2.base, strcpy_#t~post2.offset;havoc strcpy_#t~mem4; 1104#L508-8 [2018-12-09 15:42:04,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:42:04,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1119349231, now seen corresponding path program 1 times [2018-12-09 15:42:04,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:42:04,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:42:04,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:42:04,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:42:04,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:42:04,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:42:04,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:42:04,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:42:04,192 INFO L82 PathProgramCache]: Analyzing trace with hash 3590, now seen corresponding path program 2 times [2018-12-09 15:42:04,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:42:04,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:42:04,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:42:04,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:42:04,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:42:04,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:42:04,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:42:04,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:42:04,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1952789620, now seen corresponding path program 1 times [2018-12-09 15:42:04,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:42:04,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:42:04,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:42:04,198 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 15:42:04,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:42:04,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:42:04,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:42:05,326 WARN L180 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 280 DAG size of output: 224 [2018-12-09 15:42:05,578 WARN L180 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2018-12-09 15:42:05,580 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 15:42:05,580 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 15:42:05,580 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 15:42:05,580 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 15:42:05,580 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 15:42:05,580 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 15:42:05,580 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 15:42:05,580 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 15:42:05,580 INFO L131 ssoRankerPreferences]: Filename of dumped script: build_fullname_true-termination.c.i_Iteration7_Lasso [2018-12-09 15:42:05,580 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 15:42:05,580 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 15:42:05,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:42:05,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:42:05,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:42:05,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:42:05,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:42:05,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:42:05,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:42:05,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:42:05,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:42:05,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:42:05,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:42:05,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:42:05,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:42:05,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:42:05,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:42:05,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:42:05,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:42:05,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:42:05,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:42:05,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:42:05,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:42:05,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:42:05,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:42:05,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:42:05,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:42:05,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:42:05,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:42:06,257 WARN L180 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 136 [2018-12-09 15:42:06,415 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 94 [2018-12-09 15:42:06,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:42:06,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:42:06,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:42:06,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:42:06,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:42:06,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:42:06,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:42:06,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:42:06,978 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 15:42:06,978 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 15:42:06,978 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:42:06,978 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:42:06,978 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:42:06,978 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:42:06,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:42:06,979 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:42:06,979 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:42:06,979 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:42:06,979 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:42:06,979 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:42:06,979 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:42:06,979 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:42:06,979 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:42:06,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:42:06,980 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:42:06,980 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:42:06,980 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:42:06,980 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:42:06,980 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:42:06,980 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:42:06,980 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:42:06,980 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:42:06,980 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:42:06,980 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:42:06,981 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:42:06,981 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:42:06,981 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:42:06,981 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:42:06,981 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:42:06,981 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:42:06,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:42:06,981 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:42:06,981 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:42:06,981 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:42:06,981 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:42:06,982 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:42:06,982 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:42:06,982 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:42:06,982 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:42:06,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:42:06,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:42:06,982 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:42:06,982 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:42:06,982 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:42:06,982 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:42:06,983 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:42:06,983 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:42:06,983 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:42:06,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:42:06,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:42:06,983 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:42:06,983 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:42:06,983 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:42:06,983 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:42:06,983 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:42:06,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:42:06,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:42:06,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:42:06,984 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:42:06,984 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:42:06,984 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:42:06,985 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:42:06,985 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:42:06,985 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:42:06,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:42:06,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:42:06,985 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:42:06,985 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:42:06,986 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:42:06,986 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:42:06,986 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:42:06,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:42:06,986 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:42:06,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:42:06,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:42:06,987 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:42:06,987 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:42:06,987 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:42:06,987 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:42:06,987 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:42:06,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:42:06,987 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:42:06,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:42:06,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:42:06,987 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:42:06,988 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:42:06,988 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:42:06,988 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:42:06,988 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:42:06,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:42:06,988 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:42:06,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:42:06,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:42:06,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:42:06,988 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:42:06,989 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:42:06,989 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:42:06,989 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:42:06,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:42:06,989 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:42:06,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:42:06,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:42:06,989 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:42:06,989 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:42:06,989 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:42:06,990 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:42:06,990 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:42:06,990 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:42:06,990 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:42:06,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:42:06,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:42:06,990 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:42:06,990 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:42:06,990 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:42:06,991 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:42:06,991 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:42:06,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:42:06,991 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:42:06,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:42:06,991 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:42:06,991 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:42:06,991 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:42:06,991 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:42:06,991 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:42:06,991 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:42:06,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:42:06,992 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:42:06,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:42:06,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:42:06,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:42:06,992 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:42:06,992 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:42:06,992 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:42:06,992 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:42:06,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:42:06,992 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:42:06,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:42:06,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:42:06,993 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:42:06,993 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:42:06,993 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:42:06,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:42:06,993 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:42:06,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:42:06,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:42:06,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:42:06,993 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:42:06,994 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:42:06,994 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:42:06,994 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:42:06,995 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:42:06,995 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:42:06,995 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:42:06,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:42:06,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:42:06,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:42:06,995 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:42:06,995 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:42:06,995 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:42:06,996 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:42:06,996 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:42:06,996 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:42:06,996 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:42:06,996 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:42:06,996 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:42:06,996 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:42:06,997 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:42:06,997 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:42:06,997 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:42:06,997 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:42:06,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:42:06,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:42:06,997 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:42:06,997 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:42:06,998 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:42:06,998 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:42:06,998 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:42:06,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:42:06,998 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:42:06,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:42:06,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:42:06,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:42:06,998 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:42:06,998 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:42:06,999 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:42:06,999 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:42:06,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:42:06,999 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:42:06,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:42:06,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:42:06,999 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:42:06,999 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:42:06,999 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:42:07,000 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:42:07,000 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:42:07,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:42:07,000 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:42:07,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:42:07,000 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:42:07,000 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:42:07,000 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:42:07,000 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:42:07,001 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:42:07,001 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:42:07,001 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:42:07,001 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:42:07,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:42:07,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:42:07,001 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:42:07,002 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:42:07,002 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:42:07,002 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:42:07,002 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:42:07,002 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:42:07,002 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:42:07,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:42:07,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:42:07,003 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:42:07,003 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:42:07,003 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:42:07,003 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:42:07,003 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:42:07,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:42:07,003 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:42:07,004 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:42:07,004 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:42:07,004 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:42:07,004 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:42:07,004 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:42:07,004 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:42:07,004 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:42:07,004 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:42:07,004 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:42:07,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:42:07,005 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:42:07,005 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:42:07,005 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:42:07,005 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:42:07,006 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:42:07,006 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:42:07,006 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 15:42:07,006 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:42:07,006 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:42:07,007 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 15:42:07,007 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:42:07,012 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:42:07,012 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:42:07,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:42:07,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:42:07,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:42:07,012 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:42:07,013 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:42:07,013 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:42:07,014 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:42:07,015 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:42:07,015 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:42:07,015 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:42:07,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:42:07,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:42:07,015 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:42:07,015 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:42:07,015 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:42:07,015 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:42:07,016 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:42:07,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:42:07,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:42:07,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:42:07,016 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:42:07,016 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:42:07,016 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:42:07,017 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:42:07,017 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:42:07,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:42:07,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:42:07,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:42:07,018 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:42:07,018 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:42:07,018 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:42:07,019 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:42:07,019 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:42:07,019 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:42:07,019 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:42:07,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:42:07,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:42:07,019 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:42:07,020 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:42:07,020 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:42:07,020 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:42:07,020 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:42:07,020 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:42:07,020 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:42:07,020 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:42:07,020 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 15:42:07,020 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:42:07,021 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 15:42:07,021 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:42:07,021 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:42:07,021 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:42:07,022 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:42:07,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:42:07,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:42:07,022 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:42:07,022 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:42:07,022 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:42:07,023 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:42:07,023 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:42:07,023 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:42:07,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:42:07,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:42:07,023 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:42:07,024 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:42:07,024 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:42:07,025 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:42:07,026 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:42:07,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:42:07,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:42:07,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:42:07,026 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:42:07,026 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:42:07,026 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:42:07,027 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:42:07,027 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:42:07,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:42:07,027 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 15:42:07,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:42:07,028 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:42:07,028 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 15:42:07,028 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:42:07,030 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:42:07,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-12-09 15:42:07,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:42:07,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:42:07,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:42:07,031 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:42:07,031 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:42:07,031 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:42:07,033 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:42:07,033 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:42:07,033 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:42:07,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:42:07,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:42:07,033 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:42:07,034 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:42:07,034 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:42:07,034 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:42:07,035 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 15:42:07,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:42:07,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:42:07,035 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:42:07,035 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:42:07,037 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:42:07,037 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:42:07,050 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 15:42:07,067 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-12-09 15:42:07,067 INFO L444 ModelExtractionUtils]: 83 out of 88 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-09 15:42:07,067 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 15:42:07,068 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 15:42:07,068 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 15:42:07,068 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_strcpy_~s2.base)_4, ULTIMATE.start_strcpy_~s2.offset) = 1*v_rep(select #length ULTIMATE.start_strcpy_~s2.base)_4 - 1*ULTIMATE.start_strcpy_~s2.offset Supporting invariants [] [2018-12-09 15:42:07,259 INFO L297 tatePredicateManager]: 55 out of 55 supporting invariants were superfluous and have been removed [2018-12-09 15:42:07,260 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-09 15:42:07,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:42:07,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:42:07,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:42:07,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:42:07,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:42:07,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:42:07,304 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-09 15:42:07,304 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 40 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-12-09 15:42:07,309 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 40 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 35 states and 42 transitions. Complement of second has 4 states. [2018-12-09 15:42:07,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-09 15:42:07,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 15:42:07,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2018-12-09 15:42:07,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 17 letters. Loop has 2 letters. [2018-12-09 15:42:07,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 15:42:07,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 19 letters. Loop has 2 letters. [2018-12-09 15:42:07,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 15:42:07,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 17 letters. Loop has 4 letters. [2018-12-09 15:42:07,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 15:42:07,311 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 42 transitions. [2018-12-09 15:42:07,312 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 15:42:07,312 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 0 states and 0 transitions. [2018-12-09 15:42:07,312 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-09 15:42:07,312 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-09 15:42:07,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-09 15:42:07,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 15:42:07,313 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 15:42:07,313 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 15:42:07,313 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 15:42:07,313 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-09 15:42:07,313 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-09 15:42:07,313 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 15:42:07,313 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-09 15:42:07,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.12 03:42:07 BoogieIcfgContainer [2018-12-09 15:42:07,318 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-09 15:42:07,319 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 15:42:07,319 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 15:42:07,319 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 15:42:07,319 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:41:55" (3/4) ... [2018-12-09 15:42:07,321 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 15:42:07,321 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 15:42:07,322 INFO L168 Benchmark]: Toolchain (without parser) took 12712.72 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 469.8 MB). Free memory was 951.7 MB in the beginning and 799.1 MB in the end (delta: 152.7 MB). Peak memory consumption was 622.4 MB. Max. memory is 11.5 GB. [2018-12-09 15:42:07,323 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 15:42:07,323 INFO L168 Benchmark]: CACSL2BoogieTranslator took 271.29 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.4 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -148.5 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2018-12-09 15:42:07,324 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.52 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 15:42:07,324 INFO L168 Benchmark]: Boogie Preprocessor took 16.53 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2018-12-09 15:42:07,324 INFO L168 Benchmark]: RCFGBuilder took 202.34 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. [2018-12-09 15:42:07,325 INFO L168 Benchmark]: BuchiAutomizer took 12190.49 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 353.4 MB). Free memory was 1.1 GB in the beginning and 799.1 MB in the end (delta: 268.6 MB). Peak memory consumption was 622.0 MB. Max. memory is 11.5 GB. [2018-12-09 15:42:07,325 INFO L168 Benchmark]: Witness Printer took 3.04 ms. Allocated memory is still 1.5 GB. Free memory is still 799.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 15:42:07,328 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 271.29 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.4 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -148.5 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.52 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.53 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 202.34 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 12190.49 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 353.4 MB). Free memory was 1.1 GB in the beginning and 799.1 MB in the end (delta: 268.6 MB). Peak memory consumption was 622.0 MB. Max. memory is 11.5 GB. * Witness Printer took 3.04 ms. Allocated memory is still 1.5 GB. Free memory is still 799.1 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 - 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 7 terminating modules (3 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * s1 + unknown-#length-unknown[__builtin_alloca (dir_len+file_len+2)] and consists of 6 locations. One deterministic module has affine ranking function -1 * s1 + unknown-#length-unknown[__builtin_alloca (dir_len)] and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (dir_len+file_len+2)] + -1 * t and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[s2] + -1 * s2 and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 12.1s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 11.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 12 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 33 states and ocurred in iteration 6. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 142 SDtfs, 145 SDslu, 155 SDs, 0 SdLazy, 193 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU2 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital548 mio100 ax100 hnf99 lsp98 ukn60 mio100 lsp44 div100 bol100 ite100 ukn100 eq203 hnf86 smp98 dnf127 smp86 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 2 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 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...