./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/run_dir_bfa5ef91-437c-4dc3-80a6-b6415c386381/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_bfa5ef91-437c-4dc3-80a6-b6415c386381/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_bfa5ef91-437c-4dc3-80a6-b6415c386381/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_bfa5ef91-437c-4dc3-80a6-b6415c386381/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/rec_strcopy_malloc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_bfa5ef91-437c-4dc3-80a6-b6415c386381/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_bfa5ef91-437c-4dc3-80a6-b6415c386381/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-11-15 22:05:53,751 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:05:53,753 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:05:53,771 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:05:53,771 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:05:53,773 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:05:53,775 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:05:53,786 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:05:53,791 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:05:53,795 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:05:53,797 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:05:53,798 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:05:53,799 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:05:53,801 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:05:53,803 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:05:53,804 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:05:53,805 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:05:53,807 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:05:53,810 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:05:53,814 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:05:53,818 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:05:53,820 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:05:53,823 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:05:53,824 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:05:53,827 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:05:53,828 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:05:53,828 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:05:53,830 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:05:53,830 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:05:53,831 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:05:53,832 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:05:53,832 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:05:53,833 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:05:53,834 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:05:53,836 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:05:53,836 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:05:53,838 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:05:53,838 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:05:53,838 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:05:53,839 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:05:53,840 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:05:53,842 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_bfa5ef91-437c-4dc3-80a6-b6415c386381/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 22:05:53,873 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:05:53,886 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:05:53,887 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:05:53,888 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:05:53,888 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:05:53,888 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 22:05:53,889 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 22:05:53,889 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 22:05:53,889 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 22:05:53,889 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 22:05:53,890 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 22:05:53,890 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:05:53,890 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 22:05:53,891 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:05:53,891 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:05:53,891 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 22:05:53,892 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 22:05:53,892 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 22:05:53,892 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:05:53,892 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 22:05:53,893 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:05:53,893 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 22:05:53,893 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:05:53,894 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:05:53,894 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 22:05:53,894 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:05:53,895 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:05:53,896 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 22:05:53,897 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 22:05:53,900 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/run_dir_bfa5ef91-437c-4dc3-80a6-b6415c386381/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-11-15 22:05:53,942 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:05:53,953 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:05:53,961 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:05:53,962 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:05:53,964 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:05:53,965 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_bfa5ef91-437c-4dc3-80a6-b6415c386381/bin/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/rec_strcopy_malloc.i [2019-11-15 22:05:54,043 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bfa5ef91-437c-4dc3-80a6-b6415c386381/bin/uautomizer/data/e24f863bf/c14197f9ae7e4351b7bc253b681e7693/FLAG12859afaa [2019-11-15 22:05:54,476 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:05:54,477 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_bfa5ef91-437c-4dc3-80a6-b6415c386381/sv-benchmarks/c/termination-recursive-malloc/rec_strcopy_malloc.i [2019-11-15 22:05:54,484 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bfa5ef91-437c-4dc3-80a6-b6415c386381/bin/uautomizer/data/e24f863bf/c14197f9ae7e4351b7bc253b681e7693/FLAG12859afaa [2019-11-15 22:05:54,793 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_bfa5ef91-437c-4dc3-80a6-b6415c386381/bin/uautomizer/data/e24f863bf/c14197f9ae7e4351b7bc253b681e7693 [2019-11-15 22:05:54,797 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:05:54,798 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:05:54,800 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:05:54,800 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:05:54,805 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:05:54,806 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:05:54" (1/1) ... [2019-11-15 22:05:54,809 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24a3561c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:05:54, skipping insertion in model container [2019-11-15 22:05:54,809 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:05:54" (1/1) ... [2019-11-15 22:05:54,818 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:05:54,836 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:05:55,065 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:05:55,193 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:05:55,220 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:05:55,238 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:05:55,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:05:55 WrapperNode [2019-11-15 22:05:55,239 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:05:55,240 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:05:55,240 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:05:55,240 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:05:55,250 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:05:55" (1/1) ... [2019-11-15 22:05:55,257 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:05:55" (1/1) ... [2019-11-15 22:05:55,276 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:05:55,276 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:05:55,276 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:05:55,276 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:05:55,285 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:05:55" (1/1) ... [2019-11-15 22:05:55,285 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:05:55" (1/1) ... [2019-11-15 22:05:55,300 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:05:55" (1/1) ... [2019-11-15 22:05:55,300 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:05:55" (1/1) ... [2019-11-15 22:05:55,307 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:05:55" (1/1) ... [2019-11-15 22:05:55,309 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:05:55" (1/1) ... [2019-11-15 22:05:55,311 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:05:55" (1/1) ... [2019-11-15 22:05:55,313 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:05:55,313 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:05:55,314 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:05:55,314 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:05:55,315 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:05:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bfa5ef91-437c-4dc3-80a6-b6415c386381/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-11-15 22:05:55,381 INFO L130 BoogieDeclarations]: Found specification of procedure rec_strcopy_helper [2019-11-15 22:05:55,381 INFO L138 BoogieDeclarations]: Found implementation of procedure rec_strcopy_helper [2019-11-15 22:05:55,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 22:05:55,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 22:05:55,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:05:55,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:05:55,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 22:05:55,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:05:55,603 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:05:55,603 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 22:05:55,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:05:55 BoogieIcfgContainer [2019-11-15 22:05:55,605 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:05:55,605 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 22:05:55,605 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 22:05:55,609 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 22:05:55,609 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:05:55,610 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 10:05:54" (1/3) ... [2019-11-15 22:05:55,611 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1d2f50e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:05:55, skipping insertion in model container [2019-11-15 22:05:55,611 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:05:55,611 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:05:55" (2/3) ... [2019-11-15 22:05:55,611 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1d2f50e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:05:55, skipping insertion in model container [2019-11-15 22:05:55,612 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:05:55,612 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:05:55" (3/3) ... [2019-11-15 22:05:55,613 INFO L371 chiAutomizerObserver]: Analyzing ICFG rec_strcopy_malloc.i [2019-11-15 22:05:55,687 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 22:05:55,687 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 22:05:55,687 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 22:05:55,687 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:05:55,688 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:05:55,688 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 22:05:55,688 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:05:55,688 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 22:05:55,719 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-11-15 22:05:55,743 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:05:55,743 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:05:55,743 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:05:55,751 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-15 22:05:55,751 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:05:55,751 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 22:05:55,752 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-11-15 22:05:55,753 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:05:55,754 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:05:55,754 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:05:55,754 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-15 22:05:55,754 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:05:55,762 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-11-15 22:05:55,763 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-11-15 22:05:55,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:05:55,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1155759793, now seen corresponding path program 1 times [2019-11-15 22:05:55,779 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:05:55,779 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541879225] [2019-11-15 22:05:55,779 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:05:55,780 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:05:55,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:05:55,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:05:55,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:05:55,972 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:05:55,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:05:55,973 INFO L82 PathProgramCache]: Analyzing trace with hash 29912, now seen corresponding path program 1 times [2019-11-15 22:05:55,973 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:05:55,974 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286913937] [2019-11-15 22:05:55,974 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:05:55,974 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:05:55,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:05:55,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:05:56,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:05:56,004 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:05:56,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:05:56,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1512818648, now seen corresponding path program 1 times [2019-11-15 22:05:56,006 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:05:56,007 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520258849] [2019-11-15 22:05:56,007 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:05:56,007 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:05:56,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:05:56,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:05:56,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:05:56,247 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520258849] [2019-11-15 22:05:56,248 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:05:56,248 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 22:05:56,248 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630751263] [2019-11-15 22:05:56,593 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:05:56,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:05:56,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:05:56,613 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 7 states. [2019-11-15 22:05:56,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:05:56,836 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2019-11-15 22:05:56,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:05:56,841 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 29 transitions. [2019-11-15 22:05:56,844 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:05:56,850 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 9 states and 9 transitions. [2019-11-15 22:05:56,852 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-15 22:05:56,853 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-15 22:05:56,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 9 transitions. [2019-11-15 22:05:56,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:05:56,854 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-11-15 22:05:56,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 9 transitions. [2019-11-15 22:05:56,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-11-15 22:05:56,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-15 22:05:56,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-11-15 22:05:56,886 INFO L711 BuchiCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-11-15 22:05:56,886 INFO L591 BuchiCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-11-15 22:05:56,886 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 22:05:56,887 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 9 transitions. [2019-11-15 22:05:56,891 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:05:56,891 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:05:56,891 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:05:56,892 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-15 22:05:56,892 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:05:56,892 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-11-15 22:05:56,892 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-11-15 22:05:56,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:05:56,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1155819375, now seen corresponding path program 1 times [2019-11-15 22:05:56,894 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:05:56,897 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776265108] [2019-11-15 22:05:56,898 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:05:56,898 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:05:56,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:05:56,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:05:56,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:05:56,954 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:05:56,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:05:56,955 INFO L82 PathProgramCache]: Analyzing trace with hash 29912, now seen corresponding path program 2 times [2019-11-15 22:05:56,955 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:05:56,955 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817377906] [2019-11-15 22:05:56,955 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:05:56,955 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:05:56,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:05:56,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:05:56,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:05:56,973 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:05:56,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:05:56,974 INFO L82 PathProgramCache]: Analyzing trace with hash 262188714, now seen corresponding path program 1 times [2019-11-15 22:05:56,974 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:05:56,974 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310360042] [2019-11-15 22:05:56,974 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:05:56,974 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:05:56,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:05:56,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:05:57,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:05:57,027 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:05:57,807 WARN L191 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 96 [2019-11-15 22:05:57,970 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-11-15 22:05:58,177 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-11-15 22:05:58,278 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:05:58,279 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:05:58,279 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:05:58,279 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:05:58,280 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:05:58,280 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:05:58,280 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:05:58,280 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:05:58,280 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_strcopy_malloc.i_Iteration2_Lasso [2019-11-15 22:05:58,281 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:05:58,281 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:05:58,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:05:58,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:05:58,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:05:58,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:05:58,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:05:58,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:05:58,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:05:58,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:05:58,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:05:58,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:05:58,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:05:58,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:05:58,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:05:58,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:05:58,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:05:58,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:05:58,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:05:58,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:05:58,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:05:58,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:05:58,641 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-11-15 22:05:58,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:05:58,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:05:58,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:05:58,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:05:58,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:05:58,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:05:58,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:05:58,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:05:58,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:05:58,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:05:58,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:05:58,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:05:58,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:05:58,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:05:58,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:05:58,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-11-15 22:05:58,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:05:58,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-11-15 22:05:58,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-11-15 22:05:58,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-11-15 22:05:58,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:05:58,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:05:58,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:05:58,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:05:58,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:05:59,127 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:05:59,132 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:05:59,134 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-11-15 22:05:59,136 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:05:59,136 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:05:59,137 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:05:59,137 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:05:59,137 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:05:59,140 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:05:59,140 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:05:59,142 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:05:59,143 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-11-15 22:05:59,143 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:05:59,144 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:05:59,144 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:05:59,144 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:05:59,144 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:05:59,145 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:05:59,145 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:05:59,146 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:05:59,146 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-11-15 22:05:59,147 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:05:59,148 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:05:59,148 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:05:59,148 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:05:59,148 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:05:59,149 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:05:59,149 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:05:59,150 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:05:59,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-11-15 22:05:59,151 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:05:59,151 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:05:59,152 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:05:59,152 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:05:59,152 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:05:59,153 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:05:59,153 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:05:59,154 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:05:59,154 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-11-15 22:05:59,155 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:05:59,155 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:05:59,156 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:05:59,156 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:05:59,156 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:05:59,157 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:05:59,157 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:05:59,158 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:05:59,158 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-11-15 22:05:59,159 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:05:59,159 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:05:59,160 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:05:59,160 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:05:59,160 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:05:59,161 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:05:59,161 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:05:59,162 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:05:59,163 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-11-15 22:05:59,163 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:05:59,164 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:05:59,164 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:05:59,164 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:05:59,164 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:05:59,165 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:05:59,165 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:05:59,166 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:05:59,167 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-11-15 22:05:59,167 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:05:59,168 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:05:59,168 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:05:59,168 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:05:59,168 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:05:59,169 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:05:59,169 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:05:59,170 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:05:59,171 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-11-15 22:05:59,171 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:05:59,172 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:05:59,172 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:05:59,172 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:05:59,172 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:05:59,173 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:05:59,173 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:05:59,174 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:05:59,175 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-11-15 22:05:59,175 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:05:59,176 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:05:59,176 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:05:59,176 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:05:59,176 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:05:59,177 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:05:59,177 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:05:59,178 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:05:59,179 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-11-15 22:05:59,179 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:05:59,180 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:05:59,180 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:05:59,180 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:05:59,180 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:05:59,181 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:05:59,181 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:05:59,182 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:05:59,182 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-11-15 22:05:59,183 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:05:59,183 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:05:59,184 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:05:59,184 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:05:59,184 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:05:59,185 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:05:59,185 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:05:59,186 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:05:59,186 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-11-15 22:05:59,187 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:05:59,187 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:05:59,187 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:05:59,188 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:05:59,188 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:05:59,188 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:05:59,189 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:05:59,190 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:05:59,190 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-11-15 22:05:59,191 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:05:59,191 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:05:59,192 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:05:59,192 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:05:59,192 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:05:59,193 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:05:59,193 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:05:59,194 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:05:59,194 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-11-15 22:05:59,195 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:05:59,195 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:05:59,195 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:05:59,196 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:05:59,196 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:05:59,196 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:05:59,197 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:05:59,197 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:05:59,198 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-11-15 22:05:59,199 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:05:59,199 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:05:59,199 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:05:59,199 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:05:59,200 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:05:59,200 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:05:59,200 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:05:59,201 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:05:59,202 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-11-15 22:05:59,202 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:05:59,203 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:05:59,203 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:05:59,203 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:05:59,203 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:05:59,204 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:05:59,204 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:05:59,205 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:05:59,205 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-11-15 22:05:59,206 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:05:59,206 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:05:59,206 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:05:59,206 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:05:59,207 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:05:59,207 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:05:59,207 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:05:59,208 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:05:59,209 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-11-15 22:05:59,209 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:05:59,210 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:05:59,210 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:05:59,210 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:05:59,213 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:05:59,213 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:05:59,216 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:05:59,217 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-11-15 22:05:59,218 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:05:59,218 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-15 22:05:59,218 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:05:59,218 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:05:59,223 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 22:05:59,223 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:05:59,243 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:05:59,244 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-11-15 22:05:59,244 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:05:59,245 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:05:59,245 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:05:59,245 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:05:59,247 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:05:59,248 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:05:59,253 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:05:59,254 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-11-15 22:05:59,255 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:05:59,255 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:05:59,255 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:05:59,256 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:05:59,257 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:05:59,258 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:05:59,261 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:05:59,261 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-11-15 22:05:59,262 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:05:59,262 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:05:59,262 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 22:05:59,263 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:05:59,269 INFO L400 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-11-15 22:05:59,270 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 22:05:59,299 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:05:59,300 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-11-15 22:05:59,300 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:05:59,301 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:05:59,301 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:05:59,301 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:05:59,303 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:05:59,303 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:05:59,311 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:05:59,311 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-11-15 22:05:59,312 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:05:59,312 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:05:59,313 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:05:59,313 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:05:59,316 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:05:59,316 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:05:59,368 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:05:59,393 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 22:05:59,394 INFO L444 ModelExtractionUtils]: 12 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 22:05:59,396 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:05:59,398 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:05:59,399 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:05:59,400 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-11-15 22:05:59,432 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-11-15 22:05:59,443 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 22:05:59,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:05:59,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:05:59,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:05:59,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:05:59,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:05:59,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-15 22:05:59,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:05:59,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:05:59,584 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-11-15 22:05:59,589 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 9 transitions. cyclomatic complexity: 1 Second operand 3 states. [2019-11-15 22:05:59,666 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-11-15 22:05:59,668 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-11-15 22:05:59,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:05:59,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2019-11-15 22:05:59,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 6 letters. Loop has 3 letters. [2019-11-15 22:05:59,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:05:59,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 9 letters. Loop has 3 letters. [2019-11-15 22:05:59,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:05:59,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 6 letters. Loop has 6 letters. [2019-11-15 22:05:59,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:05:59,674 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 16 transitions. [2019-11-15 22:05:59,675 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 22:05:59,675 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 0 states and 0 transitions. [2019-11-15 22:05:59,675 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 22:05:59,678 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 22:05:59,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 22:05:59,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:05:59,680 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:05:59,680 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:05:59,682 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:05:59,682 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 22:05:59,682 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 22:05:59,682 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 22:05:59,682 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 22:05:59,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 10:05:59 BoogieIcfgContainer [2019-11-15 22:05:59,692 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 22:05:59,693 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:05:59,693 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:05:59,693 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:05:59,694 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:05:55" (3/4) ... [2019-11-15 22:05:59,711 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 22:05:59,711 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:05:59,713 INFO L168 Benchmark]: Toolchain (without parser) took 4914.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 946.1 MB in the beginning and 969.0 MB in the end (delta: -22.9 MB). Peak memory consumption was 124.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:05:59,714 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:05:59,715 INFO L168 Benchmark]: CACSL2BoogieTranslator took 439.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -196.1 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-11-15 22:05:59,715 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.98 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-11-15 22:05:59,716 INFO L168 Benchmark]: Boogie Preprocessor took 37.03 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-11-15 22:05:59,716 INFO L168 Benchmark]: RCFGBuilder took 291.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-11-15 22:05:59,717 INFO L168 Benchmark]: BuchiAutomizer took 4087.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 969.0 MB in the end (delta: 149.5 MB). Peak memory consumption was 149.5 MB. Max. memory is 11.5 GB. [2019-11-15 22:05:59,718 INFO L168 Benchmark]: Witness Printer took 18.26 ms. Allocated memory is still 1.2 GB. Free memory is still 969.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:05:59,722 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.27 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 439.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -196.1 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.98 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. * Boogie Preprocessor took 37.03 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 291.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4087.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 969.0 MB in the end (delta: 149.5 MB). Peak memory consumption was 149.5 MB. Max. memory is 11.5 GB. * Witness Printer took 18.26 ms. Allocated memory is still 1.2 GB. Free memory is still 969.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * 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 4.0s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 3.3s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. 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.1s 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: 37ms 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...