./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/rec_strcopy_malloc.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4e82a563-9d29-41f6-91b9-262fa4ea3e11/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4e82a563-9d29-41f6-91b9-262fa4ea3e11/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4e82a563-9d29-41f6-91b9-262fa4ea3e11/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4e82a563-9d29-41f6-91b9-262fa4ea3e11/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/rec_strcopy_malloc.i -s /tmp/vcloud-vcloud-master/worker/working_dir_4e82a563-9d29-41f6-91b9-262fa4ea3e11/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4e82a563-9d29-41f6-91b9-262fa4ea3e11/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash cd11d9219c053905d9335ee000e770be1f4c60e6 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:57:49,770 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:57:49,772 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:57:49,782 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:57:49,784 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:57:49,785 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:57:49,786 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:57:49,789 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:57:49,792 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:57:49,793 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:57:49,795 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:57:49,797 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:57:49,803 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:57:49,804 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:57:49,805 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:57:49,806 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:57:49,806 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:57:49,807 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:57:49,811 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:57:49,813 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:57:49,814 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:57:49,815 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:57:49,821 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:57:49,824 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:57:49,826 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:57:49,830 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:57:49,830 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:57:49,831 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:57:49,831 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:57:49,832 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:57:49,832 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:57:49,833 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:57:49,833 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:57:49,834 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:57:49,835 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:57:49,835 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:57:49,837 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:57:49,837 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:57:49,837 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:57:49,838 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:57:49,840 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:57:49,840 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4e82a563-9d29-41f6-91b9-262fa4ea3e11/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 08:57:49,853 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:57:49,853 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:57:49,854 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:57:49,854 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:57:49,854 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:57:49,854 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:57:49,855 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:57:49,855 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:57:49,855 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:57:49,855 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:57:49,856 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:57:49,856 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:57:49,856 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:57:49,856 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:57:49,856 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:57:49,857 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:57:49,857 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:57:49,857 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:57:49,857 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:57:49,857 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:57:49,858 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:57:49,858 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:57:49,858 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:57:49,858 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:57:49,858 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:57:49,859 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:57:49,859 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:57:49,859 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:57:49,860 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:57:49,860 INFO L138 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_4e82a563-9d29-41f6-91b9-262fa4ea3e11/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cd11d9219c053905d9335ee000e770be1f4c60e6 [2019-10-22 08:57:49,886 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:57:49,896 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:57:49,900 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:57:49,901 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:57:49,901 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:57:49,902 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4e82a563-9d29-41f6-91b9-262fa4ea3e11/bin/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/rec_strcopy_malloc.i [2019-10-22 08:57:49,955 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4e82a563-9d29-41f6-91b9-262fa4ea3e11/bin/uautomizer/data/c4764da93/b16afa9654bb45249c4ff8d442c2704e/FLAG5b8bda115 [2019-10-22 08:57:50,353 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:57:50,353 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4e82a563-9d29-41f6-91b9-262fa4ea3e11/sv-benchmarks/c/termination-recursive-malloc/rec_strcopy_malloc.i [2019-10-22 08:57:50,359 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4e82a563-9d29-41f6-91b9-262fa4ea3e11/bin/uautomizer/data/c4764da93/b16afa9654bb45249c4ff8d442c2704e/FLAG5b8bda115 [2019-10-22 08:57:50,743 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4e82a563-9d29-41f6-91b9-262fa4ea3e11/bin/uautomizer/data/c4764da93/b16afa9654bb45249c4ff8d442c2704e [2019-10-22 08:57:50,746 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:57:50,747 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:57:50,748 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:57:50,748 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:57:50,752 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:57:50,753 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:57:50" (1/1) ... [2019-10-22 08:57:50,755 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6716a684 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:50, skipping insertion in model container [2019-10-22 08:57:50,755 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:57:50" (1/1) ... [2019-10-22 08:57:50,763 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:57:50,779 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:57:50,971 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:57:50,989 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:57:51,080 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:57:51,099 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:57:51,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:51 WrapperNode [2019-10-22 08:57:51,100 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:57:51,100 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:57:51,101 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:57:51,101 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:57:51,110 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:51" (1/1) ... [2019-10-22 08:57:51,121 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:51" (1/1) ... [2019-10-22 08:57:51,137 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:57:51,138 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:57:51,138 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:57:51,138 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:57:51,144 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:51" (1/1) ... [2019-10-22 08:57:51,145 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:51" (1/1) ... [2019-10-22 08:57:51,147 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:51" (1/1) ... [2019-10-22 08:57:51,147 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:51" (1/1) ... [2019-10-22 08:57:51,152 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:51" (1/1) ... [2019-10-22 08:57:51,154 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:51" (1/1) ... [2019-10-22 08:57:51,156 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:51" (1/1) ... [2019-10-22 08:57:51,158 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:57:51,158 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:57:51,158 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:57:51,158 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:57:51,159 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4e82a563-9d29-41f6-91b9-262fa4ea3e11/bin/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 [2019-10-22 08:57:51,210 INFO L130 BoogieDeclarations]: Found specification of procedure rec_strcopy_helper [2019-10-22 08:57:51,211 INFO L138 BoogieDeclarations]: Found implementation of procedure rec_strcopy_helper [2019-10-22 08:57:51,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:57:51,211 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 08:57:51,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:57:51,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:57:51,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:57:51,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:57:51,399 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:57:51,400 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-22 08:57:51,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:51 BoogieIcfgContainer [2019-10-22 08:57:51,401 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:57:51,402 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:57:51,402 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:57:51,406 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:57:51,407 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:57:51,407 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:57:50" (1/3) ... [2019-10-22 08:57:51,408 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1b9ef88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:57:51, skipping insertion in model container [2019-10-22 08:57:51,408 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:57:51,408 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:51" (2/3) ... [2019-10-22 08:57:51,409 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1b9ef88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:57:51, skipping insertion in model container [2019-10-22 08:57:51,409 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:57:51,409 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:51" (3/3) ... [2019-10-22 08:57:51,411 INFO L371 chiAutomizerObserver]: Analyzing ICFG rec_strcopy_malloc.i [2019-10-22 08:57:51,458 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:57:51,458 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:57:51,458 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:57:51,458 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:57:51,458 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:57:51,459 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:57:51,459 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:57:51,459 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:57:51,473 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-10-22 08:57:51,498 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:57:51,499 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:51,499 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:51,507 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:57:51,507 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:57:51,507 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:57:51,508 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-10-22 08:57:51,509 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:57:51,509 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:51,509 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:51,510 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:57:51,510 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:57:51,518 INFO L791 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true havoc main_#res;havoc main_#t~nondet5, main_#t~ret6.base, main_#t~ret6.offset, main_#t~ret7.base, main_#t~ret7.offset, main_~length~0, main_~original~0.base, main_~original~0.offset, main_~res~0.base, main_~res~0.offset;main_~length~0 := main_#t~nondet5;havoc main_#t~nondet5; 17#L35true assume main_~length~0 < 1;main_~length~0 := 1; 12#L35-2true build_nondet_String_#in~length := main_~length~0;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length := build_nondet_String_#in~length;call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 15#L12true main_#t~ret6.base, main_#t~ret6.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;main_~original~0.base, main_~original~0.offset := main_#t~ret6.base, main_#t~ret6.offset;havoc main_#t~ret6.base, main_#t~ret6.offset;rec_strcopy_#in~source.base, rec_strcopy_#in~source.offset, rec_strcopy_#in~length := main_~original~0.base, main_~original~0.offset, main_~length~0;havoc rec_strcopy_#res.base, rec_strcopy_#res.offset;havoc rec_strcopy_#t~malloc4.base, rec_strcopy_#t~malloc4.offset, rec_strcopy_~source.base, rec_strcopy_~source.offset, rec_strcopy_~length, rec_strcopy_~copyAlloc~0.base, rec_strcopy_~copyAlloc~0.offset;rec_strcopy_~source.base, rec_strcopy_~source.offset := rec_strcopy_#in~source.base, rec_strcopy_#in~source.offset;rec_strcopy_~length := rec_strcopy_#in~length;call rec_strcopy_#t~malloc4.base, rec_strcopy_#t~malloc4.offset := #Ultimate.allocOnHeap(rec_strcopy_~length);rec_strcopy_~copyAlloc~0.base, rec_strcopy_~copyAlloc~0.offset := rec_strcopy_#t~malloc4.base, rec_strcopy_#t~malloc4.offset; 4#L28true call rec_strcopy_helper(rec_strcopy_~source.base, rec_strcopy_~source.offset, rec_strcopy_~copyAlloc~0.base, rec_strcopy_~copyAlloc~0.offset);< 11#rec_strcopy_helperENTRYtrue [2019-10-22 08:57:51,518 INFO L793 eck$LassoCheckResult]: Loop: 11#rec_strcopy_helperENTRYtrue ~source.base, ~source.offset := #in~source.base, #in~source.offset;~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;call #t~mem2 := read~int(~source.base, ~source.offset, 1);call write~int(#t~mem2, ~dest.base, ~dest.offset, 1);havoc #t~mem2;call #t~mem3 := read~int(~source.base, ~source.offset, 1); 7#L21true assume 0 != #t~mem3;havoc #t~mem3; 14#L22true call rec_strcopy_helper(~source.base, 1 + ~source.offset, ~dest.base, 1 + ~dest.offset);< 11#rec_strcopy_helperENTRYtrue [2019-10-22 08:57:51,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:51,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1155759793, now seen corresponding path program 1 times [2019-10-22 08:57:51,532 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:51,533 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090581169] [2019-10-22 08:57:51,533 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:51,533 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:51,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:51,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:51,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:51,701 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:51,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:51,703 INFO L82 PathProgramCache]: Analyzing trace with hash 29912, now seen corresponding path program 1 times [2019-10-22 08:57:51,703 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:51,703 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070418546] [2019-10-22 08:57:51,704 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:51,704 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:51,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:51,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:51,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:51,734 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:51,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:51,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1512818648, now seen corresponding path program 1 times [2019-10-22 08:57:51,739 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:51,740 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869128708] [2019-10-22 08:57:51,740 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:51,740 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:51,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:51,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:51,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:51,948 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869128708] [2019-10-22 08:57:51,948 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:51,949 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 08:57:51,949 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209615176] [2019-10-22 08:57:52,136 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-10-22 08:57:52,285 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:52,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 08:57:52,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:57:52,301 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 7 states. [2019-10-22 08:57:52,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:52,437 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2019-10-22 08:57:52,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:57:52,439 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 29 transitions. [2019-10-22 08:57:52,442 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:57:52,446 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 9 states and 9 transitions. [2019-10-22 08:57:52,448 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-10-22 08:57:52,448 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-10-22 08:57:52,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 9 transitions. [2019-10-22 08:57:52,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:57:52,449 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-10-22 08:57:52,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 9 transitions. [2019-10-22 08:57:52,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-10-22 08:57:52,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-10-22 08:57:52,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-10-22 08:57:52,478 INFO L711 BuchiCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-10-22 08:57:52,479 INFO L591 BuchiCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-10-22 08:57:52,479 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:57:52,479 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 9 transitions. [2019-10-22 08:57:52,481 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:57:52,481 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:52,481 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:52,481 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:57:52,482 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:57:52,482 INFO L791 eck$LassoCheckResult]: Stem: 69#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 67#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~ret6.base, main_#t~ret6.offset, main_#t~ret7.base, main_#t~ret7.offset, main_~length~0, main_~original~0.base, main_~original~0.offset, main_~res~0.base, main_~res~0.offset;main_~length~0 := main_#t~nondet5;havoc main_#t~nondet5; 68#L35 assume !(main_~length~0 < 1); 74#L35-2 build_nondet_String_#in~length := main_~length~0;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length := build_nondet_String_#in~length;call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 75#L12 main_#t~ret6.base, main_#t~ret6.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;main_~original~0.base, main_~original~0.offset := main_#t~ret6.base, main_#t~ret6.offset;havoc main_#t~ret6.base, main_#t~ret6.offset;rec_strcopy_#in~source.base, rec_strcopy_#in~source.offset, rec_strcopy_#in~length := main_~original~0.base, main_~original~0.offset, main_~length~0;havoc rec_strcopy_#res.base, rec_strcopy_#res.offset;havoc rec_strcopy_#t~malloc4.base, rec_strcopy_#t~malloc4.offset, rec_strcopy_~source.base, rec_strcopy_~source.offset, rec_strcopy_~length, rec_strcopy_~copyAlloc~0.base, rec_strcopy_~copyAlloc~0.offset;rec_strcopy_~source.base, rec_strcopy_~source.offset := rec_strcopy_#in~source.base, rec_strcopy_#in~source.offset;rec_strcopy_~length := rec_strcopy_#in~length;call rec_strcopy_#t~malloc4.base, rec_strcopy_#t~malloc4.offset := #Ultimate.allocOnHeap(rec_strcopy_~length);rec_strcopy_~copyAlloc~0.base, rec_strcopy_~copyAlloc~0.offset := rec_strcopy_#t~malloc4.base, rec_strcopy_#t~malloc4.offset; 72#L28 call rec_strcopy_helper(rec_strcopy_~source.base, rec_strcopy_~source.offset, rec_strcopy_~copyAlloc~0.base, rec_strcopy_~copyAlloc~0.offset);< 70#rec_strcopy_helperENTRY [2019-10-22 08:57:52,482 INFO L793 eck$LassoCheckResult]: Loop: 70#rec_strcopy_helperENTRY ~source.base, ~source.offset := #in~source.base, #in~source.offset;~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;call #t~mem2 := read~int(~source.base, ~source.offset, 1);call write~int(#t~mem2, ~dest.base, ~dest.offset, 1);havoc #t~mem2;call #t~mem3 := read~int(~source.base, ~source.offset, 1); 73#L21 assume 0 != #t~mem3;havoc #t~mem3; 71#L22 call rec_strcopy_helper(~source.base, 1 + ~source.offset, ~dest.base, 1 + ~dest.offset);< 70#rec_strcopy_helperENTRY [2019-10-22 08:57:52,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:52,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1155819375, now seen corresponding path program 1 times [2019-10-22 08:57:52,483 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:52,483 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870720400] [2019-10-22 08:57:52,483 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:52,483 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:52,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:52,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:52,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:52,538 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:52,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:52,538 INFO L82 PathProgramCache]: Analyzing trace with hash 29912, now seen corresponding path program 2 times [2019-10-22 08:57:52,539 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:52,539 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859200837] [2019-10-22 08:57:52,539 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:52,539 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:52,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:52,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:52,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:52,567 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:52,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:52,568 INFO L82 PathProgramCache]: Analyzing trace with hash 262188714, now seen corresponding path program 1 times [2019-10-22 08:57:52,568 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:52,568 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766317131] [2019-10-22 08:57:52,569 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:52,569 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:52,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:52,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:52,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:52,630 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:53,145 WARN L191 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 96 [2019-10-22 08:57:53,261 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-10-22 08:57:53,383 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-10-22 08:57:53,448 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:57:53,449 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:57:53,449 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:57:53,449 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:57:53,450 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:57:53,450 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:53,450 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:57:53,450 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:57:53,450 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_strcopy_malloc.i_Iteration2_Lasso [2019-10-22 08:57:53,450 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:57:53,451 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:57: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 [2019-10-22 08:57: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 [2019-10-22 08:57:53,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:53,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:53,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:53,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:53,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:53,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:53,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:53,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:53,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:53,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:53,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:53,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:53,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:53,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:53,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:53,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:53,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:53,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:53,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:53,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:53,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:53,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:53,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:53,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:53,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:53,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:53,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:53,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:53,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:53,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:53,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:53,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:53,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:53,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:53,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:53,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:53,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:53,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:53,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:53,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:53,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:53,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:53,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:54,066 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:57:54,072 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:57:54,074 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:54,076 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:54,076 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:54,077 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:54,077 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:54,077 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:54,079 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:54,079 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:54,081 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:54,081 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:54,082 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:54,082 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:54,082 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:54,082 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:54,083 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:54,083 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:54,083 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:54,084 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:54,085 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:54,085 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:54,085 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:54,086 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:54,086 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:54,086 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:54,086 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:54,087 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:54,087 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:54,088 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:54,089 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:54,089 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:54,089 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:54,089 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:54,089 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:54,090 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:54,090 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:54,091 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:54,091 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:54,092 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:54,092 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:54,093 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:54,093 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:54,093 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:54,093 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:54,093 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:54,094 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:54,095 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:54,095 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:54,096 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:54,096 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:54,096 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:54,096 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:54,097 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:54,097 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:54,098 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:54,098 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:54,099 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:54,099 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:54,099 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:54,099 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:54,100 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:54,100 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:54,100 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:54,101 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:54,102 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:54,102 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:54,103 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:54,103 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:54,103 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:54,103 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:54,104 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:54,104 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:54,105 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:54,105 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:54,106 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:54,106 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:54,106 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:54,106 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:54,106 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:54,107 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:54,107 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:54,108 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:54,108 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:54,109 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:54,109 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:54,109 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:54,109 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:54,110 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:54,110 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:54,110 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:54,111 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:54,112 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:54,112 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:54,113 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:54,113 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:54,113 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:54,113 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:54,114 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:54,114 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:54,114 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:54,115 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:54,116 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:54,116 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:54,116 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:54,116 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:54,117 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:54,117 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:54,117 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:54,118 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:54,118 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:54,119 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:54,119 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:54,119 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:54,120 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:54,120 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:54,120 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:54,120 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:54,121 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:54,122 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:54,123 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:54,123 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:54,123 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:54,123 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:54,123 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:54,124 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:54,124 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:54,125 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:54,125 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:54,126 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:54,126 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:54,126 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:54,126 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:54,127 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:54,127 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:54,127 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:54,128 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:54,129 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:54,129 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:54,129 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:54,130 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:54,130 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:54,130 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:54,130 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:54,131 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:54,131 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:54,132 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:54,133 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:54,133 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:54,133 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:54,133 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:54,133 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:54,134 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:54,134 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:54,135 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:54,135 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:54,136 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:54,136 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:54,136 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:54,137 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:54,137 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:54,137 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:54,137 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:54,138 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:54,138 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:54,139 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:54,139 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:54,140 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:54,140 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:54,142 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:54,142 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:54,149 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:54,150 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:54,150 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:54,151 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 08:57:54,151 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:54,151 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:54,155 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 08:57:54,155 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:54,188 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:54,189 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:54,190 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:54,190 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:54,190 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:54,190 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:54,192 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:54,194 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:54,204 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:54,212 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:54,212 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:54,213 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:54,213 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:54,213 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:54,214 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:54,215 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:54,217 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:54,218 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:54,218 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:54,218 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:54,218 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:57:54,219 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:54,231 INFO L400 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-10-22 08:57:54,236 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-10-22 08:57:54,271 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:54,272 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:54,272 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:54,272 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:54,273 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:54,273 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:54,274 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:54,274 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:54,281 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:54,282 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:54,282 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:54,282 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:54,282 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:54,283 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:54,285 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:54,286 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:54,334 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:57:54,361 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:57:54,362 INFO L444 ModelExtractionUtils]: 12 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:57:54,364 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:57:54,366 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:57:54,366 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:57:54,367 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length rec_strcopy_helper_#in~dest.base)_1, rec_strcopy_helper_#in~dest.offset) = 1*v_rep(select #length rec_strcopy_helper_#in~dest.base)_1 - 1*rec_strcopy_helper_#in~dest.offset Supporting invariants [] [2019-10-22 08:57:54,385 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-10-22 08:57:54,394 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:57:54,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:54,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:54,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:57:54,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:54,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:54,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-22 08:57:54,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:54,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:54,481 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 08:57:54,482 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 9 transitions. cyclomatic complexity: 1 Second operand 3 states. [2019-10-22 08:57:54,527 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 9 transitions. cyclomatic complexity: 1. Second operand 3 states. Result 16 states and 16 transitions. Complement of second has 7 states. [2019-10-22 08:57:54,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 08:57:54,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:57:54,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2019-10-22 08:57:54,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 6 letters. Loop has 3 letters. [2019-10-22 08:57:54,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:54,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 9 letters. Loop has 3 letters. [2019-10-22 08:57:54,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:54,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 6 letters. Loop has 6 letters. [2019-10-22 08:57:54,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:54,533 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 16 transitions. [2019-10-22 08:57:54,534 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:57:54,534 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 0 states and 0 transitions. [2019-10-22 08:57:54,534 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:57:54,534 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:57:54,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:57:54,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:57:54,535 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:57:54,535 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:57:54,535 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:57:54,535 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:57:54,535 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:57:54,535 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:57:54,535 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:57:54,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:57:54 BoogieIcfgContainer [2019-10-22 08:57:54,545 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:57:54,546 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:57:54,546 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:57:54,546 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:57:54,546 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:51" (3/4) ... [2019-10-22 08:57:54,550 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:57:54,552 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:57:54,553 INFO L168 Benchmark]: Toolchain (without parser) took 3806.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 190.3 MB). Free memory was 949.9 MB in the beginning and 1.1 GB in the end (delta: -132.5 MB). Peak memory consumption was 57.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:54,555 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:57:54,556 INFO L168 Benchmark]: CACSL2BoogieTranslator took 351.83 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 949.9 MB in the beginning and 1.1 GB in the end (delta: -148.8 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:54,557 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.93 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:57:54,557 INFO L168 Benchmark]: Boogie Preprocessor took 20.34 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:57:54,558 INFO L168 Benchmark]: RCFGBuilder took 243.21 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:54,559 INFO L168 Benchmark]: BuchiAutomizer took 3143.51 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 82.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -7.6 MB). Peak memory consumption was 74.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:54,559 INFO L168 Benchmark]: Witness Printer took 6.17 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:57:54,562 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 351.83 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 949.9 MB in the beginning and 1.1 GB in the end (delta: -148.8 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.93 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.34 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 243.21 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3143.51 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 82.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -7.6 MB). Peak memory consumption was 74.7 MB. Max. memory is 11.5 GB. * Witness Printer took 6.17 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[dest] + -1 * dest and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.0s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 2.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 9 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 31 SDtfs, 18 SDslu, 84 SDs, 0 SdLazy, 49 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital161 mio100 ax100 hnf100 lsp96 ukn72 mio100 lsp49 div100 bol100 ite100 ukn100 eq190 hnf68 smp100 dnf102 smp97 tf100 neg100 sie122 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 53ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...