./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/array-memsafety/cstrcat-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a849b65a-15d3-4c84-9efd-ac90c3e5e0b0/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a849b65a-15d3-4c84-9efd-ac90c3e5e0b0/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a849b65a-15d3-4c84-9efd-ac90c3e5e0b0/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a849b65a-15d3-4c84-9efd-ac90c3e5e0b0/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/cstrcat-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_a849b65a-15d3-4c84-9efd-ac90c3e5e0b0/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a849b65a-15d3-4c84-9efd-ac90c3e5e0b0/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 32bit --witnessprinter.graph.data.programhash 29f8140cce3280dffe5b1e0add14d54d493126de .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 05:17:49,870 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 05:17:49,871 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 05:17:49,878 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 05:17:49,879 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 05:17:49,879 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 05:17:49,880 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 05:17:49,881 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 05:17:49,882 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 05:17:49,883 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 05:17:49,883 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 05:17:49,883 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 05:17:49,884 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 05:17:49,884 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 05:17:49,885 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 05:17:49,885 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 05:17:49,886 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 05:17:49,887 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 05:17:49,888 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 05:17:49,889 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 05:17:49,889 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 05:17:49,890 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 05:17:49,891 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 05:17:49,891 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 05:17:49,891 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 05:17:49,892 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 05:17:49,893 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 05:17:49,893 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 05:17:49,894 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 05:17:49,895 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 05:17:49,895 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 05:17:49,895 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 05:17:49,896 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 05:17:49,896 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 05:17:49,896 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 05:17:49,897 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 05:17:49,897 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a849b65a-15d3-4c84-9efd-ac90c3e5e0b0/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 05:17:49,906 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 05:17:49,906 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 05:17:49,907 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 05:17:49,907 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 05:17:49,907 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 05:17:49,907 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 05:17:49,908 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 05:17:49,908 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 05:17:49,908 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 05:17:49,908 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 05:17:49,908 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 05:17:49,908 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 05:17:49,908 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 05:17:49,908 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 05:17:49,909 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 05:17:49,909 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 05:17:49,909 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 05:17:49,909 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 05:17:49,909 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 05:17:49,909 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 05:17:49,909 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 05:17:49,909 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 05:17:49,910 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 05:17:49,910 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 05:17:49,910 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 05:17:49,910 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 05:17:49,910 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 05:17:49,910 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 05:17:49,910 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 05:17:49,911 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 05:17:49,911 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 05:17:49,911 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_a849b65a-15d3-4c84-9efd-ac90c3e5e0b0/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 29f8140cce3280dffe5b1e0add14d54d493126de [2018-11-10 05:17:49,934 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 05:17:49,943 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 05:17:49,946 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 05:17:49,947 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 05:17:49,947 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 05:17:49,948 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a849b65a-15d3-4c84-9efd-ac90c3e5e0b0/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-11-10 05:17:49,993 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a849b65a-15d3-4c84-9efd-ac90c3e5e0b0/bin-2019/uautomizer/data/4ca2d0017/8541085a9ec846d489199822cf6f380f/FLAG4deb05087 [2018-11-10 05:17:50,444 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 05:17:50,445 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a849b65a-15d3-4c84-9efd-ac90c3e5e0b0/sv-benchmarks/c/array-memsafety/cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-11-10 05:17:50,454 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a849b65a-15d3-4c84-9efd-ac90c3e5e0b0/bin-2019/uautomizer/data/4ca2d0017/8541085a9ec846d489199822cf6f380f/FLAG4deb05087 [2018-11-10 05:17:50,467 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a849b65a-15d3-4c84-9efd-ac90c3e5e0b0/bin-2019/uautomizer/data/4ca2d0017/8541085a9ec846d489199822cf6f380f [2018-11-10 05:17:50,470 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 05:17:50,471 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 05:17:50,471 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 05:17:50,472 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 05:17:50,475 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 05:17:50,475 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:17:50" (1/1) ... [2018-11-10 05:17:50,477 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c475c6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:17:50, skipping insertion in model container [2018-11-10 05:17:50,477 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:17:50" (1/1) ... [2018-11-10 05:17:50,485 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 05:17:50,513 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 05:17:50,693 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:17:50,701 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 05:17:50,729 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:17:50,751 INFO L193 MainTranslator]: Completed translation [2018-11-10 05:17:50,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:17:50 WrapperNode [2018-11-10 05:17:50,751 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 05:17:50,751 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 05:17:50,752 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 05:17:50,752 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 05:17:50,759 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:17:50" (1/1) ... [2018-11-10 05:17:50,806 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:17:50" (1/1) ... [2018-11-10 05:17:50,821 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 05:17:50,822 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 05:17:50,822 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 05:17:50,822 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 05:17:50,827 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:17:50" (1/1) ... [2018-11-10 05:17:50,827 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:17:50" (1/1) ... [2018-11-10 05:17:50,829 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:17:50" (1/1) ... [2018-11-10 05:17:50,829 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:17:50" (1/1) ... [2018-11-10 05:17:50,832 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:17:50" (1/1) ... [2018-11-10 05:17:50,834 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:17:50" (1/1) ... [2018-11-10 05:17:50,835 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:17:50" (1/1) ... [2018-11-10 05:17:50,836 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 05:17:50,837 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 05:17:50,837 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 05:17:50,837 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 05:17:50,837 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:17:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a849b65a-15d3-4c84-9efd-ac90c3e5e0b0/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:17:50,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 05:17:50,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 05:17:50,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 05:17:50,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 05:17:51,035 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 05:17:51,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:17:51 BoogieIcfgContainer [2018-11-10 05:17:51,036 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 05:17:51,036 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 05:17:51,036 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 05:17:51,039 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 05:17:51,039 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:17:51,039 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 05:17:50" (1/3) ... [2018-11-10 05:17:51,040 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3fb90c04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 05:17:51, skipping insertion in model container [2018-11-10 05:17:51,040 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:17:51,040 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:17:50" (2/3) ... [2018-11-10 05:17:51,041 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3fb90c04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 05:17:51, skipping insertion in model container [2018-11-10 05:17:51,041 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:17:51,041 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:17:51" (3/3) ... [2018-11-10 05:17:51,042 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-11-10 05:17:51,079 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 05:17:51,080 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 05:17:51,080 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 05:17:51,080 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 05:17:51,080 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 05:17:51,080 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 05:17:51,081 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 05:17:51,081 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 05:17:51,081 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 05:17:51,089 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2018-11-10 05:17:51,105 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-10 05:17:51,105 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:17:51,105 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:17:51,110 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:17:51,110 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 05:17:51,110 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 05:17:51,110 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2018-11-10 05:17:51,112 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-10 05:17:51,112 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:17:51,112 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:17:51,112 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:17:51,112 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 05:17:51,119 INFO L793 eck$LassoCheckResult]: Stem: 17#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~ret12.base, main_#t~ret12.offset, main_~length1~0, main_~length2~0, main_~length3~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~length2~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~length3~0 := main_#t~nondet9;havoc main_#t~nondet9; 14#L553true assume !(main_~length1~0 < 1); 19#L553-2true assume !(main_~length2~0 < 2); 8#L556-1true assume !(main_~length3~0 < 1); 3#L559-1true assume !(main_~length2~0 - main_~length3~0 < main_~length1~0 || main_~length3~0 > main_~length2~0);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset; 10#L565true SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L565 13#L565-1true SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length3~0 - 1) * 1, 1); srcloc: L565-1 7#L566true assume { :begin_inline_cstrcat } true;cstrcat_#in~s1.base, cstrcat_#in~s1.offset, cstrcat_#in~s2.base, cstrcat_#in~s2.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~nondetString1~0.base, main_~nondetString1~0.offset;havoc cstrcat_#res.base, cstrcat_#res.offset;havoc cstrcat_#t~post3.base, cstrcat_#t~post3.offset, cstrcat_#t~mem2, cstrcat_#t~post4.base, cstrcat_#t~post4.offset, cstrcat_#t~post5.base, cstrcat_#t~post5.offset, cstrcat_#t~mem6, cstrcat_~s1.base, cstrcat_~s1.offset, cstrcat_~s2.base, cstrcat_~s2.offset, cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s1.base, cstrcat_~s1.offset := cstrcat_#in~s1.base, cstrcat_#in~s1.offset;cstrcat_~s2.base, cstrcat_~s2.offset := cstrcat_#in~s2.base, cstrcat_#in~s2.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_~s1.base, cstrcat_~s1.offset; 22#L543-4true [2018-11-10 05:17:51,120 INFO L795 eck$LassoCheckResult]: Loop: 22#L543-4true assume true; 15#L543-1true SUMMARY for call cstrcat_#t~mem2 := read~int(cstrcat_~s~0.base, cstrcat_~s~0.offset, 1); srcloc: L543-1 18#L543-2true assume !!(cstrcat_#t~mem2 != 0);havoc cstrcat_#t~mem2;cstrcat_#t~post3.base, cstrcat_#t~post3.offset := cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_#t~post3.base, cstrcat_#t~post3.offset + 1;havoc cstrcat_#t~post3.base, cstrcat_#t~post3.offset; 22#L543-4true [2018-11-10 05:17:51,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:17:51,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1302194828, now seen corresponding path program 1 times [2018-11-10 05:17:51,126 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:17:51,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:17:51,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:17:51,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:17:51,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:17:51,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:17:51,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:17:51,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:17:51,236 INFO L82 PathProgramCache]: Analyzing trace with hash 61636, now seen corresponding path program 1 times [2018-11-10 05:17:51,236 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:17:51,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:17:51,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:17:51,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:17:51,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:17:51,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:17:51,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:17:51,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:17:51,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1541535321, now seen corresponding path program 1 times [2018-11-10 05:17:51,244 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:17:51,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:17:51,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:17:51,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:17:51,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:17:51,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:17:51,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:17:51,583 WARN L179 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 96 [2018-11-10 05:17:51,684 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:17:51,685 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:17:51,685 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:17:51,685 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:17:51,685 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:17:51,686 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:17:51,686 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:17:51,686 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:17:51,686 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcat-alloca_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2018-11-10 05:17:51,686 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:17:51,686 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:17:51,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:17:51,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:17:51,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:17:51,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:17:51,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:17:51,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:17:51,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:17:51,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:17:51,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:17:51,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:17:51,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:17:51,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:17:51,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:17:51,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:17:51,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:17:51,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:17:51,936 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 86 [2018-11-10 05:17:51,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:17:51,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:17:51,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:17:52,330 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:17:52,335 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:17:52,337 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:17:52,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:17:52,338 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:17:52,339 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:17:52,339 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:17:52,339 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:17:52,341 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:17:52,341 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:17:52,343 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:17:52,343 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:17:52,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:17:52,344 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:17:52,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:17:52,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:17:52,344 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:17:52,345 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:17:52,345 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:17:52,345 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:17:52,346 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:17:52,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:17:52,346 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:17:52,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:17:52,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:17:52,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:17:52,347 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:17:52,347 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:17:52,348 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:17:52,348 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:17:52,348 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:17:52,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:17:52,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:17:52,349 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:17:52,350 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:17:52,350 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:17:52,353 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:17:52,354 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:17:52,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:17:52,354 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:17:52,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:17:52,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:17:52,355 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:17:52,355 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:17:52,355 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:17:52,356 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:17:52,356 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:17:52,357 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:17:52,357 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:17:52,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:17:52,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:17:52,357 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:17:52,357 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:17:52,358 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:17:52,358 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:17:52,359 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:17:52,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:17:52,359 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:17:52,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:17:52,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:17:52,360 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:17:52,360 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:17:52,360 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:17:52,361 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:17:52,361 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:17:52,361 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:17:52,362 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:17:52,362 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:17:52,362 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:17:52,362 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:17:52,362 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:17:52,362 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:17:52,363 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:17:52,363 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:17:52,364 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:17:52,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:17:52,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:17:52,364 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:17:52,365 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:17:52,365 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:17:52,368 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:17:52,368 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:17:52,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:17:52,369 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:17:52,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:17:52,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:17:52,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:17:52,370 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:17:52,372 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:17:52,372 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:17:52,373 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:17:52,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:17:52,374 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:17:52,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:17:52,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:17:52,374 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:17:52,375 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:17:52,375 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:17:52,376 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:17:52,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-11-10 05:17:52,376 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:17:52,377 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:17:52,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:17:52,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:17:52,378 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:17:52,378 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:17:52,378 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:17:52,379 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:17:52,380 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:17:52,380 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:17:52,380 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:17:52,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:17:52,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:17:52,380 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:17:52,381 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:17:52,381 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:17:52,381 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:17:52,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-11-10 05:17:52,385 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:17:52,385 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:17:52,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:17:52,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:17:52,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:17:52,385 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:17:52,385 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:17:52,386 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:17:52,386 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:17:52,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:17:52,387 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:17:52,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:17:52,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:17:52,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:17:52,387 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:17:52,387 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:17:52,388 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:17:52,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-11-10 05:17:52,389 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:17:52,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:17:52,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:17:52,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:17:52,390 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:17:52,390 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:17:52,392 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:17:52,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-11-10 05:17:52,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:17:52,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:17:52,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:17:52,393 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:17:52,393 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:17:52,394 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:17:52,396 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:17:52,397 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:17:52,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:17:52,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:17:52,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:17:52,397 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:17:52,399 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:17:52,399 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:17:52,403 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:17:52,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-11-10 05:17:52,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:17:52,403 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 05:17:52,404 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:17:52,404 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:17:52,405 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 05:17:52,405 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:17:52,423 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:17:52,423 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:17:52,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:17:52,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:17:52,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:17:52,424 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:17:52,425 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:17:52,426 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:17:52,431 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:17:52,432 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:17:52,432 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:17:52,432 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:17:52,433 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:17:52,433 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 05:17:52,433 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:17:52,433 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 05:17:52,433 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:17:52,437 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:17:52,437 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:17:52,438 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:17:52,438 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:17:52,438 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:17:52,438 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:17:52,442 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:17:52,442 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:17:52,471 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 05:17:52,500 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 05:17:52,500 INFO L444 ModelExtractionUtils]: 53 out of 58 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 05:17:52,501 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 05:17:52,503 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 05:17:52,503 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 05:17:52,504 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_1, ULTIMATE.start_cstrcat_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_1 - 1*ULTIMATE.start_cstrcat_~s~0.offset Supporting invariants [] [2018-11-10 05:17:52,530 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-11-10 05:17:52,535 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 05:17:52,536 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 05:17:52,536 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-11-10 05:17:52,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:17:52,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:17:52,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:17:52,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:17:52,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:17:52,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:17:52,604 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-10 05:17:52,605 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states. Second operand 5 states. [2018-11-10 05:17:52,667 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states.. Second operand 5 states. Result 54 states and 65 transitions. Complement of second has 8 states. [2018-11-10 05:17:52,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 05:17:52,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 05:17:52,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2018-11-10 05:17:52,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 46 transitions. Stem has 9 letters. Loop has 3 letters. [2018-11-10 05:17:52,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:17:52,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 46 transitions. Stem has 12 letters. Loop has 3 letters. [2018-11-10 05:17:52,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:17:52,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 46 transitions. Stem has 9 letters. Loop has 6 letters. [2018-11-10 05:17:52,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:17:52,672 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 65 transitions. [2018-11-10 05:17:52,675 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 05:17:52,677 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 22 states and 26 transitions. [2018-11-10 05:17:52,678 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-10 05:17:52,678 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-10 05:17:52,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 26 transitions. [2018-11-10 05:17:52,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:17:52,679 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2018-11-10 05:17:52,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 26 transitions. [2018-11-10 05:17:52,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2018-11-10 05:17:52,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-10 05:17:52,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2018-11-10 05:17:52,696 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2018-11-10 05:17:52,696 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2018-11-10 05:17:52,696 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 05:17:52,696 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 22 transitions. [2018-11-10 05:17:52,697 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 05:17:52,697 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:17:52,697 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:17:52,697 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:17:52,698 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 05:17:52,698 INFO L793 eck$LassoCheckResult]: Stem: 199#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 193#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~ret12.base, main_#t~ret12.offset, main_~length1~0, main_~length2~0, main_~length3~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~length2~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~length3~0 := main_#t~nondet9;havoc main_#t~nondet9; 194#L553 assume !(main_~length1~0 < 1); 195#L553-2 assume !(main_~length2~0 < 2); 189#L556-1 assume !(main_~length3~0 < 1); 183#L559-1 assume !(main_~length2~0 - main_~length3~0 < main_~length1~0 || main_~length3~0 > main_~length2~0);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset; 184#L565 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L565 191#L565-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length3~0 - 1) * 1, 1); srcloc: L565-1 187#L566 assume { :begin_inline_cstrcat } true;cstrcat_#in~s1.base, cstrcat_#in~s1.offset, cstrcat_#in~s2.base, cstrcat_#in~s2.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~nondetString1~0.base, main_~nondetString1~0.offset;havoc cstrcat_#res.base, cstrcat_#res.offset;havoc cstrcat_#t~post3.base, cstrcat_#t~post3.offset, cstrcat_#t~mem2, cstrcat_#t~post4.base, cstrcat_#t~post4.offset, cstrcat_#t~post5.base, cstrcat_#t~post5.offset, cstrcat_#t~mem6, cstrcat_~s1.base, cstrcat_~s1.offset, cstrcat_~s2.base, cstrcat_~s2.offset, cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s1.base, cstrcat_~s1.offset := cstrcat_#in~s1.base, cstrcat_#in~s1.offset;cstrcat_~s2.base, cstrcat_~s2.offset := cstrcat_#in~s2.base, cstrcat_#in~s2.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_~s1.base, cstrcat_~s1.offset; 188#L543-4 assume true; 197#L543-1 SUMMARY for call cstrcat_#t~mem2 := read~int(cstrcat_~s~0.base, cstrcat_~s~0.offset, 1); srcloc: L543-1 198#L543-2 assume !(cstrcat_#t~mem2 != 0);havoc cstrcat_#t~mem2; 196#L545-5 [2018-11-10 05:17:52,698 INFO L795 eck$LassoCheckResult]: Loop: 196#L545-5 assume true; 185#L545 cstrcat_#t~post4.base, cstrcat_#t~post4.offset := cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_#t~post4.base, cstrcat_#t~post4.offset + 1;cstrcat_#t~post5.base, cstrcat_#t~post5.offset := cstrcat_~s2.base, cstrcat_~s2.offset;cstrcat_~s2.base, cstrcat_~s2.offset := cstrcat_#t~post5.base, cstrcat_#t~post5.offset + 1; 186#L545-1 SUMMARY for call cstrcat_#t~mem6 := read~int(cstrcat_#t~post5.base, cstrcat_#t~post5.offset, 1); srcloc: L545-1 190#L545-2 SUMMARY for call write~int(cstrcat_#t~mem6, cstrcat_#t~post4.base, cstrcat_#t~post4.offset, 1); srcloc: L545-2 192#L545-3 assume !!(cstrcat_#t~mem6 != 0);havoc cstrcat_#t~mem6;havoc cstrcat_#t~post5.base, cstrcat_#t~post5.offset;havoc cstrcat_#t~post4.base, cstrcat_#t~post4.offset; 196#L545-5 [2018-11-10 05:17:52,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:17:52,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1541535319, now seen corresponding path program 1 times [2018-11-10 05:17:52,698 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:17:52,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:17:52,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:17:52,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:17:52,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:17:52,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:17:52,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:17:52,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:17:52,715 INFO L82 PathProgramCache]: Analyzing trace with hash 71635474, now seen corresponding path program 1 times [2018-11-10 05:17:52,715 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:17:52,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:17:52,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:17:52,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:17:52,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:17:52,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:17:52,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:17:52,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:17:52,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1206755708, now seen corresponding path program 1 times [2018-11-10 05:17:52,724 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:17:52,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:17:52,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:17:52,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:17:52,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:17:52,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:17:52,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:17:53,001 WARN L179 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 101 [2018-11-10 05:17:53,068 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:17:53,068 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:17:53,068 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:17:53,068 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:17:53,068 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:17:53,069 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:17:53,069 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:17:53,069 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:17:53,069 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcat-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-11-10 05:17:53,069 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:17:53,069 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:17:53,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:17:53,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:17:53,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:17:53,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:17:53,330 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 96 [2018-11-10 05:17:53,463 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 77 [2018-11-10 05:17:53,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-11-10 05:17:53,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-11-10 05:17:53,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-11-10 05:17:53,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-11-10 05:17:53,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-11-10 05:17:53,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-11-10 05:17:53,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-11-10 05:17:53,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-11-10 05:17:53,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:17:53,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:17:53,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:17:53,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-11-10 05:17:53,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-11-10 05:17:53,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-11-10 05:17:53,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-11-10 05:17:53,840 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:17:53,840 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:17:53,841 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:17:53,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:17:53,841 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:17:53,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:17:53,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:17:53,842 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:17:53,842 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:17:53,842 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:17:53,843 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:17:53,843 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:17:53,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:17:53,843 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:17:53,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:17:53,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:17:53,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:17:53,844 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:17:53,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:17:53,845 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:17:53,845 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:17:53,845 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:17:53,845 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:17:53,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:17:53,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:17:53,846 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:17:53,846 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:17:53,846 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:17:53,846 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:17:53,847 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:17:53,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:17:53,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:17:53,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:17:53,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:17:53,848 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:17:53,848 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:17:53,849 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:17:53,850 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:17:53,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:17:53,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:17:53,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:17:53,850 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:17:53,852 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:17:53,852 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:17:53,859 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:17:53,860 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:17:53,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:17:53,860 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 05:17:53,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:17:53,860 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:17:53,862 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 05:17:53,862 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:17:53,873 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:17:53,873 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:17:53,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:17:53,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:17:53,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:17:53,874 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:17:53,877 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:17:53,877 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:17:53,878 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:17:53,879 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:17:53,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:17:53,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:17:53,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:17:53,880 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:17:53,880 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:17:53,880 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:17:53,883 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:17:53,883 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:17:53,884 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:17:53,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:17:53,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:17:53,884 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:17:53,884 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:17:53,885 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:17:53,886 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:17:53,886 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:17:53,886 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:17:53,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:17:53,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:17:53,887 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:17:53,888 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:17:53,888 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:17:53,890 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:17:53,890 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:17:53,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:17:53,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:17:53,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:17:53,891 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:17:53,892 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:17:53,892 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:17:53,896 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:17:53,897 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:17:53,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:17:53,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:17:53,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:17:53,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:17:53,898 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:17:53,898 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:17:53,900 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:17:53,900 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:17:53,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:17:53,901 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 05:17:53,901 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:17:53,901 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:17:53,904 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 05:17:53,905 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:17:53,911 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:17:53,911 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:17:53,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:17:53,912 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:17:53,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:17:53,912 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 05:17:53,912 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:17:53,913 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 05:17:53,913 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:17:53,917 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:17:53,917 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:17:53,917 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:17:53,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:17:53,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:17:53,918 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:17:53,922 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:17:53,922 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:17:53,947 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 05:17:53,972 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 05:17:53,973 INFO L444 ModelExtractionUtils]: 57 out of 64 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-10 05:17:53,973 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 05:17:53,974 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 05:17:53,974 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 05:17:53,974 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_2, ULTIMATE.start_cstrcat_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_2 - 1*ULTIMATE.start_cstrcat_~s~0.offset Supporting invariants [] [2018-11-10 05:17:54,028 INFO L297 tatePredicateManager]: 14 out of 16 supporting invariants were superfluous and have been removed [2018-11-10 05:17:54,032 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 05:17:54,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:17:54,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:17:54,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:17:54,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:17:54,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:17:54,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:17:54,149 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2018-11-10 05:17:54,150 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 22 transitions. cyclomatic complexity: 6 Second operand 7 states. [2018-11-10 05:17:54,226 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 22 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 33 states and 39 transitions. Complement of second has 10 states. [2018-11-10 05:17:54,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 3 stem states 2 non-accepting loop states 2 accepting loop states [2018-11-10 05:17:54,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 05:17:54,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 26 transitions. [2018-11-10 05:17:54,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 26 transitions. Stem has 12 letters. Loop has 5 letters. [2018-11-10 05:17:54,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:17:54,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 26 transitions. Stem has 17 letters. Loop has 5 letters. [2018-11-10 05:17:54,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:17:54,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 26 transitions. Stem has 12 letters. Loop has 10 letters. [2018-11-10 05:17:54,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:17:54,229 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 39 transitions. [2018-11-10 05:17:54,230 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 05:17:54,230 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 22 states and 26 transitions. [2018-11-10 05:17:54,230 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-10 05:17:54,231 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-10 05:17:54,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 26 transitions. [2018-11-10 05:17:54,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:17:54,231 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2018-11-10 05:17:54,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 26 transitions. [2018-11-10 05:17:54,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2018-11-10 05:17:54,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-10 05:17:54,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2018-11-10 05:17:54,233 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2018-11-10 05:17:54,233 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2018-11-10 05:17:54,233 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 05:17:54,233 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 24 transitions. [2018-11-10 05:17:54,234 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 05:17:54,234 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:17:54,234 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:17:54,234 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:17:54,234 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 05:17:54,235 INFO L793 eck$LassoCheckResult]: Stem: 407#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 401#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~ret12.base, main_#t~ret12.offset, main_~length1~0, main_~length2~0, main_~length3~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~length2~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~length3~0 := main_#t~nondet9;havoc main_#t~nondet9; 402#L553 assume !(main_~length1~0 < 1); 403#L553-2 assume !(main_~length2~0 < 2); 397#L556-1 assume !(main_~length3~0 < 1); 391#L559-1 assume !(main_~length2~0 - main_~length3~0 < main_~length1~0 || main_~length3~0 > main_~length2~0);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset; 392#L565 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L565 399#L565-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length3~0 - 1) * 1, 1); srcloc: L565-1 395#L566 assume { :begin_inline_cstrcat } true;cstrcat_#in~s1.base, cstrcat_#in~s1.offset, cstrcat_#in~s2.base, cstrcat_#in~s2.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~nondetString1~0.base, main_~nondetString1~0.offset;havoc cstrcat_#res.base, cstrcat_#res.offset;havoc cstrcat_#t~post3.base, cstrcat_#t~post3.offset, cstrcat_#t~mem2, cstrcat_#t~post4.base, cstrcat_#t~post4.offset, cstrcat_#t~post5.base, cstrcat_#t~post5.offset, cstrcat_#t~mem6, cstrcat_~s1.base, cstrcat_~s1.offset, cstrcat_~s2.base, cstrcat_~s2.offset, cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s1.base, cstrcat_~s1.offset := cstrcat_#in~s1.base, cstrcat_#in~s1.offset;cstrcat_~s2.base, cstrcat_~s2.offset := cstrcat_#in~s2.base, cstrcat_#in~s2.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_~s1.base, cstrcat_~s1.offset; 396#L543-4 assume true; 410#L543-1 SUMMARY for call cstrcat_#t~mem2 := read~int(cstrcat_~s~0.base, cstrcat_~s~0.offset, 1); srcloc: L543-1 408#L543-2 assume !!(cstrcat_#t~mem2 != 0);havoc cstrcat_#t~mem2;cstrcat_#t~post3.base, cstrcat_#t~post3.offset := cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_#t~post3.base, cstrcat_#t~post3.offset + 1;havoc cstrcat_#t~post3.base, cstrcat_#t~post3.offset; 409#L543-4 assume true; 405#L543-1 SUMMARY for call cstrcat_#t~mem2 := read~int(cstrcat_~s~0.base, cstrcat_~s~0.offset, 1); srcloc: L543-1 406#L543-2 assume !(cstrcat_#t~mem2 != 0);havoc cstrcat_#t~mem2; 404#L545-5 [2018-11-10 05:17:54,235 INFO L795 eck$LassoCheckResult]: Loop: 404#L545-5 assume true; 393#L545 cstrcat_#t~post4.base, cstrcat_#t~post4.offset := cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_#t~post4.base, cstrcat_#t~post4.offset + 1;cstrcat_#t~post5.base, cstrcat_#t~post5.offset := cstrcat_~s2.base, cstrcat_~s2.offset;cstrcat_~s2.base, cstrcat_~s2.offset := cstrcat_#t~post5.base, cstrcat_#t~post5.offset + 1; 394#L545-1 SUMMARY for call cstrcat_#t~mem6 := read~int(cstrcat_#t~post5.base, cstrcat_#t~post5.offset, 1); srcloc: L545-1 398#L545-2 SUMMARY for call write~int(cstrcat_#t~mem6, cstrcat_#t~post4.base, cstrcat_#t~post4.offset, 1); srcloc: L545-2 400#L545-3 assume !!(cstrcat_#t~mem6 != 0);havoc cstrcat_#t~mem6;havoc cstrcat_#t~post5.base, cstrcat_#t~post5.offset;havoc cstrcat_#t~post4.base, cstrcat_#t~post4.offset; 404#L545-5 [2018-11-10 05:17:54,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:17:54,235 INFO L82 PathProgramCache]: Analyzing trace with hash 2088450922, now seen corresponding path program 1 times [2018-11-10 05:17:54,235 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:17:54,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:17:54,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:17:54,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:17:54,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:17:54,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:17:54,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:17:54,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:17:54,254 INFO L82 PathProgramCache]: Analyzing trace with hash 71635474, now seen corresponding path program 2 times [2018-11-10 05:17:54,254 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:17:54,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:17:54,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:17:54,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:17:54,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:17:54,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:17:54,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:17:54,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:17:54,260 INFO L82 PathProgramCache]: Analyzing trace with hash 2109968457, now seen corresponding path program 1 times [2018-11-10 05:17:54,260 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:17:54,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:17:54,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:17:54,261 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:17:54,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:17:54,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:17:54,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:17:54,554 WARN L179 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 112 [2018-11-10 05:17:54,647 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:17:54,647 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:17:54,647 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:17:54,648 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:17:54,648 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:17:54,648 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:17:54,648 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:17:54,648 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:17:54,648 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcat-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-11-10 05:17:54,648 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:17:54,648 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:17:54,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:17:54,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:17:54,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:17:54,913 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 100 [2018-11-10 05:17:55,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:17:55,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:17:55,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:17:55,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:17:55,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:17:55,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:17:55,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:17:55,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:17:55,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:17:55,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:17:55,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:17:55,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:17:55,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:17:55,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:17:55,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:17:55,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:17:55,452 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:17:55,452 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:17:55,452 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:17:55,452 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:17:55,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:17:55,453 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:17:55,453 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:17:55,454 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:17:55,454 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:17:55,458 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:17:55,458 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:17:55,459 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:17:55,459 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:17:55,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:17:55,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:17:55,459 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:17:55,460 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:17:55,460 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:17:55,460 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:17:55,460 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:17:55,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:17:55,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:17:55,461 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:17:55,461 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:17:55,461 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:17:55,461 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:17:55,463 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:17:55,463 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:17:55,463 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:17:55,463 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 05:17:55,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:17:55,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:17:55,466 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 05:17:55,466 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:17:55,471 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:17:55,472 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:17:55,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:17:55,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:17:55,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:17:55,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:17:55,473 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:17:55,473 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:17:55,477 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:17:55,477 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:17:55,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:17:55,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:17:55,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:17:55,478 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:17:55,478 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:17:55,478 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:17:55,480 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:17:55,480 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:17:55,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:17:55,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:17:55,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:17:55,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:17:55,481 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:17:55,481 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:17:55,484 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:17:55,485 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:17:55,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:17:55,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:17:55,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:17:55,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:17:55,486 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:17:55,486 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:17:55,487 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:17:55,487 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:17:55,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:17:55,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:17:55,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:17:55,488 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:17:55,489 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:17:55,489 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:17:55,493 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:17:55,493 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:17:55,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:17:55,494 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 05:17:55,494 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:17:55,494 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:17:55,495 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 05:17:55,495 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:17:55,501 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:17:55,502 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:17:55,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:17:55,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:17:55,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:17:55,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:17:55,503 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:17:55,503 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:17:55,504 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:17:55,504 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:17:55,505 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:17:55,505 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 05:17:55,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:17:55,505 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:17:55,505 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 05:17:55,505 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:17:55,507 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:17:55,508 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:17:55,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:17:55,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:17:55,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:17:55,508 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:17:55,509 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:17:55,509 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:17:55,511 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:17:55,511 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:17:55,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:17:55,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:17:55,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:17:55,511 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:17:55,512 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:17:55,512 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:17:55,513 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:17:55,513 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:17:55,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:17:55,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:17:55,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:17:55,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:17:55,516 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:17:55,516 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:17:55,545 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 05:17:55,565 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 05:17:55,565 INFO L444 ModelExtractionUtils]: 55 out of 61 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-10 05:17:55,566 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 05:17:55,566 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 05:17:55,567 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 05:17:55,567 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcat_~s~0.offset, v_rep(select #length ULTIMATE.start_cstrcat_~s~0.base)_3) = -1*ULTIMATE.start_cstrcat_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_cstrcat_~s~0.base)_3 Supporting invariants [] [2018-11-10 05:17:55,646 INFO L297 tatePredicateManager]: 21 out of 21 supporting invariants were superfluous and have been removed [2018-11-10 05:17:55,648 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 05:17:55,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:17:55,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:17:55,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:17:55,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:17:55,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:17:55,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:17:55,701 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 05:17:55,701 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 6 Second operand 5 states. [2018-11-10 05:17:55,717 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 6. Second operand 5 states. Result 26 states and 31 transitions. Complement of second has 6 states. [2018-11-10 05:17:55,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 05:17:55,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 05:17:55,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2018-11-10 05:17:55,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 15 letters. Loop has 5 letters. [2018-11-10 05:17:55,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:17:55,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 20 letters. Loop has 5 letters. [2018-11-10 05:17:55,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:17:55,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 15 letters. Loop has 10 letters. [2018-11-10 05:17:55,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:17:55,719 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 31 transitions. [2018-11-10 05:17:55,720 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 05:17:55,720 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 0 states and 0 transitions. [2018-11-10 05:17:55,720 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 05:17:55,720 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 05:17:55,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 05:17:55,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:17:55,721 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:17:55,721 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:17:55,721 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:17:55,721 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 05:17:55,721 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 05:17:55,721 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 05:17:55,721 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 05:17:55,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 05:17:55 BoogieIcfgContainer [2018-11-10 05:17:55,726 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 05:17:55,726 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 05:17:55,726 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 05:17:55,727 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 05:17:55,727 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:17:51" (3/4) ... [2018-11-10 05:17:55,730 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 05:17:55,730 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 05:17:55,730 INFO L168 Benchmark]: Toolchain (without parser) took 5260.08 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 233.8 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -138.8 MB). Peak memory consumption was 95.1 MB. Max. memory is 11.5 GB. [2018-11-10 05:17:55,731 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:17:55,731 INFO L168 Benchmark]: CACSL2BoogieTranslator took 279.76 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 935.1 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 05:17:55,731 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 935.1 MB in the beginning and 1.1 GB in the end (delta: -199.6 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2018-11-10 05:17:55,732 INFO L168 Benchmark]: Boogie Preprocessor took 15.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 05:17:55,732 INFO L168 Benchmark]: RCFGBuilder took 198.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-11-10 05:17:55,732 INFO L168 Benchmark]: BuchiAutomizer took 4690.00 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 95.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.9 MB). Peak memory consumption was 112.9 MB. Max. memory is 11.5 GB. [2018-11-10 05:17:55,733 INFO L168 Benchmark]: Witness Printer took 3.28 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:17:55,735 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 279.76 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 935.1 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 69.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 935.1 MB in the beginning and 1.1 GB in the end (delta: -199.6 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 198.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4690.00 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 95.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.9 MB). Peak memory consumption was 112.9 MB. Max. memory is 11.5 GB. * Witness Printer took 3.28 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #Ultimate.alloc_#res - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (0 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[#Ultimate.alloc_#res] + -1 * s and consists of 6 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] + -1 * s and consists of 7 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[s] and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.6s and 4 iterations. TraceHistogramMax:2. Analysis of lassos took 4.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 20 states and ocurred in iteration 2. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 53 SDtfs, 79 SDslu, 50 SDs, 0 SdLazy, 40 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital228 mio100 ax100 hnf99 lsp97 ukn101 mio100 lsp43 div100 bol100 ite100 ukn100 eq195 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms 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...