./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex5.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_b9ddc4ba-0d7e-4fa0-b0d9-6eb4be799168/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_b9ddc4ba-0d7e-4fa0-b0d9-6eb4be799168/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b9ddc4ba-0d7e-4fa0-b0d9-6eb4be799168/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b9ddc4ba-0d7e-4fa0-b0d9-6eb4be799168/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex5.i -s /tmp/vcloud-vcloud-master/worker/run_dir_b9ddc4ba-0d7e-4fa0-b0d9-6eb4be799168/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b9ddc4ba-0d7e-4fa0-b0d9-6eb4be799168/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 f7c8cd0f6441598a9b17eacee015376606f871a4 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 21:15:22,698 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:15:22,700 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:15:22,715 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:15:22,715 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:15:22,716 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:15:22,718 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:15:22,730 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:15:22,732 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:15:22,732 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:15:22,733 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:15:22,734 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:15:22,734 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:15:22,735 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:15:22,736 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:15:22,737 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:15:22,738 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:15:22,738 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:15:22,740 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:15:22,742 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:15:22,743 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:15:22,744 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:15:22,745 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:15:22,745 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:15:22,748 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:15:22,748 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:15:22,749 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:15:22,750 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:15:22,750 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:15:22,751 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:15:22,751 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:15:22,752 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:15:22,752 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:15:22,753 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:15:22,754 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:15:22,754 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:15:22,755 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:15:22,755 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:15:22,755 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:15:22,756 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:15:22,756 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:15:22,757 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b9ddc4ba-0d7e-4fa0-b0d9-6eb4be799168/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 21:15:22,782 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:15:22,782 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:15:22,783 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:15:22,784 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:15:22,784 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:15:22,784 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 21:15:22,784 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 21:15:22,784 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 21:15:22,785 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 21:15:22,785 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 21:15:22,786 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 21:15:22,786 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:15:22,786 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 21:15:22,787 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:15:22,787 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:15:22,787 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 21:15:22,787 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 21:15:22,787 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 21:15:22,788 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:15:22,788 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 21:15:22,788 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:15:22,788 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 21:15:22,788 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:15:22,789 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:15:22,789 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 21:15:22,789 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:15:22,789 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:15:22,790 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 21:15:22,791 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 21:15:22,791 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_b9ddc4ba-0d7e-4fa0-b0d9-6eb4be799168/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 -> f7c8cd0f6441598a9b17eacee015376606f871a4 [2019-11-15 21:15:22,833 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:15:22,843 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:15:22,846 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:15:22,847 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:15:22,848 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:15:22,849 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b9ddc4ba-0d7e-4fa0-b0d9-6eb4be799168/bin/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex5.i [2019-11-15 21:15:22,905 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b9ddc4ba-0d7e-4fa0-b0d9-6eb4be799168/bin/uautomizer/data/37b3d8015/7fd0494a893d445e8df611d62cb7630a/FLAG453e1de16 [2019-11-15 21:15:23,309 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:15:23,310 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b9ddc4ba-0d7e-4fa0-b0d9-6eb4be799168/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex5.i [2019-11-15 21:15:23,317 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b9ddc4ba-0d7e-4fa0-b0d9-6eb4be799168/bin/uautomizer/data/37b3d8015/7fd0494a893d445e8df611d62cb7630a/FLAG453e1de16 [2019-11-15 21:15:23,332 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b9ddc4ba-0d7e-4fa0-b0d9-6eb4be799168/bin/uautomizer/data/37b3d8015/7fd0494a893d445e8df611d62cb7630a [2019-11-15 21:15:23,337 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:15:23,338 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:15:23,342 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:15:23,342 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:15:23,345 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:15:23,346 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:15:23" (1/1) ... [2019-11-15 21:15:23,349 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33934ced and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:15:23, skipping insertion in model container [2019-11-15 21:15:23,349 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:15:23" (1/1) ... [2019-11-15 21:15:23,356 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:15:23,375 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:15:23,625 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:15:23,636 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:15:23,652 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:15:23,666 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:15:23,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:15:23 WrapperNode [2019-11-15 21:15:23,666 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:15:23,667 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:15:23,667 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:15:23,667 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:15:23,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:15:23" (1/1) ... [2019-11-15 21:15:23,683 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:15:23" (1/1) ... [2019-11-15 21:15:23,700 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:15:23,701 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:15:23,701 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:15:23,701 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:15:23,707 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:15:23" (1/1) ... [2019-11-15 21:15:23,707 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:15:23" (1/1) ... [2019-11-15 21:15:23,709 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:15:23" (1/1) ... [2019-11-15 21:15:23,709 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:15:23" (1/1) ... [2019-11-15 21:15:23,714 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:15:23" (1/1) ... [2019-11-15 21:15:23,716 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:15:23" (1/1) ... [2019-11-15 21:15:23,717 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:15:23" (1/1) ... [2019-11-15 21:15:23,719 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:15:23,720 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:15:23,720 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:15:23,720 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:15:23,721 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:15:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b9ddc4ba-0d7e-4fa0-b0d9-6eb4be799168/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 21:15:23,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 21:15:23,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 21:15:23,778 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-11-15 21:15:23,778 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-11-15 21:15:23,778 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-11-15 21:15:23,778 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-11-15 21:15:23,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:15:23,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:15:23,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 21:15:23,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 21:15:24,010 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:15:24,010 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-15 21:15:24,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:15:24 BoogieIcfgContainer [2019-11-15 21:15:24,012 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:15:24,012 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 21:15:24,012 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 21:15:24,015 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 21:15:24,016 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:15:24,016 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 09:15:23" (1/3) ... [2019-11-15 21:15:24,017 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1ea2eca2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 09:15:24, skipping insertion in model container [2019-11-15 21:15:24,017 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:15:24,017 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:15:23" (2/3) ... [2019-11-15 21:15:24,018 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1ea2eca2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 09:15:24, skipping insertion in model container [2019-11-15 21:15:24,018 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:15:24,018 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:15:24" (3/3) ... [2019-11-15 21:15:24,019 INFO L371 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex5.i [2019-11-15 21:15:24,102 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 21:15:24,102 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 21:15:24,102 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 21:15:24,103 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:15:24,103 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:15:24,103 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 21:15:24,103 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:15:24,103 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 21:15:24,118 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2019-11-15 21:15:24,138 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-15 21:15:24,138 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:15:24,138 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:15:24,145 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 21:15:24,146 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:15:24,146 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 21:15:24,146 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2019-11-15 21:15:24,148 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-15 21:15:24,148 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:15:24,148 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:15:24,149 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 21:15:24,149 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:15:24,154 INFO L791 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true havoc main_#res;havoc main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~short17, main_#t~mem18, main_#t~ret19.base, main_#t~ret19.offset, main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnHeap(4);main_~p1~0.base, main_~p1~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnHeap(4);main_~p2~0.base, main_~p2~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(main_#t~nondet13, main_~p1~0.base, main_~p1~0.offset, 4);havoc main_#t~nondet13;call write~int(main_#t~nondet14, main_~p2~0.base, main_~p2~0.offset, 4);havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~p1~0.base, main_~p1~0.offset, 4);main_#t~short17 := main_#t~mem15 < 0; 13#L63true assume !main_#t~short17;call main_#t~mem16 := read~int(main_~p2~0.base, main_~p2~0.offset, 4);main_#t~short17 := main_#t~mem16 < 0; 8#L63-2true assume !main_#t~short17;havoc main_#t~short17;havoc main_#t~mem15;havoc main_#t~mem16;call main_#t~mem18 := read~int(main_~p2~0.base, main_~p2~0.offset, 4); 21#L66true call main_#t~ret19.base, main_#t~ret19.offset := f(main_~p1~0.base, main_~p1~0.offset, main_#t~mem18);< 18#fENTRYtrue [2019-11-15 21:15:24,155 INFO L793 eck$LassoCheckResult]: Loop: 18#fENTRYtrue ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 11#L17true assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 19#L25true call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 15#gENTRYtrue ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 3#L34true assume #t~mem5 < 0;havoc #t~mem5;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc6.base, #t~malloc6.offset; 4#gFINALtrue assume true; 7#gEXITtrue >#37#return; 22#L25-1true call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1);< 18#fENTRYtrue [2019-11-15 21:15:24,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:24,160 INFO L82 PathProgramCache]: Analyzing trace with hash 44919073, now seen corresponding path program 1 times [2019-11-15 21:15:24,166 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:15:24,166 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579198404] [2019-11-15 21:15:24,166 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:24,166 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:24,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:15:24,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:15:24,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:15:24,315 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:15:24,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:24,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1513071857, now seen corresponding path program 1 times [2019-11-15 21:15:24,316 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:15:24,316 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469934534] [2019-11-15 21:15:24,317 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:24,317 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:24,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:15:24,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:24,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:24,501 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 21:15:24,502 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469934534] [2019-11-15 21:15:24,502 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:15:24,503 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:15:24,503 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436482923] [2019-11-15 21:15:24,507 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:15:24,508 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:15:24,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:15:24,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:15:24,524 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 6 states. [2019-11-15 21:15:24,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:15:24,659 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2019-11-15 21:15:24,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:15:24,662 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2019-11-15 21:15:24,665 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-15 21:15:24,671 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 17 states and 20 transitions. [2019-11-15 21:15:24,672 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-11-15 21:15:24,672 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-15 21:15:24,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 20 transitions. [2019-11-15 21:15:24,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:15:24,675 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-11-15 21:15:24,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 20 transitions. [2019-11-15 21:15:24,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-15 21:15:24,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-15 21:15:24,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-11-15 21:15:24,702 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-11-15 21:15:24,702 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-11-15 21:15:24,702 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 21:15:24,702 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2019-11-15 21:15:24,703 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-15 21:15:24,703 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:15:24,703 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:15:24,704 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 21:15:24,704 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:15:24,704 INFO L791 eck$LassoCheckResult]: Stem: 78#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 76#L-1 havoc main_#res;havoc main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~short17, main_#t~mem18, main_#t~ret19.base, main_#t~ret19.offset, main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnHeap(4);main_~p1~0.base, main_~p1~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnHeap(4);main_~p2~0.base, main_~p2~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(main_#t~nondet13, main_~p1~0.base, main_~p1~0.offset, 4);havoc main_#t~nondet13;call write~int(main_#t~nondet14, main_~p2~0.base, main_~p2~0.offset, 4);havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~p1~0.base, main_~p1~0.offset, 4);main_#t~short17 := main_#t~mem15 < 0; 77#L63 assume !main_#t~short17;call main_#t~mem16 := read~int(main_~p2~0.base, main_~p2~0.offset, 4);main_#t~short17 := main_#t~mem16 < 0; 71#L63-2 assume !main_#t~short17;havoc main_#t~short17;havoc main_#t~mem15;havoc main_#t~mem16;call main_#t~mem18 := read~int(main_~p2~0.base, main_~p2~0.offset, 4); 72#L66 call main_#t~ret19.base, main_#t~ret19.offset := f(main_~p1~0.base, main_~p1~0.offset, main_#t~mem18);< 79#fENTRY [2019-11-15 21:15:24,705 INFO L793 eck$LassoCheckResult]: Loop: 79#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 74#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 65#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 69#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 64#L34 assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~mem7;havoc #t~post8; 66#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 69#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 64#L34 assume #t~mem5 < 0;havoc #t~mem5;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc6.base, #t~malloc6.offset; 67#gFINAL assume true; 68#gEXIT >#41#return; 70#L42-1 ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset; 73#gFINAL assume true; 80#gEXIT >#37#return; 75#L25-1 call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1);< 79#fENTRY [2019-11-15 21:15:24,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:24,705 INFO L82 PathProgramCache]: Analyzing trace with hash 44919073, now seen corresponding path program 2 times [2019-11-15 21:15:24,705 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:15:24,705 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705223743] [2019-11-15 21:15:24,706 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:24,706 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:24,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:15:24,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:15:24,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:15:24,740 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:15:24,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:24,740 INFO L82 PathProgramCache]: Analyzing trace with hash 916774883, now seen corresponding path program 1 times [2019-11-15 21:15:24,741 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:15:24,741 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554645160] [2019-11-15 21:15:24,741 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:24,741 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:24,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:15:24,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:24,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:24,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:24,955 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 21:15:24,955 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554645160] [2019-11-15 21:15:24,955 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691356424] [2019-11-15 21:15:24,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b9ddc4ba-0d7e-4fa0-b0d9-6eb4be799168/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:15:25,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:25,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-15 21:15:25,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:15:25,103 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 21:15:25,104 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:15:25,110 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:15:25,112 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:15:25,112 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2019-11-15 21:15:25,249 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 21:15:25,249 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:15:25,249 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2019-11-15 21:15:25,249 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783294957] [2019-11-15 21:15:25,250 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:15:25,250 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:15:25,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-15 21:15:25,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-11-15 21:15:25,251 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 15 states. [2019-11-15 21:15:25,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:15:25,527 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2019-11-15 21:15:25,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:15:25,528 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 23 transitions. [2019-11-15 21:15:25,529 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-15 21:15:25,530 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 23 transitions. [2019-11-15 21:15:25,530 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-15 21:15:25,531 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-15 21:15:25,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2019-11-15 21:15:25,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:15:25,531 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-11-15 21:15:25,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2019-11-15 21:15:25,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-11-15 21:15:25,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-15 21:15:25,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-11-15 21:15:25,534 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-11-15 21:15:25,534 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-11-15 21:15:25,534 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 21:15:25,535 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2019-11-15 21:15:25,535 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-15 21:15:25,535 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:15:25,536 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:15:25,536 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 21:15:25,537 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-15 21:15:25,540 INFO L791 eck$LassoCheckResult]: Stem: 192#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 190#L-1 havoc main_#res;havoc main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~short17, main_#t~mem18, main_#t~ret19.base, main_#t~ret19.offset, main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnHeap(4);main_~p1~0.base, main_~p1~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnHeap(4);main_~p2~0.base, main_~p2~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(main_#t~nondet13, main_~p1~0.base, main_~p1~0.offset, 4);havoc main_#t~nondet13;call write~int(main_#t~nondet14, main_~p2~0.base, main_~p2~0.offset, 4);havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~p1~0.base, main_~p1~0.offset, 4);main_#t~short17 := main_#t~mem15 < 0; 191#L63 assume !main_#t~short17;call main_#t~mem16 := read~int(main_~p2~0.base, main_~p2~0.offset, 4);main_#t~short17 := main_#t~mem16 < 0; 185#L63-2 assume !main_#t~short17;havoc main_#t~short17;havoc main_#t~mem15;havoc main_#t~mem16;call main_#t~mem18 := read~int(main_~p2~0.base, main_~p2~0.offset, 4); 186#L66 call main_#t~ret19.base, main_#t~ret19.offset := f(main_~p1~0.base, main_~p1~0.offset, main_#t~mem18);< 193#fENTRY [2019-11-15 21:15:25,540 INFO L793 eck$LassoCheckResult]: Loop: 193#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 188#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 179#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 183#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 178#L34 assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~mem7;havoc #t~post8; 180#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 183#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 178#L34 assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~mem7;havoc #t~post8; 180#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 183#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 178#L34 assume #t~mem5 < 0;havoc #t~mem5;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc6.base, #t~malloc6.offset; 181#gFINAL assume true; 182#gEXIT >#41#return; 184#L42-1 ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset; 187#gFINAL assume true; 197#gEXIT >#41#return; 195#L42-1 ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset; 196#gFINAL assume true; 194#gEXIT >#37#return; 189#L25-1 call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1);< 193#fENTRY [2019-11-15 21:15:25,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:25,540 INFO L82 PathProgramCache]: Analyzing trace with hash 44919073, now seen corresponding path program 3 times [2019-11-15 21:15:25,541 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:15:25,541 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898911758] [2019-11-15 21:15:25,541 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:25,541 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:25,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:15:25,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:15:25,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:15:25,595 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:15:25,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:25,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1267451407, now seen corresponding path program 2 times [2019-11-15 21:15:25,596 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:15:25,596 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83032082] [2019-11-15 21:15:25,596 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:25,596 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:25,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:15:25,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:15:25,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:15:25,645 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:15:25,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:25,646 INFO L82 PathProgramCache]: Analyzing trace with hash -2054594769, now seen corresponding path program 1 times [2019-11-15 21:15:25,646 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:15:25,646 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965812792] [2019-11-15 21:15:25,646 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:25,646 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:25,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:15:25,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:15:25,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:15:25,717 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:15:26,383 WARN L191 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 97 [2019-11-15 21:15:26,619 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-11-15 21:15:27,110 WARN L191 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 111 [2019-11-15 21:15:27,229 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-11-15 21:15:27,367 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-11-15 21:15:27,515 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-11-15 21:15:27,937 WARN L191 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 125 [2019-11-15 21:15:28,055 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-11-15 21:15:28,178 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-11-15 21:15:28,509 WARN L191 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 90 [2019-11-15 21:15:28,761 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:15:28,762 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:15:28,762 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:15:28,762 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:15:28,763 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:15:28,763 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:15:28,763 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:15:28,763 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:15:28,763 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex5.i_Iteration3_Lasso [2019-11-15 21:15:28,764 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:15:28,764 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:15:28,783 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 21:15:28,790 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 21:15:28,792 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 21:15:28,794 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 21:15:28,795 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 21:15:28,797 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 21:15:28,799 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 21:15:28,801 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 21:15:28,803 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 21:15:28,806 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 21:15:28,808 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 21:15:28,810 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 21:15:28,812 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 21:15:28,814 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 21:15:28,817 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 21:15:28,996 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 21:15:28,999 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 21:15:29,001 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 21:15:29,003 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 21:15:29,004 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 21:15:29,006 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 21:15:29,008 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 21:15:29,009 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 21:15:29,011 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 21:15:29,013 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 21:15:29,019 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 21:15:29,020 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 21:15:29,022 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 21:15:29,025 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 21:15:29,026 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 21:15:29,027 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 21:15:29,029 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 21:15:29,030 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 21:15:29,032 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 21:15:29,033 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 21:15:29,034 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 21:15:29,036 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 21:15:29,037 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 21:15:29,039 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 21:15:29,641 WARN L191 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-11-15 21:15:29,738 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:15:29,748 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:15:29,751 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 21:15:29,761 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:15:29,761 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:15:29,762 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:15:29,762 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:15:29,762 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:15:29,764 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:15:29,764 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:15:29,766 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:15:29,767 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 21:15:29,767 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:15:29,767 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:15:29,768 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:15:29,768 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:15:29,768 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:15:29,768 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:15:29,769 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:15:29,770 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:15:29,770 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 21:15:29,771 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:15:29,771 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:15:29,771 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:15:29,771 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:15:29,771 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:15:29,772 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:15:29,772 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:15:29,773 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:15:29,773 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 21:15:29,774 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:15:29,774 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:15:29,774 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:15:29,775 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:15:29,775 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:15:29,775 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:15:29,775 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:15:29,776 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:15:29,776 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 21:15:29,777 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:15:29,777 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:15:29,777 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:15:29,778 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:15:29,778 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:15:29,778 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:15:29,778 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:15:29,779 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:15:29,779 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 21:15:29,780 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:15:29,780 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:15:29,780 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:15:29,781 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:15:29,781 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:15:29,781 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:15:29,782 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:15:29,782 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:15:29,783 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 21:15:29,783 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:15:29,783 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:15:29,784 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:15:29,784 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:15:29,784 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:15:29,785 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:15:29,785 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:15:29,785 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:15:29,786 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 21:15:29,786 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:15:29,787 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:15:29,787 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:15:29,787 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:15:29,787 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:15:29,788 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:15:29,788 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:15:29,789 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:15:29,789 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 21:15:29,790 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:15:29,790 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:15:29,791 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:15:29,791 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:15:29,793 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:15:29,793 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:15:29,795 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:15:29,796 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 21:15:29,796 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:15:29,797 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:15:29,797 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:15:29,797 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:15:29,797 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:15:29,798 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:15:29,798 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:15:29,799 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:15:29,799 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 21:15:29,800 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:15:29,800 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:15:29,800 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:15:29,800 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:15:29,800 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:15:29,801 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:15:29,801 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:15:29,802 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:15:29,802 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 21:15:29,803 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:15:29,803 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:15:29,803 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:15:29,803 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:15:29,804 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:15:29,804 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:15:29,804 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:15:29,805 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:15:29,805 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 21:15:29,806 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:15:29,806 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:15:29,806 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:15:29,806 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:15:29,807 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:15:29,807 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:15:29,807 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:15:29,808 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:15:29,809 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 21:15:29,809 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:15:29,809 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:15:29,810 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:15:29,810 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:15:29,811 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:15:29,812 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:15:29,815 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:15:29,815 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 21:15:29,816 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:15:29,816 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:15:29,816 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:15:29,816 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:15:29,819 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:15:29,819 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:15:29,836 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:15:29,836 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 21:15:29,837 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:15:29,838 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:15:29,838 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:15:29,838 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:15:29,839 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:15:29,840 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:15:29,848 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:15:29,856 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 21:15:29,860 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 21:15:29,862 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:15:29,864 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 21:15:29,865 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:15:29,866 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(f_#in~v) = 2*f_#in~v + 1 Supporting invariants [] [2019-11-15 21:15:29,871 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-11-15 21:15:29,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:29,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:29,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:15:29,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:15:29,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:29,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-15 21:15:29,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:15:30,043 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-15 21:15:30,046 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-11-15 21:15:30,047 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 23 transitions. cyclomatic complexity: 5 Second operand 5 states. [2019-11-15 21:15:30,148 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 23 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 63 states and 72 transitions. Complement of second has 15 states. [2019-11-15 21:15:30,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 21:15:30,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 21:15:30,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2019-11-15 21:15:30,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 5 letters. Loop has 20 letters. [2019-11-15 21:15:30,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:15:30,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 25 letters. Loop has 20 letters. [2019-11-15 21:15:30,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:15:30,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 5 letters. Loop has 40 letters. [2019-11-15 21:15:30,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:15:30,162 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 72 transitions. [2019-11-15 21:15:30,168 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 21:15:30,174 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 40 states and 47 transitions. [2019-11-15 21:15:30,174 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-15 21:15:30,175 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-11-15 21:15:30,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 47 transitions. [2019-11-15 21:15:30,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:15:30,175 INFO L688 BuchiCegarLoop]: Abstraction has 40 states and 47 transitions. [2019-11-15 21:15:30,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 47 transitions. [2019-11-15 21:15:30,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 29. [2019-11-15 21:15:30,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-15 21:15:30,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2019-11-15 21:15:30,180 INFO L711 BuchiCegarLoop]: Abstraction has 29 states and 34 transitions. [2019-11-15 21:15:30,180 INFO L591 BuchiCegarLoop]: Abstraction has 29 states and 34 transitions. [2019-11-15 21:15:30,180 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 21:15:30,180 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 34 transitions. [2019-11-15 21:15:30,181 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 21:15:30,181 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:15:30,181 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:15:30,182 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:15:30,182 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 21:15:30,183 INFO L791 eck$LassoCheckResult]: Stem: 397#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 395#L-1 havoc main_#res;havoc main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~short17, main_#t~mem18, main_#t~ret19.base, main_#t~ret19.offset, main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnHeap(4);main_~p1~0.base, main_~p1~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnHeap(4);main_~p2~0.base, main_~p2~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(main_#t~nondet13, main_~p1~0.base, main_~p1~0.offset, 4);havoc main_#t~nondet13;call write~int(main_#t~nondet14, main_~p2~0.base, main_~p2~0.offset, 4);havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~p1~0.base, main_~p1~0.offset, 4);main_#t~short17 := main_#t~mem15 < 0; 396#L63 assume !main_#t~short17;call main_#t~mem16 := read~int(main_~p2~0.base, main_~p2~0.offset, 4);main_#t~short17 := main_#t~mem16 < 0; 388#L63-2 assume !main_#t~short17;havoc main_#t~short17;havoc main_#t~mem15;havoc main_#t~mem16;call main_#t~mem18 := read~int(main_~p2~0.base, main_~p2~0.offset, 4); 389#L66 call main_#t~ret19.base, main_#t~ret19.offset := f(main_~p1~0.base, main_~p1~0.offset, main_#t~mem18);< 398#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 391#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 378#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 385#gENTRY [2019-11-15 21:15:30,183 INFO L793 eck$LassoCheckResult]: Loop: 385#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 377#L34 assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~mem7;havoc #t~post8; 379#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 385#gENTRY [2019-11-15 21:15:30,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:30,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1845692449, now seen corresponding path program 1 times [2019-11-15 21:15:30,183 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:15:30,184 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510121679] [2019-11-15 21:15:30,184 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:30,184 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:30,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:15:30,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:15:30,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:15:30,209 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:15:30,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:30,210 INFO L82 PathProgramCache]: Analyzing trace with hash 38883, now seen corresponding path program 1 times [2019-11-15 21:15:30,210 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:15:30,210 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431058581] [2019-11-15 21:15:30,210 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:30,211 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:30,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:15:30,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:15:30,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:15:30,223 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:15:30,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:30,223 INFO L82 PathProgramCache]: Analyzing trace with hash -852415675, now seen corresponding path program 1 times [2019-11-15 21:15:30,224 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:15:30,224 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718107764] [2019-11-15 21:15:30,224 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:30,224 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:30,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:15:30,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:15:30,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:15:30,251 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:15:30,778 WARN L191 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 90 [2019-11-15 21:15:31,203 WARN L191 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 104 [2019-11-15 21:15:31,281 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:15:31,281 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:15:31,281 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:15:31,281 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:15:31,281 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:15:31,281 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:15:31,282 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:15:31,282 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:15:31,282 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex5.i_Iteration4_Lasso [2019-11-15 21:15:31,282 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:15:31,282 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:15:31,286 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 21:15:31,294 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 21:15:31,295 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 21:15:31,297 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 21:15:31,299 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 21:15:31,301 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 21:15:31,303 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 21:15:31,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 21:15:31,305 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 21:15:31,309 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 21:15:31,312 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 21:15:31,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:15:31,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:15:31,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:15:31,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:15:31,494 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 21:15:31,496 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 21:15:31,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:15:31,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:15:31,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:15:31,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:15:31,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:15:31,512 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 21:15:31,514 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 21:15:31,516 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 21:15:31,525 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 21:15:31,527 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 21:15:31,529 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 21:15:31,531 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 21:15:31,534 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 21:15:31,535 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 21:15:31,537 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 21:15:31,539 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 21:15:31,541 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 21:15:31,542 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 21:15:31,544 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 21:15:31,546 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 21:15:31,548 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 21:15:31,549 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 21:15:31,551 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 21:15:31,553 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 21:15:31,555 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 21:15:31,556 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 21:15:31,558 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 21:15:31,560 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 21:15:31,562 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 21:15:31,563 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 21:15:31,567 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 21:15:31,569 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 21:15:31,571 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 21:15:31,573 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 21:15:31,575 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 21:15:31,576 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 21:15:31,578 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 21:15:31,580 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 21:15:31,582 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 21:15:31,917 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 29 [2019-11-15 21:15:31,978 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:15:31,978 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:15:31,979 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 21:15:31,979 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:15:31,980 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:15:31,980 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:15:31,980 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:15:31,980 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:15:31,981 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:15:31,981 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:15:31,981 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:15:31,982 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 21:15:31,982 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:15:31,982 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:15:31,983 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:15:31,983 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:15:31,983 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:15:31,983 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:15:31,983 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:15:31,984 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:15:31,984 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 21:15:31,985 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:15:31,985 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:15:31,985 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:15:31,985 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:15:31,985 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:15:31,986 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:15:31,986 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:15:31,986 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:15:31,987 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 21:15:31,987 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:15:31,988 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:15:31,988 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:15:31,988 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:15:31,988 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:15:31,988 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:15:31,988 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:15:31,989 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:15:31,989 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 21:15:31,990 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:15:31,990 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:15:31,990 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:15:31,990 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:15:31,990 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:15:31,991 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:15:31,991 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:15:31,991 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:15:31,992 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 21:15:31,992 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:15:31,992 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:15:31,993 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:15:31,993 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:15:31,993 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:15:31,993 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:15:31,993 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:15:31,994 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:15:31,994 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 21:15:31,995 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:15:31,995 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:15:31,995 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:15:31,995 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:15:31,995 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:15:31,996 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:15:31,996 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:15:31,996 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:15:31,997 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 21:15:31,997 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:15:31,997 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:15:31,998 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:15:31,998 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:15:31,998 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:15:31,998 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:15:31,998 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:15:31,999 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:15:31,999 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 21:15:32,000 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:15:32,000 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:15:32,000 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:15:32,000 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:15:32,000 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:15:32,001 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:15:32,001 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:15:32,002 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:15:32,002 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 21:15:32,002 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:15:32,003 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:15:32,003 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:15:32,003 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:15:32,004 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:15:32,004 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:15:32,006 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:15:32,006 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 21:15:32,007 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:15:32,007 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:15:32,007 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:15:32,007 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:15:32,008 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:15:32,008 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:15:32,012 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:15:32,012 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 21:15:32,013 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:15:32,013 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:15:32,013 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:15:32,013 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:15:32,015 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:15:32,015 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:15:32,029 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:15:32,033 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 21:15:32,034 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 21:15:32,034 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:15:32,035 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 21:15:32,035 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:15:32,035 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int g_#in~p.base) g_#in~p.offset)_1) = 2*v_rep(select (select #memory_int g_#in~p.base) g_#in~p.offset)_1 + 1 Supporting invariants [] [2019-11-15 21:15:32,042 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-11-15 21:15:32,044 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 21:15:32,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:32,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:32,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 21:15:32,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:15:32,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:32,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-15 21:15:32,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:15:32,118 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2019-11-15 21:15:32,119 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:15:32,123 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:15:32,123 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:15:32,124 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2019-11-15 21:15:32,135 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 21:15:32,135 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 21:15:32,135 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 34 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-11-15 21:15:32,194 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 34 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 57 states and 66 transitions. Complement of second has 15 states. [2019-11-15 21:15:32,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 21:15:32,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 21:15:32,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2019-11-15 21:15:32,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 8 letters. Loop has 3 letters. [2019-11-15 21:15:32,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:15:32,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 11 letters. Loop has 3 letters. [2019-11-15 21:15:32,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:15:32,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 8 letters. Loop has 6 letters. [2019-11-15 21:15:32,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:15:32,197 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 66 transitions. [2019-11-15 21:15:32,201 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 21:15:32,203 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 40 states and 48 transitions. [2019-11-15 21:15:32,203 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-15 21:15:32,203 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-15 21:15:32,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 48 transitions. [2019-11-15 21:15:32,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:15:32,204 INFO L688 BuchiCegarLoop]: Abstraction has 40 states and 48 transitions. [2019-11-15 21:15:32,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 48 transitions. [2019-11-15 21:15:32,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-11-15 21:15:32,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-15 21:15:32,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2019-11-15 21:15:32,208 INFO L711 BuchiCegarLoop]: Abstraction has 40 states and 48 transitions. [2019-11-15 21:15:32,209 INFO L591 BuchiCegarLoop]: Abstraction has 40 states and 48 transitions. [2019-11-15 21:15:32,209 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 21:15:32,209 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 48 transitions. [2019-11-15 21:15:32,210 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 21:15:32,210 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:15:32,210 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:15:32,211 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:15:32,211 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 21:15:32,212 INFO L791 eck$LassoCheckResult]: Stem: 559#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 557#L-1 havoc main_#res;havoc main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~short17, main_#t~mem18, main_#t~ret19.base, main_#t~ret19.offset, main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnHeap(4);main_~p1~0.base, main_~p1~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnHeap(4);main_~p2~0.base, main_~p2~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(main_#t~nondet13, main_~p1~0.base, main_~p1~0.offset, 4);havoc main_#t~nondet13;call write~int(main_#t~nondet14, main_~p2~0.base, main_~p2~0.offset, 4);havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~p1~0.base, main_~p1~0.offset, 4);main_#t~short17 := main_#t~mem15 < 0; 558#L63 assume !main_#t~short17;call main_#t~mem16 := read~int(main_~p2~0.base, main_~p2~0.offset, 4);main_#t~short17 := main_#t~mem16 < 0; 551#L63-2 assume !main_#t~short17;havoc main_#t~short17;havoc main_#t~mem15;havoc main_#t~mem16;call main_#t~mem18 := read~int(main_~p2~0.base, main_~p2~0.offset, 4); 552#L66 call main_#t~ret19.base, main_#t~ret19.offset := f(main_~p1~0.base, main_~p1~0.offset, main_#t~mem18);< 561#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 556#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 540#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 560#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 539#L34 assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~mem7;havoc #t~post8; 541#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 573#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 570#L34 assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~mem7;havoc #t~post8; 543#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 573#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 569#L34 assume #t~mem5 < 0;havoc #t~mem5;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc6.base, #t~malloc6.offset; 542#gFINAL assume true; 544#gEXIT >#41#return; 550#L42-1 ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset; 553#gFINAL assume true; 568#gEXIT >#41#return; 567#L42-1 ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset; 566#gFINAL assume true; 564#gEXIT >#37#return; 555#L25-1 call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1);< 562#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 554#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 538#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 545#gENTRY [2019-11-15 21:15:32,212 INFO L793 eck$LassoCheckResult]: Loop: 545#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 536#L34 assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~mem7;havoc #t~post8; 537#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 545#gENTRY [2019-11-15 21:15:32,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:32,212 INFO L82 PathProgramCache]: Analyzing trace with hash -853827823, now seen corresponding path program 2 times [2019-11-15 21:15:32,212 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:15:32,213 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736991704] [2019-11-15 21:15:32,213 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:32,213 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:32,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:15:32,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:32,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:32,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:32,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:32,465 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-15 21:15:32,467 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736991704] [2019-11-15 21:15:32,467 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569942459] [2019-11-15 21:15:32,467 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b9ddc4ba-0d7e-4fa0-b0d9-6eb4be799168/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:15:32,597 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 21:15:32,598 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:15:32,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 38 conjunts are in the unsatisfiable core [2019-11-15 21:15:32,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:15:32,610 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 21:15:32,611 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:15:32,614 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:15:32,614 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:15:32,614 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-15 21:15:32,750 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-11-15 21:15:32,750 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:15:32,752 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:15:32,752 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:15:32,753 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:3 [2019-11-15 21:15:32,757 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-15 21:15:32,757 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:15:32,758 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 19 [2019-11-15 21:15:32,758 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734330270] [2019-11-15 21:15:32,758 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 21:15:32,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:32,759 INFO L82 PathProgramCache]: Analyzing trace with hash 38883, now seen corresponding path program 2 times [2019-11-15 21:15:32,763 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:15:32,764 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893786975] [2019-11-15 21:15:32,764 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:32,764 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:32,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:15:32,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:15:32,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:15:32,777 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:15:32,931 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:15:32,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-15 21:15:32,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-11-15 21:15:32,932 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. cyclomatic complexity: 12 Second operand 19 states. [2019-11-15 21:15:33,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:15:33,162 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2019-11-15 21:15:33,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 21:15:33,163 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 67 transitions. [2019-11-15 21:15:33,165 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 21:15:33,166 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 46 states and 58 transitions. [2019-11-15 21:15:33,166 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-15 21:15:33,167 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-15 21:15:33,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 58 transitions. [2019-11-15 21:15:33,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:15:33,167 INFO L688 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2019-11-15 21:15:33,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 58 transitions. [2019-11-15 21:15:33,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2019-11-15 21:15:33,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-15 21:15:33,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2019-11-15 21:15:33,173 INFO L711 BuchiCegarLoop]: Abstraction has 43 states and 52 transitions. [2019-11-15 21:15:33,173 INFO L591 BuchiCegarLoop]: Abstraction has 43 states and 52 transitions. [2019-11-15 21:15:33,173 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 21:15:33,173 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 52 transitions. [2019-11-15 21:15:33,174 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 21:15:33,174 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:15:33,174 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:15:33,175 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:15:33,175 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 21:15:33,176 INFO L791 eck$LassoCheckResult]: Stem: 795#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 793#L-1 havoc main_#res;havoc main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~short17, main_#t~mem18, main_#t~ret19.base, main_#t~ret19.offset, main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnHeap(4);main_~p1~0.base, main_~p1~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnHeap(4);main_~p2~0.base, main_~p2~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(main_#t~nondet13, main_~p1~0.base, main_~p1~0.offset, 4);havoc main_#t~nondet13;call write~int(main_#t~nondet14, main_~p2~0.base, main_~p2~0.offset, 4);havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~p1~0.base, main_~p1~0.offset, 4);main_#t~short17 := main_#t~mem15 < 0; 794#L63 assume !main_#t~short17;call main_#t~mem16 := read~int(main_~p2~0.base, main_~p2~0.offset, 4);main_#t~short17 := main_#t~mem16 < 0; 786#L63-2 assume !main_#t~short17;havoc main_#t~short17;havoc main_#t~mem15;havoc main_#t~mem16;call main_#t~mem18 := read~int(main_~p2~0.base, main_~p2~0.offset, 4); 787#L66 call main_#t~ret19.base, main_#t~ret19.offset := f(main_~p1~0.base, main_~p1~0.offset, main_#t~mem18);< 799#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 800#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 797#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 796#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 798#L34 assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~mem7;havoc #t~post8; 777#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 784#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 810#L34 assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~mem7;havoc #t~post8; 776#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 784#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 810#L34 assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~mem7;havoc #t~post8; 776#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 784#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 775#L34 assume #t~mem5 < 0;havoc #t~mem5;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc6.base, #t~malloc6.offset; 778#gFINAL assume true; 813#gEXIT >#41#return; 788#L42-1 ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset; 779#gFINAL assume true; 782#gEXIT >#41#return; 785#L42-1 ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset; 812#gFINAL assume true; 805#gEXIT >#41#return; 804#L42-1 ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset; 803#gFINAL assume true; 802#gEXIT >#37#return; 790#L25-1 call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1);< 801#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 789#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 773#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 783#gENTRY [2019-11-15 21:15:33,176 INFO L793 eck$LassoCheckResult]: Loop: 783#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 772#L34 assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~mem7;havoc #t~post8; 774#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 783#gENTRY [2019-11-15 21:15:33,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:33,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1079381827, now seen corresponding path program 3 times [2019-11-15 21:15:33,176 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:15:33,176 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111047688] [2019-11-15 21:15:33,177 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:33,177 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:33,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:15:33,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:15:33,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:15:33,238 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:15:33,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:33,239 INFO L82 PathProgramCache]: Analyzing trace with hash 38883, now seen corresponding path program 3 times [2019-11-15 21:15:33,239 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:15:33,239 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230825489] [2019-11-15 21:15:33,239 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:33,239 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:33,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:15:33,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:15:33,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:15:33,246 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:15:33,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:33,246 INFO L82 PathProgramCache]: Analyzing trace with hash 556146087, now seen corresponding path program 4 times [2019-11-15 21:15:33,246 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:15:33,247 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560733576] [2019-11-15 21:15:33,247 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:33,247 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:33,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:15:33,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:15:33,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:15:33,305 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:15:33,877 WARN L191 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 97 [2019-11-15 21:15:34,072 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-11-15 21:15:34,483 WARN L191 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 111 [2019-11-15 21:15:35,090 WARN L191 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 120 [2019-11-15 21:15:35,287 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-11-15 21:15:35,453 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-11-15 21:15:36,174 WARN L191 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 134 [2019-11-15 21:15:36,317 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-11-15 21:15:36,833 WARN L191 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 124 [2019-11-15 21:15:36,996 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-11-15 21:15:37,234 WARN L191 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 90 [2019-11-15 21:15:37,452 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-11-15 21:15:37,602 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-11-15 21:15:38,494 WARN L191 SmtUtils]: Spent 889.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 153 [2019-11-15 21:15:38,778 WARN L191 SmtUtils]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2019-11-15 21:15:38,782 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:15:38,782 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:15:38,782 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:15:38,783 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:15:38,783 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:15:38,783 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:15:38,783 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:15:38,783 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:15:38,783 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex5.i_Iteration6_Lasso [2019-11-15 21:15:38,783 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:15:38,783 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:15:38,787 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 21:15:38,790 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 21:15:38,791 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 21:15:38,793 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 21:15:38,794 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 21:15:38,795 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 21:15:39,105 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-11-15 21:15:39,179 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 21:15:39,180 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 21:15:39,182 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 21:15:39,183 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 21:15:39,184 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 21:15:39,186 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 21:15:39,187 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 21:15:39,188 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 21:15:39,190 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 21:15:39,191 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 21:15:39,192 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 21:15:39,194 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 21:15:39,195 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 21:15:39,196 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 21:15:39,198 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 21:15:39,199 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 21:15:39,200 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 21:15:39,202 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 21:15:39,203 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 21:15:39,205 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 21:15:39,206 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 21:15:39,208 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 21:15:39,209 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 21:15:39,210 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 21:15:39,212 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 21:15:39,213 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 21:15:39,214 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 21:15:39,221 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 21:15:39,226 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 21:15:39,228 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 21:15:39,229 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 21:15:39,230 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 21:15:39,232 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 21:15:39,233 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 21:15:39,234 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 21:15:39,236 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 21:15:39,237 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 21:15:39,239 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 21:15:39,240 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 21:15:39,242 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 21:15:39,243 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 21:15:39,244 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 21:15:39,246 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 21:15:39,249 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 21:15:39,254 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 21:15:39,255 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 21:15:39,256 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 21:15:39,258 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 21:15:39,259 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 21:15:39,260 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 21:15:39,449 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-15 21:16:00,654 WARN L191 SmtUtils]: Spent 21.07 s on a formula simplification. DAG size of input: 307 DAG size of output: 307 [2019-11-15 21:16:00,727 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:16:00,730 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:16:00,730 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 21:16:00,731 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:16:00,731 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:16:00,731 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:16:00,731 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:16:00,731 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:16:00,732 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:16:00,732 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:16:00,732 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:16:00,733 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 21:16:00,735 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:16:00,735 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:16:00,735 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:16:00,736 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:16:00,736 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:16:00,736 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:16:00,736 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:16:00,736 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:16:00,737 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 21:16:00,737 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:16:00,737 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:16:00,738 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:16:00,738 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:16:00,738 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:16:00,738 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:16:00,738 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:16:00,739 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:16:00,747 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 21:16:00,748 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:16:00,748 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:16:00,748 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:16:00,748 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:16:00,749 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:16:00,749 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:16:00,749 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:16:00,749 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:16:00,750 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 21:16:00,750 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:16:00,750 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:16:00,751 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:16:00,751 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:16:00,751 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:16:00,751 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:16:00,754 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:16:00,754 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:16:00,754 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 21:16:00,755 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:16:00,755 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:16:00,755 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:16:00,755 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:16:00,756 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:16:00,761 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:16:00,763 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:16:00,764 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 21:16:00,764 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:16:00,764 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:16:00,765 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:16:00,765 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:16:00,767 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:16:00,767 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:16:00,783 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:16:00,789 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 21:16:00,791 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 21:16:00,791 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:16:00,792 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 21:16:00,792 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:16:00,793 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int g_#in~p.base) g_#in~p.offset)_2) = 2*v_rep(select (select #memory_int g_#in~p.base) g_#in~p.offset)_2 + 1 Supporting invariants [] [2019-11-15 21:16:00,827 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2019-11-15 21:16:00,828 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 21:16:00,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:00,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:00,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-15 21:16:00,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:16:00,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:16:00,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:16:00,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:16:00,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:00,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-15 21:16:00,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:16:01,008 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2019-11-15 21:16:01,009 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:16:01,014 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:16:01,014 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:16:01,014 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2019-11-15 21:16:01,032 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 21:16:01,032 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-11-15 21:16:01,032 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 52 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-11-15 21:16:01,132 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 52 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 50 states and 59 transitions. Complement of second has 15 states. [2019-11-15 21:16:01,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 21:16:01,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 21:16:01,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2019-11-15 21:16:01,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 34 letters. Loop has 3 letters. [2019-11-15 21:16:01,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:16:01,136 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 21:16:01,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:01,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:01,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-15 21:16:01,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:16:01,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:16:01,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:16:01,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:16:01,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:01,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-15 21:16:01,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:16:01,303 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2019-11-15 21:16:01,304 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:16:01,309 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:16:01,309 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:16:01,309 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2019-11-15 21:16:01,327 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 21:16:01,327 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2019-11-15 21:16:01,327 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 52 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-11-15 21:16:01,406 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 52 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 50 states and 59 transitions. Complement of second has 15 states. [2019-11-15 21:16:01,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 21:16:01,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 21:16:01,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2019-11-15 21:16:01,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 34 letters. Loop has 3 letters. [2019-11-15 21:16:01,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:16:01,411 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 21:16:01,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:01,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:01,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-15 21:16:01,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:16:01,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:16:01,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:16:01,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:16:01,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:01,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-15 21:16:01,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:16:01,582 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2019-11-15 21:16:01,583 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:16:01,588 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:16:01,588 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:16:01,588 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2019-11-15 21:16:01,598 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 21:16:01,599 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-11-15 21:16:01,599 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 52 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-11-15 21:16:01,695 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 52 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 64 states and 73 transitions. Complement of second has 15 states. [2019-11-15 21:16:01,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 21:16:01,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 21:16:01,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2019-11-15 21:16:01,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 34 letters. Loop has 3 letters. [2019-11-15 21:16:01,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:16:01,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 37 letters. Loop has 3 letters. [2019-11-15 21:16:01,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:16:01,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 34 letters. Loop has 6 letters. [2019-11-15 21:16:01,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:16:01,697 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 73 transitions. [2019-11-15 21:16:01,699 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 21:16:01,699 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 0 states and 0 transitions. [2019-11-15 21:16:01,699 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 21:16:01,699 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 21:16:01,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 21:16:01,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:16:01,699 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:16:01,700 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:16:01,700 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:16:01,700 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 21:16:01,700 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 21:16:01,700 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 21:16:01,700 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 21:16:01,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 09:16:01 BoogieIcfgContainer [2019-11-15 21:16:01,706 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 21:16:01,706 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:16:01,706 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:16:01,706 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:16:01,707 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:15:24" (3/4) ... [2019-11-15 21:16:01,710 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 21:16:01,710 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:16:01,711 INFO L168 Benchmark]: Toolchain (without parser) took 38373.07 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 551.6 MB). Free memory was 951.4 MB in the beginning and 1.4 GB in the end (delta: -441.1 MB). Peak memory consumption was 110.5 MB. Max. memory is 11.5 GB. [2019-11-15 21:16:01,711 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:16:01,712 INFO L168 Benchmark]: CACSL2BoogieTranslator took 324.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -182.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-11-15 21:16:01,712 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.73 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 21:16:01,713 INFO L168 Benchmark]: Boogie Preprocessor took 18.60 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 21:16:01,713 INFO L168 Benchmark]: RCFGBuilder took 292.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-15 21:16:01,714 INFO L168 Benchmark]: BuchiAutomizer took 37693.58 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 412.6 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -282.5 MB). Peak memory consumption was 130.1 MB. Max. memory is 11.5 GB. [2019-11-15 21:16:01,714 INFO L168 Benchmark]: Witness Printer took 3.86 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:16:01,717 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 324.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -182.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.73 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 18.60 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 292.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 37693.58 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 412.6 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -282.5 MB). Peak memory consumption was 130.1 MB. Max. memory is 11.5 GB. * Witness Printer took 3.86 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function 2 * \old(v) + 1 and consists of 5 locations. One deterministic module has affine ranking function 2 * unknown-#memory_int-unknown[p][p] + 1 and consists of 5 locations. One nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[p][p] + 1 and consists of 6 locations. 3 modules have a trivial ranking function, the largest among these consists of 19 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 37.6s and 7 iterations. TraceHistogramMax:4. Analysis of lassos took 35.4s. Construction of modules took 0.4s. Büchi inclusion checks took 1.5s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 14 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 43 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 14/14 HoareTripleCheckerStatistics: 115 SDtfs, 87 SDslu, 248 SDs, 0 SdLazy, 344 SolverSat, 65 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital356 mio100 ax100 hnf100 lsp97 ukn38 mio100 lsp34 div100 bol100 ite100 ukn100 eq166 hnf96 smp100 dnf5460 smp82 tf100 neg83 sie162 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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...