./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-libowfat/strdup_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_c2c96396-7eed-4b1d-b3c5-c7c5779e7682/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c2c96396-7eed-4b1d-b3c5-c7c5779e7682/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c2c96396-7eed-4b1d-b3c5-c7c5779e7682/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c2c96396-7eed-4b1d-b3c5-c7c5779e7682/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-libowfat/strdup_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c2c96396-7eed-4b1d-b3c5-c7c5779e7682/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c2c96396-7eed-4b1d-b3c5-c7c5779e7682/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 eb36eb172eada83da57fd9fdc6a0c3dfe0bc61fe .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 00:01:38,811 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 00:01:38,812 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 00:01:38,819 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 00:01:38,820 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 00:01:38,820 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 00:01:38,821 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 00:01:38,821 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 00:01:38,822 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 00:01:38,823 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 00:01:38,823 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 00:01:38,823 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 00:01:38,824 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 00:01:38,824 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 00:01:38,825 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 00:01:38,825 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 00:01:38,825 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 00:01:38,826 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 00:01:38,827 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 00:01:38,828 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 00:01:38,828 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 00:01:38,829 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 00:01:38,831 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 00:01:38,831 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 00:01:38,831 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 00:01:38,832 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 00:01:38,832 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 00:01:38,832 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 00:01:38,833 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 00:01:38,833 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 00:01:38,833 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 00:01:38,834 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 00:01:38,834 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 00:01:38,834 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 00:01:38,834 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 00:01:38,835 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 00:01:38,835 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c2c96396-7eed-4b1d-b3c5-c7c5779e7682/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-09 00:01:38,845 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 00:01:38,846 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 00:01:38,847 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 00:01:38,847 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 00:01:38,847 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 00:01:38,847 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-09 00:01:38,847 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-09 00:01:38,847 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-09 00:01:38,848 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-09 00:01:38,848 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-09 00:01:38,848 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-09 00:01:38,848 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 00:01:38,848 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 00:01:38,848 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 00:01:38,848 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 00:01:38,849 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-09 00:01:38,849 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-09 00:01:38,849 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-09 00:01:38,849 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 00:01:38,849 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-09 00:01:38,849 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 00:01:38,850 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-09 00:01:38,850 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 00:01:38,850 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 00:01:38,850 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-09 00:01:38,850 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 00:01:38,850 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 00:01:38,850 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-09 00:01:38,851 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-09 00:01:38,851 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_c2c96396-7eed-4b1d-b3c5-c7c5779e7682/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 -> eb36eb172eada83da57fd9fdc6a0c3dfe0bc61fe [2018-12-09 00:01:38,874 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 00:01:38,880 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 00:01:38,882 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 00:01:38,883 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 00:01:38,883 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 00:01:38,884 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c2c96396-7eed-4b1d-b3c5-c7c5779e7682/bin-2019/uautomizer/../../sv-benchmarks/c/termination-libowfat/strdup_true-termination.c.i [2018-12-09 00:01:38,919 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c2c96396-7eed-4b1d-b3c5-c7c5779e7682/bin-2019/uautomizer/data/f5d1f7b2b/ad209865b5e6491c89461334d534a403/FLAGd16c9118a [2018-12-09 00:01:39,393 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 00:01:39,394 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c2c96396-7eed-4b1d-b3c5-c7c5779e7682/sv-benchmarks/c/termination-libowfat/strdup_true-termination.c.i [2018-12-09 00:01:39,401 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c2c96396-7eed-4b1d-b3c5-c7c5779e7682/bin-2019/uautomizer/data/f5d1f7b2b/ad209865b5e6491c89461334d534a403/FLAGd16c9118a [2018-12-09 00:01:39,410 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c2c96396-7eed-4b1d-b3c5-c7c5779e7682/bin-2019/uautomizer/data/f5d1f7b2b/ad209865b5e6491c89461334d534a403 [2018-12-09 00:01:39,412 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 00:01:39,413 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 00:01:39,414 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 00:01:39,414 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 00:01:39,416 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 00:01:39,416 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:01:39" (1/1) ... [2018-12-09 00:01:39,418 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2deb4be5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:01:39, skipping insertion in model container [2018-12-09 00:01:39,418 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:01:39" (1/1) ... [2018-12-09 00:01:39,423 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 00:01:39,448 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 00:01:39,594 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:01:39,600 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 00:01:39,660 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:01:39,680 INFO L195 MainTranslator]: Completed translation [2018-12-09 00:01:39,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:01:39 WrapperNode [2018-12-09 00:01:39,681 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 00:01:39,681 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 00:01:39,681 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 00:01:39,681 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 00:01:39,686 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:01:39" (1/1) ... [2018-12-09 00:01:39,694 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:01:39" (1/1) ... [2018-12-09 00:01:39,706 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 00:01:39,706 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 00:01:39,706 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 00:01:39,706 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 00:01:39,711 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:01:39" (1/1) ... [2018-12-09 00:01:39,711 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:01:39" (1/1) ... [2018-12-09 00:01:39,713 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:01:39" (1/1) ... [2018-12-09 00:01:39,713 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:01:39" (1/1) ... [2018-12-09 00:01:39,716 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:01:39" (1/1) ... [2018-12-09 00:01:39,719 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:01:39" (1/1) ... [2018-12-09 00:01:39,719 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:01:39" (1/1) ... [2018-12-09 00:01:39,721 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 00:01:39,721 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 00:01:39,721 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 00:01:39,721 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 00:01:39,721 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:01:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c2c96396-7eed-4b1d-b3c5-c7c5779e7682/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 00:01:39,753 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 00:01:39,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 00:01:39,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 00:01:39,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 00:01:39,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 00:01:39,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 00:01:39,881 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 00:01:39,881 INFO L280 CfgBuilder]: Removed 12 assue(true) statements. [2018-12-09 00:01:39,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:01:39 BoogieIcfgContainer [2018-12-09 00:01:39,882 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 00:01:39,882 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-09 00:01:39,882 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-09 00:01:39,884 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-09 00:01:39,885 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 00:01:39,885 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.12 12:01:39" (1/3) ... [2018-12-09 00:01:39,885 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@34102c30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 12:01:39, skipping insertion in model container [2018-12-09 00:01:39,886 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 00:01:39,886 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:01:39" (2/3) ... [2018-12-09 00:01:39,886 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@34102c30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 12:01:39, skipping insertion in model container [2018-12-09 00:01:39,886 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 00:01:39,886 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:01:39" (3/3) ... [2018-12-09 00:01:39,887 INFO L375 chiAutomizerObserver]: Analyzing ICFG strdup_true-termination.c.i [2018-12-09 00:01:39,921 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 00:01:39,922 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-09 00:01:39,922 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-09 00:01:39,922 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-09 00:01:39,922 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 00:01:39,923 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 00:01:39,923 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-09 00:01:39,923 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 00:01:39,923 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-09 00:01:39,931 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-12-09 00:01:39,945 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-12-09 00:01:39,945 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:01:39,946 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:01:39,951 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-09 00:01:39,951 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 00:01:39,951 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-09 00:01:39,952 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-12-09 00:01:39,953 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-12-09 00:01:39,953 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:01:39,953 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:01:39,953 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-09 00:01:39,953 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 00:01:39,960 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true havoc main_#res;havoc main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14.base, main_#t~ret14.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset;main_~in_len~0 := main_#t~nondet12;havoc main_#t~nondet12; 19#L528true assume !(main_~in_len~0 < 1);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);strdup_#in~s.base, strdup_#in~s.offset := main_~in~0.base, main_~in~0.offset;havoc strdup_#res.base, strdup_#res.offset;havoc strdup_#t~ret9, strdup_#t~malloc10.base, strdup_#t~malloc10.offset, strdup_#t~ret11.base, strdup_#t~ret11.offset, strdup_~s.base, strdup_~s.offset, strdup_~l~0, strdup_~tmp~0.base, strdup_~tmp~0.offset;strdup_~s.base, strdup_~s.offset := strdup_#in~s.base, strdup_#in~s.offset;strlen_#in~s.base, strlen_#in~s.offset := strdup_~s.base, strdup_~s.offset;havoc strlen_#res;havoc strlen_#t~pre7, strlen_#t~pre6.base, strlen_#t~pre6.offset, strlen_#t~mem8, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 3#L516true assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 7#L517-4true [2018-12-09 00:01:39,960 INFO L796 eck$LassoCheckResult]: Loop: 7#L517-4true call strlen_#t~mem8 := read~int(strlen_~s.base, strlen_~s.offset, 1); 4#L517-1true assume !!(0 != strlen_#t~mem8);havoc strlen_#t~mem8;strlen_#t~pre7 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre7; 5#L517-3true strlen_#t~pre6.base, strlen_#t~pre6.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre6.base, strlen_#t~pre6.offset; 7#L517-4true [2018-12-09 00:01:39,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:01:39,965 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2018-12-09 00:01:39,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:01:39,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:01:39,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:01:39,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:01:39,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:01:40,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:01:40,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:01:40,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:01:40,045 INFO L82 PathProgramCache]: Analyzing trace with hash 45841, now seen corresponding path program 1 times [2018-12-09 00:01:40,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:01:40,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:01:40,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:01:40,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:01:40,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:01:40,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:01:40,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:01:40,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:01:40,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1806906826, now seen corresponding path program 1 times [2018-12-09 00:01:40,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:01:40,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:01:40,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:01:40,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:01:40,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:01:40,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:01:40,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:01:40,263 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 00:01:40,264 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 00:01:40,264 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 00:01:40,264 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 00:01:40,264 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 00:01:40,264 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:01:40,264 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 00:01:40,264 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 00:01:40,265 INFO L131 ssoRankerPreferences]: Filename of dumped script: strdup_true-termination.c.i_Iteration1_Lasso [2018-12-09 00:01:40,265 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 00:01:40,265 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 00:01:40,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 00:01:40,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 00:01:40,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 00:01:40,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 00:01:40,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 00:01:40,293 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 00:01:40,295 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 00:01:40,296 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 00:01:40,298 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 00:01:40,299 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 00:01:40,301 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 00:01:40,303 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 00:01:40,304 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 00:01:40,305 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 00:01:40,306 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 00:01:40,308 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 00:01:40,309 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 00:01:40,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 00:01:40,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 00:01:40,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 00:01:40,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 00:01:40,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 00:01:40,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 00:01:40,625 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 00:01:40,628 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 00:01:40,629 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 00:01:40,630 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:01:40,630 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:01:40,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:01:40,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:01:40,631 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:01:40,632 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:01:40,632 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:01:40,633 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:01:40,633 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 00:01:40,634 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:01:40,634 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:01:40,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:01:40,634 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:01:40,634 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:01:40,634 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:01:40,634 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:01:40,635 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:01:40,635 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 00:01:40,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:01:40,635 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:01:40,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:01:40,636 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:01:40,636 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:01:40,636 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:01:40,636 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:01:40,637 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:01:40,637 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 00:01:40,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:01:40,637 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:01:40,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:01:40,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:01:40,638 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:01:40,638 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:01:40,638 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:01:40,638 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:01:40,639 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 00:01:40,639 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:01:40,639 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:01:40,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:01:40,639 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:01:40,639 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:01:40,640 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:01:40,640 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:01:40,640 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:01:40,640 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 00:01:40,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:01:40,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:01:40,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:01:40,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:01:40,642 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:01:40,642 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:01:40,644 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:01:40,645 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 00:01:40,645 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:01:40,645 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:01:40,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:01:40,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:01:40,645 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:01:40,646 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:01:40,646 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:01:40,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:01:40,647 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 00:01:40,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:01:40,647 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:01:40,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:01:40,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:01:40,648 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:01:40,648 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:01:40,648 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:01:40,648 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:01:40,649 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 00:01:40,649 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:01:40,649 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:01:40,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:01:40,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:01:40,649 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:01:40,649 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:01:40,649 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:01:40,650 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:01:40,650 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:01:40,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:01:40,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:01:40,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:01:40,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:01:40,652 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:01:40,652 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:01:40,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:01:40,660 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 00:01:40,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:01:40,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:01:40,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:01:40,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:01:40,662 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:01:40,662 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:01:40,664 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:01:40,664 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 00:01:40,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:01:40,665 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:01:40,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:01:40,665 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:01:40,665 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:01:40,665 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:01:40,665 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:01:40,666 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:01:40,666 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 00:01:40,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:01:40,666 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:01:40,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:01:40,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:01:40,667 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:01:40,667 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:01:40,667 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:01:40,667 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:01:40,668 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 00:01:40,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:01:40,668 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:01:40,668 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:01:40,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:01:40,668 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:01:40,669 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:01:40,669 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:01:40,669 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:01:40,670 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 00:01:40,670 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:01:40,670 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:01:40,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:01:40,670 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:01:40,670 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:01:40,671 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:01:40,671 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:01:40,671 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:01:40,672 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 00:01:40,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:01:40,672 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:01:40,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:01:40,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:01:40,672 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:01:40,672 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:01:40,673 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:01:40,673 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:01:40,673 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 00:01:40,674 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:01:40,674 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:01:40,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:01:40,674 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 00:01:40,674 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:01:40,674 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 00:01:40,674 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:01:40,676 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:01:40,677 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 00:01:40,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:01:40,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:01:40,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:01:40,677 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:01:40,678 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:01:40,678 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:01:40,685 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:01:40,685 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 00:01:40,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:01:40,686 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 00:01:40,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:01:40,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:01:40,688 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 00:01:40,688 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:01:40,699 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:01:40,699 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:01:40,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:01:40,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:01:40,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:01:40,700 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:01:40,702 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:01:40,702 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:01:40,717 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 00:01:40,728 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-09 00:01:40,728 INFO L444 ModelExtractionUtils]: 27 out of 31 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 00:01:40,729 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 00:01:40,730 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 00:01:40,730 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 00:01:40,731 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strlen_~s.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_1) = -1*ULTIMATE.start_strlen_~s.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_1 Supporting invariants [] [2018-12-09 00:01:40,740 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2018-12-09 00:01:40,746 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-09 00:01:40,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:01:40,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:40,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:01:40,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:40,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:01:40,809 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 00:01:40,818 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 00:01:40,819 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 4 states. [2018-12-09 00:01:40,863 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 4 states. Result 45 states and 57 transitions. Complement of second has 7 states. [2018-12-09 00:01:40,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-09 00:01:40,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-09 00:01:40,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2018-12-09 00:01:40,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 4 letters. Loop has 3 letters. [2018-12-09 00:01:40,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:01:40,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 7 letters. Loop has 3 letters. [2018-12-09 00:01:40,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:01:40,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 4 letters. Loop has 6 letters. [2018-12-09 00:01:40,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:01:40,867 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 57 transitions. [2018-12-09 00:01:40,869 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-12-09 00:01:40,871 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 18 states and 21 transitions. [2018-12-09 00:01:40,871 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-12-09 00:01:40,872 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-12-09 00:01:40,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2018-12-09 00:01:40,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 00:01:40,872 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-12-09 00:01:40,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2018-12-09 00:01:40,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 14. [2018-12-09 00:01:40,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-09 00:01:40,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2018-12-09 00:01:40,889 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-12-09 00:01:40,890 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-12-09 00:01:40,890 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-09 00:01:40,890 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2018-12-09 00:01:40,890 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 00:01:40,890 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:01:40,890 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:01:40,890 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-09 00:01:40,890 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 00:01:40,891 INFO L794 eck$LassoCheckResult]: Stem: 143#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 136#L-1 havoc main_#res;havoc main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14.base, main_#t~ret14.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset;main_~in_len~0 := main_#t~nondet12;havoc main_#t~nondet12; 137#L528 assume !(main_~in_len~0 < 1);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);strdup_#in~s.base, strdup_#in~s.offset := main_~in~0.base, main_~in~0.offset;havoc strdup_#res.base, strdup_#res.offset;havoc strdup_#t~ret9, strdup_#t~malloc10.base, strdup_#t~malloc10.offset, strdup_#t~ret11.base, strdup_#t~ret11.offset, strdup_~s.base, strdup_~s.offset, strdup_~l~0, strdup_~tmp~0.base, strdup_~tmp~0.offset;strdup_~s.base, strdup_~s.offset := strdup_#in~s.base, strdup_#in~s.offset;strlen_#in~s.base, strlen_#in~s.offset := strdup_~s.base, strdup_~s.offset;havoc strlen_#res;havoc strlen_#t~pre7, strlen_#t~pre6.base, strlen_#t~pre6.offset, strlen_#t~mem8, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 138#L516 assume strlen_~s.base == 0 && strlen_~s.offset == 0;strlen_#res := 0; 139#L518 strdup_#t~ret9 := strlen_#res;strdup_~l~0 := 1 + strdup_#t~ret9;havoc strdup_#t~ret9;call strdup_#t~malloc10.base, strdup_#t~malloc10.offset := #Ultimate.alloc(strdup_~l~0);strdup_~tmp~0.base, strdup_~tmp~0.offset := strdup_#t~malloc10.base, strdup_#t~malloc10.offset; 145#L523 assume !(strdup_~tmp~0.base == 0 && strdup_~tmp~0.offset == 0);memcpy_#in~dst.base, memcpy_#in~dst.offset, memcpy_#in~src.base, memcpy_#in~src.offset, memcpy_#in~n := strdup_~tmp~0.base, strdup_~tmp~0.offset, strdup_~s.base, strdup_~s.offset, strdup_~l~0;havoc memcpy_#res.base, memcpy_#res.offset;havoc memcpy_#t~post3.base, memcpy_#t~post3.offset, memcpy_#t~post4.base, memcpy_#t~post4.offset, memcpy_#t~mem5, memcpy_#t~post2, memcpy_~dst.base, memcpy_~dst.offset, memcpy_~src.base, memcpy_~src.offset, memcpy_~n, memcpy_~res~0.base, memcpy_~res~0.offset, memcpy_~c1~0.base, memcpy_~c1~0.offset, memcpy_~c2~0.base, memcpy_~c2~0.offset;memcpy_~dst.base, memcpy_~dst.offset := memcpy_#in~dst.base, memcpy_#in~dst.offset;memcpy_~src.base, memcpy_~src.offset := memcpy_#in~src.base, memcpy_#in~src.offset;memcpy_~n := memcpy_#in~n;memcpy_~res~0.base, memcpy_~res~0.offset := memcpy_~dst.base, memcpy_~dst.offset;havoc memcpy_~c1~0.base, memcpy_~c1~0.offset;havoc memcpy_~c2~0.base, memcpy_~c2~0.offset;memcpy_~c1~0.base, memcpy_~c1~0.offset := memcpy_~dst.base, memcpy_~dst.offset;memcpy_~c2~0.base, memcpy_~c2~0.offset := memcpy_~src.base, memcpy_~src.offset; 142#L511-3 [2018-12-09 00:01:40,891 INFO L796 eck$LassoCheckResult]: Loop: 142#L511-3 memcpy_#t~post2 := memcpy_~n;memcpy_~n := memcpy_#t~post2 - 1; 141#L511-1 assume !!(0 != memcpy_#t~post2 % 4294967296);havoc memcpy_#t~post2;memcpy_#t~post3.base, memcpy_#t~post3.offset := memcpy_~c1~0.base, memcpy_~c1~0.offset;memcpy_~c1~0.base, memcpy_~c1~0.offset := memcpy_#t~post3.base, 1 + memcpy_#t~post3.offset;memcpy_#t~post4.base, memcpy_#t~post4.offset := memcpy_~c2~0.base, memcpy_~c2~0.offset;memcpy_~c2~0.base, memcpy_~c2~0.offset := memcpy_#t~post4.base, 1 + memcpy_#t~post4.offset;call memcpy_#t~mem5 := read~int(memcpy_#t~post4.base, memcpy_#t~post4.offset, 1);call write~int(memcpy_#t~mem5, memcpy_#t~post3.base, memcpy_#t~post3.offset, 1);havoc memcpy_#t~post3.base, memcpy_#t~post3.offset;havoc memcpy_#t~post4.base, memcpy_#t~post4.offset;havoc memcpy_#t~mem5; 142#L511-3 [2018-12-09 00:01:40,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:01:40,891 INFO L82 PathProgramCache]: Analyzing trace with hash 889569803, now seen corresponding path program 1 times [2018-12-09 00:01:40,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:01:40,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:01:40,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:01:40,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:01:40,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:01:40,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:40,918 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 00:01:40,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:01:40,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:01:40,920 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 00:01:40,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:01:40,920 INFO L82 PathProgramCache]: Analyzing trace with hash 2214, now seen corresponding path program 1 times [2018-12-09 00:01:40,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:01:40,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:01:40,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:01:40,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:01:40,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:01:40,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:01:40,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:01:40,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:01:40,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:01:40,998 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-12-09 00:01:41,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:01:41,005 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2018-12-09 00:01:41,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:01:41,006 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 16 transitions. [2018-12-09 00:01:41,006 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 00:01:41,007 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 16 transitions. [2018-12-09 00:01:41,007 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-09 00:01:41,007 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-09 00:01:41,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2018-12-09 00:01:41,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 00:01:41,007 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-12-09 00:01:41,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2018-12-09 00:01:41,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-12-09 00:01:41,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-09 00:01:41,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-12-09 00:01:41,008 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-12-09 00:01:41,008 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-12-09 00:01:41,008 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-09 00:01:41,008 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2018-12-09 00:01:41,009 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 00:01:41,009 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:01:41,009 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:01:41,009 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:01:41,009 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 00:01:41,009 INFO L794 eck$LassoCheckResult]: Stem: 176#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 166#L-1 havoc main_#res;havoc main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14.base, main_#t~ret14.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset;main_~in_len~0 := main_#t~nondet12;havoc main_#t~nondet12; 167#L528 assume !(main_~in_len~0 < 1);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);strdup_#in~s.base, strdup_#in~s.offset := main_~in~0.base, main_~in~0.offset;havoc strdup_#res.base, strdup_#res.offset;havoc strdup_#t~ret9, strdup_#t~malloc10.base, strdup_#t~malloc10.offset, strdup_#t~ret11.base, strdup_#t~ret11.offset, strdup_~s.base, strdup_~s.offset, strdup_~l~0, strdup_~tmp~0.base, strdup_~tmp~0.offset;strdup_~s.base, strdup_~s.offset := strdup_#in~s.base, strdup_#in~s.offset;strlen_#in~s.base, strlen_#in~s.offset := strdup_~s.base, strdup_~s.offset;havoc strlen_#res;havoc strlen_#t~pre7, strlen_#t~pre6.base, strlen_#t~pre6.offset, strlen_#t~mem8, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 168#L516 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 169#L517-4 call strlen_#t~mem8 := read~int(strlen_~s.base, strlen_~s.offset, 1); 170#L517-1 assume !(0 != strlen_#t~mem8);havoc strlen_#t~mem8; 171#L517-5 strlen_#res := strlen_~i~0; 178#L518 strdup_#t~ret9 := strlen_#res;strdup_~l~0 := 1 + strdup_#t~ret9;havoc strdup_#t~ret9;call strdup_#t~malloc10.base, strdup_#t~malloc10.offset := #Ultimate.alloc(strdup_~l~0);strdup_~tmp~0.base, strdup_~tmp~0.offset := strdup_#t~malloc10.base, strdup_#t~malloc10.offset; 179#L523 assume !(strdup_~tmp~0.base == 0 && strdup_~tmp~0.offset == 0);memcpy_#in~dst.base, memcpy_#in~dst.offset, memcpy_#in~src.base, memcpy_#in~src.offset, memcpy_#in~n := strdup_~tmp~0.base, strdup_~tmp~0.offset, strdup_~s.base, strdup_~s.offset, strdup_~l~0;havoc memcpy_#res.base, memcpy_#res.offset;havoc memcpy_#t~post3.base, memcpy_#t~post3.offset, memcpy_#t~post4.base, memcpy_#t~post4.offset, memcpy_#t~mem5, memcpy_#t~post2, memcpy_~dst.base, memcpy_~dst.offset, memcpy_~src.base, memcpy_~src.offset, memcpy_~n, memcpy_~res~0.base, memcpy_~res~0.offset, memcpy_~c1~0.base, memcpy_~c1~0.offset, memcpy_~c2~0.base, memcpy_~c2~0.offset;memcpy_~dst.base, memcpy_~dst.offset := memcpy_#in~dst.base, memcpy_#in~dst.offset;memcpy_~src.base, memcpy_~src.offset := memcpy_#in~src.base, memcpy_#in~src.offset;memcpy_~n := memcpy_#in~n;memcpy_~res~0.base, memcpy_~res~0.offset := memcpy_~dst.base, memcpy_~dst.offset;havoc memcpy_~c1~0.base, memcpy_~c1~0.offset;havoc memcpy_~c2~0.base, memcpy_~c2~0.offset;memcpy_~c1~0.base, memcpy_~c1~0.offset := memcpy_~dst.base, memcpy_~dst.offset;memcpy_~c2~0.base, memcpy_~c2~0.offset := memcpy_~src.base, memcpy_~src.offset; 175#L511-3 [2018-12-09 00:01:41,009 INFO L796 eck$LassoCheckResult]: Loop: 175#L511-3 memcpy_#t~post2 := memcpy_~n;memcpy_~n := memcpy_#t~post2 - 1; 174#L511-1 assume !!(0 != memcpy_#t~post2 % 4294967296);havoc memcpy_#t~post2;memcpy_#t~post3.base, memcpy_#t~post3.offset := memcpy_~c1~0.base, memcpy_~c1~0.offset;memcpy_~c1~0.base, memcpy_~c1~0.offset := memcpy_#t~post3.base, 1 + memcpy_#t~post3.offset;memcpy_#t~post4.base, memcpy_#t~post4.offset := memcpy_~c2~0.base, memcpy_~c2~0.offset;memcpy_~c2~0.base, memcpy_~c2~0.offset := memcpy_#t~post4.base, 1 + memcpy_#t~post4.offset;call memcpy_#t~mem5 := read~int(memcpy_#t~post4.base, memcpy_#t~post4.offset, 1);call write~int(memcpy_#t~mem5, memcpy_#t~post3.base, memcpy_#t~post3.offset, 1);havoc memcpy_#t~post3.base, memcpy_#t~post3.offset;havoc memcpy_#t~post4.base, memcpy_#t~post4.offset;havoc memcpy_#t~mem5; 175#L511-3 [2018-12-09 00:01:41,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:01:41,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1270617397, now seen corresponding path program 1 times [2018-12-09 00:01:41,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:01:41,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:01:41,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:01:41,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:01:41,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:01:41,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:01:41,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:01:41,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:01:41,030 INFO L82 PathProgramCache]: Analyzing trace with hash 2214, now seen corresponding path program 2 times [2018-12-09 00:01:41,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:01:41,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:01:41,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:01:41,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:01:41,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:01:41,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:01:41,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:01:41,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:01:41,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1292607706, now seen corresponding path program 1 times [2018-12-09 00:01:41,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:01:41,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:01:41,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:01:41,040 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:01:41,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:01:41,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:01:41,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:01:41,367 WARN L180 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 123 [2018-12-09 00:01:41,451 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 00:01:41,451 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 00:01:41,451 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 00:01:41,451 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 00:01:41,451 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 00:01:41,451 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:01:41,451 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 00:01:41,451 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 00:01:41,451 INFO L131 ssoRankerPreferences]: Filename of dumped script: strdup_true-termination.c.i_Iteration3_Lasso [2018-12-09 00:01:41,451 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 00:01:41,452 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 00:01:41,456 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 00:01:41,457 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 00:01:41,458 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 00:01:41,459 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 00:01:41,460 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 00:01:41,461 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 00:01:41,462 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 00:01:41,463 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 00:01:41,464 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 00:01:41,465 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 00:01:41,466 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 00:01:41,467 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 00:01:41,468 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 00:01:41,469 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 00:01:41,469 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 00:01:41,470 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 00:01:41,472 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 00:01:41,475 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 00:01:41,476 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 00:01:41,477 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 00:01:41,478 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 00:01:41,479 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 00:01:41,480 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 00:01:41,746 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 106 [2018-12-09 00:01:41,847 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 00:01:41,848 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 00:01:42,013 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2018-12-09 00:01:42,375 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 00:01:42,376 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 00:01:42,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 00:01:42,376 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:01:42,377 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:01:42,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:01:42,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:01:42,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:01:42,377 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:01:42,377 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:01:42,377 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:01:42,378 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 00:01:42,378 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:01:42,378 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:01:42,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:01:42,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:01:42,378 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:01:42,379 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:01:42,379 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:01:42,379 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:01:42,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 00:01:42,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:01:42,380 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:01:42,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:01:42,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:01:42,380 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:01:42,380 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:01:42,380 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:01:42,380 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:01:42,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 00:01:42,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:01:42,381 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:01:42,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:01:42,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:01:42,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:01:42,381 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:01:42,381 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:01:42,382 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:01:42,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:01:42,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:01:42,382 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:01:42,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:01:42,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:01:42,382 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:01:42,382 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:01:42,383 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:01:42,383 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:01:42,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 00:01:42,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:01:42,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:01:42,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:01:42,383 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:01:42,384 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:01:42,384 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:01:42,385 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:01:42,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 00:01:42,385 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:01:42,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:01:42,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:01:42,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:01:42,386 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:01:42,386 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:01:42,387 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:01:42,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 00:01:42,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:01:42,387 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:01:42,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:01:42,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:01:42,388 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:01:42,388 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:01:42,388 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:01:42,388 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:01:42,388 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:01:42,388 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:01:42,389 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:01:42,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:01:42,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:01:42,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:01:42,389 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:01:42,389 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:01:42,389 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:01:42,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 00:01:42,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:01:42,390 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:01:42,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:01:42,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:01:42,390 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:01:42,390 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:01:42,390 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:01:42,390 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:01:42,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 00:01:42,391 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:01:42,391 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:01:42,391 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:01:42,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:01:42,391 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:01:42,391 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:01:42,391 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:01:42,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:01:42,392 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 00:01:42,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:01:42,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:01:42,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:01:42,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:01:42,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:01:42,393 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:01:42,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:01:42,393 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:01:42,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 00:01:42,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:01:42,394 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:01:42,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:01:42,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:01:42,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:01:42,394 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:01:42,394 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:01:42,394 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:01:42,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 00:01:42,395 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:01:42,395 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:01:42,395 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:01:42,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:01:42,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:01:42,395 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:01:42,395 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:01:42,395 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:01:42,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 00:01:42,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:01:42,396 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:01:42,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:01:42,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:01:42,396 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:01:42,396 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:01:42,396 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:01:42,397 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:01:42,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 00:01:42,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:01:42,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:01:42,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:01:42,397 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:01:42,398 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:01:42,398 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:01:42,399 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:01:42,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 00:01:42,400 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:01:42,400 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:01:42,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:01:42,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:01:42,401 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:01:42,401 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:01:42,401 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:01:42,401 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:01:42,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 00:01:42,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:01:42,402 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:01:42,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:01:42,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:01:42,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:01:42,403 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:01:42,403 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:01:42,403 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:01:42,403 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 00:01:42,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:01:42,404 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:01:42,404 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:01:42,404 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:01:42,404 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:01:42,404 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:01:42,404 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:01:42,405 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:01:42,405 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 00:01:42,405 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:01:42,405 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:01:42,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:01:42,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:01:42,406 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:01:42,406 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:01:42,406 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:01:42,406 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:01:42,406 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:01:42,407 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:01:42,407 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:01:42,407 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:01:42,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:01:42,407 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:01:42,407 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:01:42,407 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:01:42,407 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:01:42,407 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 00:01:42,408 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:01:42,408 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:01:42,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:01:42,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:01:42,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:01:42,408 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:01:42,408 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:01:42,408 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:01:42,409 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:01:42,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:01:42,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:01:42,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:01:42,409 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:01:42,410 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:01:42,410 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:01:42,414 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:01:42,414 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 00:01:42,415 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:01:42,415 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:01:42,415 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:01:42,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:01:42,415 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:01:42,415 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:01:42,415 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:01:42,416 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:01:42,416 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 00:01:42,417 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:01:42,417 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:01:42,417 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:01:42,417 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:01:42,422 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:01:42,422 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:01:42,456 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 00:01:42,482 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-09 00:01:42,483 INFO L444 ModelExtractionUtils]: 70 out of 76 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-09 00:01:42,483 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 00:01:42,484 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 00:01:42,484 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 00:01:42,484 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_strdup_#t~malloc10.base)_1, ULTIMATE.start_memcpy_~c1~0.offset) = 1*v_rep(select #length ULTIMATE.start_strdup_#t~malloc10.base)_1 - 1*ULTIMATE.start_memcpy_~c1~0.offset Supporting invariants [] [2018-12-09 00:01:42,536 INFO L297 tatePredicateManager]: 19 out of 20 supporting invariants were superfluous and have been removed [2018-12-09 00:01:42,537 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-09 00:01:42,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:01:42,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:42,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:01:42,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:01:42,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:01:42,589 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 00:01:42,589 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2018-12-09 00:01:42,589 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 16 transitions. cyclomatic complexity: 4 Second operand 4 states. [2018-12-09 00:01:42,619 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 16 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 16 states and 19 transitions. Complement of second has 5 states. [2018-12-09 00:01:42,619 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 00:01:42,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-09 00:01:42,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2018-12-09 00:01:42,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 9 letters. Loop has 2 letters. [2018-12-09 00:01:42,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:01:42,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 11 letters. Loop has 2 letters. [2018-12-09 00:01:42,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:01:42,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 9 letters. Loop has 4 letters. [2018-12-09 00:01:42,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:01:42,620 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 19 transitions. [2018-12-09 00:01:42,621 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 00:01:42,621 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 0 states and 0 transitions. [2018-12-09 00:01:42,621 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-09 00:01:42,621 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-09 00:01:42,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-09 00:01:42,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 00:01:42,621 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 00:01:42,621 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 00:01:42,621 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 00:01:42,621 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-09 00:01:42,621 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-09 00:01:42,621 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 00:01:42,621 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-09 00:01:42,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.12 12:01:42 BoogieIcfgContainer [2018-12-09 00:01:42,625 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-09 00:01:42,625 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 00:01:42,625 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 00:01:42,625 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 00:01:42,626 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:01:39" (3/4) ... [2018-12-09 00:01:42,628 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 00:01:42,628 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 00:01:42,628 INFO L168 Benchmark]: Toolchain (without parser) took 3215.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.6 MB). Free memory was 950.6 MB in the beginning and 852.3 MB in the end (delta: 98.3 MB). Peak memory consumption was 262.9 MB. Max. memory is 11.5 GB. [2018-12-09 00:01:42,629 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 00:01:42,629 INFO L168 Benchmark]: CACSL2BoogieTranslator took 267.13 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -157.3 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2018-12-09 00:01:42,630 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.81 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-09 00:01:42,630 INFO L168 Benchmark]: Boogie Preprocessor took 14.74 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 00:01:42,630 INFO L168 Benchmark]: RCFGBuilder took 160.90 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: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-12-09 00:01:42,630 INFO L168 Benchmark]: BuchiAutomizer took 2743.00 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 46.1 MB). Free memory was 1.1 GB in the beginning and 852.3 MB in the end (delta: 230.5 MB). Peak memory consumption was 276.7 MB. Max. memory is 11.5 GB. [2018-12-09 00:01:42,631 INFO L168 Benchmark]: Witness Printer took 2.79 ms. Allocated memory is still 1.2 GB. Free memory is still 852.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:01:42,633 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 267.13 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -157.3 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.81 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.74 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. * RCFGBuilder took 160.90 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: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2743.00 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 46.1 MB). Free memory was 1.1 GB in the beginning and 852.3 MB in the end (delta: 230.5 MB). Peak memory consumption was 276.7 MB. Max. memory is 11.5 GB. * Witness Printer took 2.79 ms. Allocated memory is still 1.2 GB. Free memory is still 852.3 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[__builtin_alloca (in_len)] and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[malloc(l)] + -1 * c1 and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.7s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 14 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 38 SDtfs, 41 SDslu, 18 SDs, 0 SdLazy, 17 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital198 mio100 ax100 hnf100 lsp92 ukn94 mio100 lsp50 div114 bol100 ite100 ukn100 eq190 hnf83 smp94 dnf102 smp100 tf100 neg98 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 13ms VariablesStem: 6 VariablesLoop: 4 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...