./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11C.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_fcb3849a-f819-4026-b2ba-d72ff78b1a39/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_fcb3849a-f819-4026-b2ba-d72ff78b1a39/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_fcb3849a-f819-4026-b2ba-d72ff78b1a39/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_fcb3849a-f819-4026-b2ba-d72ff78b1a39/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11C.i -s /tmp/vcloud-vcloud-master/worker/run_dir_fcb3849a-f819-4026-b2ba-d72ff78b1a39/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_fcb3849a-f819-4026-b2ba-d72ff78b1a39/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 faaae9aa069653e753b732f00a89bd7a139fa132 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 20:40:21,703 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:40:21,705 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:40:21,719 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:40:21,720 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:40:21,721 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:40:21,723 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:40:21,732 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:40:21,736 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:40:21,741 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:40:21,742 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:40:21,744 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:40:21,744 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:40:21,746 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:40:21,747 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:40:21,748 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:40:21,749 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:40:21,749 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:40:21,752 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:40:21,755 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:40:21,759 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:40:21,760 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:40:21,763 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:40:21,764 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:40:21,767 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:40:21,768 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:40:21,768 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:40:21,769 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:40:21,770 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:40:21,771 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:40:21,771 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:40:21,771 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:40:21,772 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:40:21,773 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:40:21,774 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:40:21,774 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:40:21,775 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:40:21,775 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:40:21,775 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:40:21,776 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:40:21,777 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:40:21,778 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_fcb3849a-f819-4026-b2ba-d72ff78b1a39/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 20:40:21,805 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:40:21,815 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:40:21,816 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:40:21,817 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:40:21,817 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:40:21,817 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 20:40:21,817 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 20:40:21,818 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 20:40:21,818 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 20:40:21,818 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 20:40:21,818 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 20:40:21,819 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:40:21,819 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 20:40:21,819 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:40:21,819 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:40:21,820 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 20:40:21,820 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 20:40:21,821 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 20:40:21,821 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:40:21,822 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 20:40:21,822 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:40:21,822 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 20:40:21,822 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:40:21,823 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:40:21,823 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 20:40:21,823 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:40:21,824 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:40:21,824 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 20:40:21,825 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 20:40:21,827 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_fcb3849a-f819-4026-b2ba-d72ff78b1a39/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 -> faaae9aa069653e753b732f00a89bd7a139fa132 [2019-11-15 20:40:21,859 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:40:21,871 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:40:21,875 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:40:21,876 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:40:21,878 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:40:21,879 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_fcb3849a-f819-4026-b2ba-d72ff78b1a39/bin/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11C.i [2019-11-15 20:40:21,938 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fcb3849a-f819-4026-b2ba-d72ff78b1a39/bin/uautomizer/data/f4a1d2419/5fb80fa722044e7cbb12306a1dee7753/FLAGc04cf090b [2019-11-15 20:40:22,338 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:40:22,338 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_fcb3849a-f819-4026-b2ba-d72ff78b1a39/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11C.i [2019-11-15 20:40:22,343 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fcb3849a-f819-4026-b2ba-d72ff78b1a39/bin/uautomizer/data/f4a1d2419/5fb80fa722044e7cbb12306a1dee7753/FLAGc04cf090b [2019-11-15 20:40:22,756 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_fcb3849a-f819-4026-b2ba-d72ff78b1a39/bin/uautomizer/data/f4a1d2419/5fb80fa722044e7cbb12306a1dee7753 [2019-11-15 20:40:22,759 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:40:22,760 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:40:22,761 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:40:22,761 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:40:22,764 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:40:22,765 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:40:22" (1/1) ... [2019-11-15 20:40:22,767 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@659f7804 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:40:22, skipping insertion in model container [2019-11-15 20:40:22,768 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:40:22" (1/1) ... [2019-11-15 20:40:22,774 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:40:22,789 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:40:22,971 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:40:22,981 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:40:22,996 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:40:23,009 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:40:23,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:40:23 WrapperNode [2019-11-15 20:40:23,010 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:40:23,010 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:40:23,011 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:40:23,011 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:40:23,018 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:40:23" (1/1) ... [2019-11-15 20:40:23,025 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:40:23" (1/1) ... [2019-11-15 20:40:23,043 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:40:23,043 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:40:23,043 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:40:23,043 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:40:23,052 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:40:23" (1/1) ... [2019-11-15 20:40:23,052 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:40:23" (1/1) ... [2019-11-15 20:40:23,054 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:40:23" (1/1) ... [2019-11-15 20:40:23,054 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:40:23" (1/1) ... [2019-11-15 20:40:23,058 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:40:23" (1/1) ... [2019-11-15 20:40:23,062 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:40:23" (1/1) ... [2019-11-15 20:40:23,063 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:40:23" (1/1) ... [2019-11-15 20:40:23,065 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:40:23,066 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:40:23,066 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:40:23,066 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:40:23,067 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:40:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fcb3849a-f819-4026-b2ba-d72ff78b1a39/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 20:40:23,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 20:40:23,129 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2019-11-15 20:40:23,130 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2019-11-15 20:40:23,131 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 20:40:23,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:40:23,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:40:23,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 20:40:23,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 20:40:23,427 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:40:23,427 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-15 20:40:23,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:40:23 BoogieIcfgContainer [2019-11-15 20:40:23,428 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:40:23,429 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 20:40:23,429 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 20:40:23,432 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 20:40:23,432 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:40:23,436 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 08:40:22" (1/3) ... [2019-11-15 20:40:23,438 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3b82e766 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 08:40:23, skipping insertion in model container [2019-11-15 20:40:23,438 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:40:23,438 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:40:23" (2/3) ... [2019-11-15 20:40:23,439 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3b82e766 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 08:40:23, skipping insertion in model container [2019-11-15 20:40:23,439 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:40:23,439 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:40:23" (3/3) ... [2019-11-15 20:40:23,442 INFO L371 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex11C.i [2019-11-15 20:40:23,498 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 20:40:23,498 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 20:40:23,498 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 20:40:23,498 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:40:23,499 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:40:23,499 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 20:40:23,499 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:40:23,499 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 20:40:23,515 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-11-15 20:40:23,542 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-15 20:40:23,542 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:40:23,542 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:40:23,550 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 20:40:23,550 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:40:23,550 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 20:40:23,550 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-11-15 20:40:23,553 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-15 20:40:23,553 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:40:23,553 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:40:23,554 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 20:40:23,554 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:40:23,561 INFO L791 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 7#L31-3true [2019-11-15 20:40:23,562 INFO L793 eck$LassoCheckResult]: Loop: 7#L31-3true call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 10#L31-1true assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 18#L35true assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 8#L39true call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 3#recENTRYtrue ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 12#L9true assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 17#recFINALtrue assume true; 15#recEXITtrue >#44#return; 6#L39-1true assume -1 == main_#t~ret12;main_#t~ite13 := -1; 20#L39-3true call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem14;havoc main_#t~ite13;havoc main_#t~ret12; 7#L31-3true [2019-11-15 20:40:23,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:40:23,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 1 times [2019-11-15 20:40:23,577 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:40:23,577 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95884919] [2019-11-15 20:40:23,578 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:23,578 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:23,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:40:23,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:40:23,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:40:23,690 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:40:23,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:40:23,691 INFO L82 PathProgramCache]: Analyzing trace with hash -2107477180, now seen corresponding path program 1 times [2019-11-15 20:40:23,691 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:40:23,691 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785520102] [2019-11-15 20:40:23,691 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:23,692 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:23,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:40:23,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:40:23,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:40:23,886 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 20:40:23,886 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785520102] [2019-11-15 20:40:23,887 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:40:23,887 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 20:40:23,887 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939772744] [2019-11-15 20:40:23,891 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 20:40:23,892 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:40:23,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:40:23,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:40:23,905 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 7 states. [2019-11-15 20:40:24,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:40:24,082 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2019-11-15 20:40:24,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:40:24,085 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2019-11-15 20:40:24,087 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-15 20:40:24,100 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 16 states and 19 transitions. [2019-11-15 20:40:24,103 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-15 20:40:24,103 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-11-15 20:40:24,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2019-11-15 20:40:24,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:40:24,106 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-11-15 20:40:24,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2019-11-15 20:40:24,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-11-15 20:40:24,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-15 20:40:24,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2019-11-15 20:40:24,140 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-11-15 20:40:24,141 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-11-15 20:40:24,141 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 20:40:24,141 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2019-11-15 20:40:24,145 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-15 20:40:24,146 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:40:24,146 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:40:24,147 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 20:40:24,147 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:40:24,148 INFO L791 eck$LassoCheckResult]: Stem: 70#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 68#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 63#L31-3 [2019-11-15 20:40:24,148 INFO L793 eck$LassoCheckResult]: Loop: 63#L31-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 64#L31-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 67#L35 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 59#L39 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 57#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 60#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 58#L18 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 57#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 60#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 69#recFINAL assume true; 71#recEXIT >#42#return; 65#L18-1 ~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~res~0; 66#recFINAL assume true; 72#recEXIT >#44#return; 61#L39-1 assume -1 == main_#t~ret12;main_#t~ite13 := -1; 62#L39-3 call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem14;havoc main_#t~ite13;havoc main_#t~ret12; 63#L31-3 [2019-11-15 20:40:24,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:40:24,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 2 times [2019-11-15 20:40:24,149 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:40:24,149 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52415024] [2019-11-15 20:40:24,150 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:24,150 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:24,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:40:24,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:40:24,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:40:24,194 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:40:24,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:40:24,196 INFO L82 PathProgramCache]: Analyzing trace with hash 290320444, now seen corresponding path program 1 times [2019-11-15 20:40:24,197 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:40:24,197 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226042214] [2019-11-15 20:40:24,198 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:24,199 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:24,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:40:24,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:40:24,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:40:24,333 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:40:24,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:40:24,333 INFO L82 PathProgramCache]: Analyzing trace with hash -645910274, now seen corresponding path program 1 times [2019-11-15 20:40:24,333 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:40:24,334 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406213593] [2019-11-15 20:40:24,334 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:24,334 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:24,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:40:24,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:40:24,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:40:24,424 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:40:25,018 WARN L191 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 91 [2019-11-15 20:40:25,228 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-11-15 20:40:25,336 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-11-15 20:40:25,941 WARN L191 SmtUtils]: Spent 600.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 122 [2019-11-15 20:40:26,149 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:40:26,150 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:40:26,150 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:40:26,150 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:40:26,150 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:40:26,150 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:40:26,151 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:40:26,151 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:40:26,151 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11C.i_Iteration2_Lasso [2019-11-15 20:40:26,151 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:40:26,151 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:40:26,170 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 20:40:26,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 20:40:26,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 20:40:26,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 20:40:26,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 20:40:26,574 WARN L191 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-11-15 20:40:26,574 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 20:40:26,577 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 20:40:26,586 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 20:40:26,589 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 20:40:26,592 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 20:40:26,987 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 26 [2019-11-15 20:40:27,054 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:40:27,059 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:40:27,061 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 20:40:27,062 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:40:27,062 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:40:27,063 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:40:27,063 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:40:27,063 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:40:27,064 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:40:27,064 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:40:27,066 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:40:27,067 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 20:40:27,067 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:40:27,068 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:40:27,068 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:40:27,068 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:40:27,068 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:40:27,069 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:40:27,069 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:40:27,070 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:40:27,070 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 20:40:27,071 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:40:27,071 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:40:27,071 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:40:27,071 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:40:27,071 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:40:27,072 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:40:27,072 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:40:27,073 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:40:27,073 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 20:40:27,074 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:40:27,074 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:40:27,074 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:40:27,074 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:40:27,077 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:40:27,077 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:40:27,079 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:40:27,080 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 20:40:27,081 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:40:27,081 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:40:27,081 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:40:27,081 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:40:27,085 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:40:27,085 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:40:27,108 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:40:27,109 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 20:40:27,110 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:40:27,110 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:40:27,110 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:40:27,110 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:40:27,110 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:40:27,111 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:40:27,111 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:40:27,112 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:40:27,112 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:40:27,113 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:40:27,113 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:40:27,113 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:40:27,113 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:40:27,115 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:40:27,116 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:40:27,134 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:40:27,143 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 20:40:27,143 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 20:40:27,145 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:40:27,147 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 20:40:27,147 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:40:27,148 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~qq~0.base) ULTIMATE.start_main_~qq~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~qq~0.base) ULTIMATE.start_main_~qq~0.offset)_1 Supporting invariants [] [2019-11-15 20:40:27,159 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-15 20:40:27,164 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:40:27,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:40:27,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:40:27,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:40:27,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:40:27,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:40:27,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-15 20:40:27,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:40:27,312 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:40:27,312 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 20:40:27,313 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:40:27,322 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:40:27,333 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-15 20:40:27,334 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:40:27,341 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:40:27,341 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:40:27,342 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:36, output treesize:15 [2019-11-15 20:40:27,362 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 22 treesize of output 10 [2019-11-15 20:40:27,363 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:40:27,373 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:40:27,374 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:40:27,374 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:7 [2019-11-15 20:40:27,439 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-15 20:40:27,442 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2019-11-15 20:40:27,443 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand 7 states. [2019-11-15 20:40:27,580 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5. Second operand 7 states. Result 62 states and 73 transitions. Complement of second has 17 states. [2019-11-15 20:40:27,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2019-11-15 20:40:27,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-15 20:40:27,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 17 transitions. [2019-11-15 20:40:27,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 2 letters. Loop has 16 letters. [2019-11-15 20:40:27,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:40:27,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 18 letters. Loop has 16 letters. [2019-11-15 20:40:27,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:40:27,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 2 letters. Loop has 32 letters. [2019-11-15 20:40:27,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:40:27,594 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 73 transitions. [2019-11-15 20:40:27,597 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2019-11-15 20:40:27,604 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 56 states and 67 transitions. [2019-11-15 20:40:27,605 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2019-11-15 20:40:27,606 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2019-11-15 20:40:27,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 67 transitions. [2019-11-15 20:40:27,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:40:27,607 INFO L688 BuchiCegarLoop]: Abstraction has 56 states and 67 transitions. [2019-11-15 20:40:27,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 67 transitions. [2019-11-15 20:40:27,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2019-11-15 20:40:27,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-15 20:40:27,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2019-11-15 20:40:27,620 INFO L711 BuchiCegarLoop]: Abstraction has 51 states and 60 transitions. [2019-11-15 20:40:27,620 INFO L591 BuchiCegarLoop]: Abstraction has 51 states and 60 transitions. [2019-11-15 20:40:27,621 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 20:40:27,621 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 60 transitions. [2019-11-15 20:40:27,622 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2019-11-15 20:40:27,623 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:40:27,623 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:40:27,623 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:40:27,624 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 20:40:27,624 INFO L791 eck$LassoCheckResult]: Stem: 273#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 271#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 272#L31-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 260#L31-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 294#L35 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 261#L39 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 262#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 293#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 246#L18 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 244#recENTRY [2019-11-15 20:40:27,624 INFO L793 eck$LassoCheckResult]: Loop: 244#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 247#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 245#L18 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 244#recENTRY [2019-11-15 20:40:27,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:40:27,624 INFO L82 PathProgramCache]: Analyzing trace with hash -498407605, now seen corresponding path program 1 times [2019-11-15 20:40:27,624 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:40:27,624 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301629132] [2019-11-15 20:40:27,625 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:27,625 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:27,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:40:27,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:40:27,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:40:27,669 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:40:27,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:40:27,670 INFO L82 PathProgramCache]: Analyzing trace with hash 29956, now seen corresponding path program 1 times [2019-11-15 20:40:27,670 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:40:27,670 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612990902] [2019-11-15 20:40:27,671 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:27,671 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:27,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:40:27,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:40:27,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:40:27,695 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:40:27,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:40:27,697 INFO L82 PathProgramCache]: Analyzing trace with hash -359018118, now seen corresponding path program 2 times [2019-11-15 20:40:27,698 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:40:27,699 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634093638] [2019-11-15 20:40:27,699 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:27,699 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:27,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:40:27,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:40:27,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:40:27,788 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:40:27,915 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-11-15 20:40:28,213 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-11-15 20:40:28,588 WARN L191 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 94 [2019-11-15 20:40:29,119 WARN L191 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 109 [2019-11-15 20:40:29,240 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-15 20:40:29,244 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:40:29,244 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:40:29,244 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:40:29,244 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:40:29,245 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:40:29,245 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:40:29,245 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:40:29,245 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:40:29,245 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11C.i_Iteration3_Lasso [2019-11-15 20:40:29,245 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:40:29,245 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:40:29,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 20:40:29,257 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 20:40:29,263 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 20:40:29,265 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 20:40:29,267 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 20:40:29,269 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 20:40:29,271 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 20:40:29,273 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 20:40:29,275 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 20:40:29,277 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 20:40:29,279 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 20:40:29,281 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 20:40:29,283 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 20:40:29,285 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 20:40:29,417 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2019-11-15 20:40:29,499 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 20:40:29,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 20:40:29,502 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 20:40:29,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 20:40:29,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 20:40:29,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:40:29,508 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 20:40:29,515 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 20:40:29,519 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 20:40:29,521 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 20:40:29,522 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 20:40:29,524 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 20:40:29,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 20:40:29,526 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 20:40:29,528 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 20:40:29,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 20:40:29,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 20:40:29,532 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 20:40:29,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 20:40:29,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 20:40:29,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 20:40:29,968 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 29 [2019-11-15 20:40:30,003 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:40:30,003 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:40:30,003 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 20:40:30,004 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:40:30,004 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:40:30,005 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:40:30,005 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:40:30,005 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:40:30,005 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:40:30,006 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:40:30,006 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:40:30,008 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 20:40:30,009 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:40:30,009 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:40:30,010 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:40:30,010 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:40:30,010 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:40:30,010 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:40:30,011 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:40:30,011 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:40:30,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 20:40:30,012 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:40:30,012 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:40:30,013 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:40:30,013 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:40:30,013 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:40:30,013 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:40:30,013 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:40:30,014 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:40:30,014 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 20:40:30,015 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:40:30,015 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:40:30,015 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:40:30,015 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:40:30,016 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:40:30,016 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:40:30,016 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:40:30,017 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:40:30,017 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 20:40:30,018 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:40:30,018 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:40:30,018 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:40:30,018 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:40:30,018 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:40:30,019 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:40:30,019 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:40:30,019 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:40:30,020 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 20:40:30,020 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:40:30,020 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:40:30,021 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:40:30,021 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:40:30,021 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:40:30,021 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:40:30,021 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:40:30,022 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:40:30,022 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 20:40:30,023 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:40:30,023 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:40:30,023 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:40:30,023 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:40:30,024 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:40:30,024 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:40:30,024 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:40:30,025 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:40:30,025 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 20:40:30,025 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:40:30,026 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:40:30,026 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:40:30,026 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:40:30,026 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:40:30,027 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:40:30,027 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:40:30,027 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:40:30,028 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 20:40:30,028 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:40:30,028 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:40:30,029 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:40:30,029 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:40:30,029 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:40:30,029 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:40:30,030 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:40:30,030 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:40:30,031 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 20:40:30,031 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:40:30,031 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:40:30,031 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:40:30,032 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:40:30,032 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:40:30,032 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:40:30,032 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:40:30,033 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:40:30,033 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 20:40:30,034 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:40:30,034 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:40:30,034 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:40:30,034 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:40:30,035 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:40:30,035 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:40:30,037 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:40:30,038 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 20:40:30,038 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:40:30,038 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:40:30,038 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:40:30,039 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:40:30,039 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:40:30,039 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:40:30,039 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:40:30,040 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:40:30,040 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 20:40:30,041 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:40:30,041 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:40:30,041 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:40:30,041 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:40:30,041 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:40:30,042 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:40:30,042 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:40:30,043 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:40:30,043 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 20:40:30,044 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:40:30,044 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:40:30,044 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:40:30,044 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:40:30,046 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:40:30,046 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:40:30,054 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:40:30,054 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 20:40:30,055 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:40:30,055 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:40:30,055 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:40:30,055 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:40:30,056 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:40:30,056 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:40:30,058 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:40:30,058 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 20:40:30,059 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:40:30,059 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:40:30,060 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:40:30,060 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:40:30,062 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:40:30,063 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:40:30,100 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:40:30,108 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 20:40:30,109 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 20:40:30,109 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:40:30,110 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 20:40:30,111 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:40:30,111 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_1) = 2*v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_1 + 1 Supporting invariants [] [2019-11-15 20:40:30,116 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2019-11-15 20:40:30,120 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:40:30,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:40:30,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:40:30,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 20:40:30,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:40:30,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:40:30,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-15 20:40:30,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:40:30,236 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:40:30,236 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 1 case distinctions, treesize of input 36 treesize of output 53 [2019-11-15 20:40:30,238 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:40:30,269 INFO L567 ElimStorePlain]: treesize reduction 20, result has 67.7 percent of original size [2019-11-15 20:40:30,270 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 20:40:30,270 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2019-11-15 20:40:30,284 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 20:40:30,285 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 20:40:30,285 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 51 states and 60 transitions. cyclomatic complexity: 14 Second operand 4 states. [2019-11-15 20:40:30,364 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 51 states and 60 transitions. cyclomatic complexity: 14. Second operand 4 states. Result 99 states and 122 transitions. Complement of second has 17 states. [2019-11-15 20:40:30,365 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 20:40:30,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 20:40:30,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2019-11-15 20:40:30,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 9 letters. Loop has 3 letters. [2019-11-15 20:40:30,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:40:30,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 12 letters. Loop has 3 letters. [2019-11-15 20:40:30,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:40:30,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 9 letters. Loop has 6 letters. [2019-11-15 20:40:30,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:40:30,367 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 122 transitions. [2019-11-15 20:40:30,374 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2019-11-15 20:40:30,379 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 87 states and 110 transitions. [2019-11-15 20:40:30,379 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2019-11-15 20:40:30,379 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2019-11-15 20:40:30,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 110 transitions. [2019-11-15 20:40:30,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:40:30,380 INFO L688 BuchiCegarLoop]: Abstraction has 87 states and 110 transitions. [2019-11-15 20:40:30,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 110 transitions. [2019-11-15 20:40:30,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2019-11-15 20:40:30,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-15 20:40:30,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 102 transitions. [2019-11-15 20:40:30,390 INFO L711 BuchiCegarLoop]: Abstraction has 83 states and 102 transitions. [2019-11-15 20:40:30,390 INFO L591 BuchiCegarLoop]: Abstraction has 83 states and 102 transitions. [2019-11-15 20:40:30,390 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 20:40:30,390 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 102 transitions. [2019-11-15 20:40:30,393 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2019-11-15 20:40:30,393 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:40:30,393 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:40:30,394 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:40:30,394 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:40:30,394 INFO L791 eck$LassoCheckResult]: Stem: 510#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 509#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 487#L31-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 489#L31-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 506#L35 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 526#L39 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 555#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 554#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 477#L18 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 476#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 479#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 508#recFINAL assume true; 516#recEXIT >#42#return; 530#L18-1 ~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~res~0; 528#recFINAL assume true; 525#recEXIT >#44#return; 483#L39-1 assume !(-1 == main_#t~ret12);main_#t~ite13 := 1; 484#L39-3 [2019-11-15 20:40:30,395 INFO L793 eck$LassoCheckResult]: Loop: 484#L39-3 call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem14;havoc main_#t~ite13;havoc main_#t~ret12; 520#L31-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 531#L31-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 529#L35 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 504#L39 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 505#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 540#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 535#L18 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 505#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 540#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 541#recFINAL assume true; 548#recEXIT >#42#return; 536#L18-1 ~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~res~0; 537#recFINAL assume true; 534#recEXIT >#44#return; 524#L39-1 assume -1 == main_#t~ret12;main_#t~ite13 := -1; 484#L39-3 [2019-11-15 20:40:30,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:40:30,395 INFO L82 PathProgramCache]: Analyzing trace with hash -713572475, now seen corresponding path program 1 times [2019-11-15 20:40:30,395 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:40:30,395 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721646045] [2019-11-15 20:40:30,396 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:30,396 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:30,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:40:30,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:40:30,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:40:30,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:40:30,531 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 20:40:30,532 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721646045] [2019-11-15 20:40:30,532 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688730707] [2019-11-15 20:40:30,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fcb3849a-f819-4026-b2ba-d72ff78b1a39/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 20:40:30,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:40:30,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-15 20:40:30,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:40:30,681 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:40:30,682 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 1 case distinctions, treesize of input 25 treesize of output 46 [2019-11-15 20:40:30,683 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:40:30,700 INFO L567 ElimStorePlain]: treesize reduction 20, result has 60.8 percent of original size [2019-11-15 20:40:30,701 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 20:40:30,701 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:9 [2019-11-15 20:40:30,754 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 26 treesize of output 14 [2019-11-15 20:40:30,755 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:40:30,759 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:40:30,760 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 20:40:30,760 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2019-11-15 20:40:30,763 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:40:30,764 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:40:30,764 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2019-11-15 20:40:30,764 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075904190] [2019-11-15 20:40:30,764 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 20:40:30,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:40:30,765 INFO L82 PathProgramCache]: Analyzing trace with hash 542882406, now seen corresponding path program 2 times [2019-11-15 20:40:30,765 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:40:30,765 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680944279] [2019-11-15 20:40:30,765 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:30,765 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:30,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:40:30,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:40:30,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:40:30,820 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:40:31,156 WARN L191 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 91 [2019-11-15 20:40:31,721 WARN L191 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 121 [2019-11-15 20:40:31,803 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:40:31,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 20:40:31,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-11-15 20:40:31,804 INFO L87 Difference]: Start difference. First operand 83 states and 102 transitions. cyclomatic complexity: 26 Second operand 14 states. [2019-11-15 20:40:31,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:40:31,906 INFO L93 Difference]: Finished difference Result 85 states and 110 transitions. [2019-11-15 20:40:31,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 20:40:31,907 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 110 transitions. [2019-11-15 20:40:31,910 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 20:40:31,911 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 54 states and 67 transitions. [2019-11-15 20:40:31,911 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-15 20:40:31,912 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-15 20:40:31,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 67 transitions. [2019-11-15 20:40:31,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:40:31,912 INFO L688 BuchiCegarLoop]: Abstraction has 54 states and 67 transitions. [2019-11-15 20:40:31,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 67 transitions. [2019-11-15 20:40:31,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2019-11-15 20:40:31,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-15 20:40:31,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2019-11-15 20:40:31,917 INFO L711 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2019-11-15 20:40:31,917 INFO L591 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2019-11-15 20:40:31,917 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 20:40:31,917 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 54 transitions. [2019-11-15 20:40:31,918 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 20:40:31,918 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:40:31,918 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:40:31,919 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:40:31,919 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 20:40:31,919 INFO L791 eck$LassoCheckResult]: Stem: 754#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 753#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 739#L31-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 740#L31-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 766#L35 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 759#L39 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 765#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 764#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 747#L18 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 763#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 770#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 768#recFINAL assume true; 755#recEXIT >#42#return; 756#L18-1 ~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~res~0; 760#recFINAL assume true; 758#recEXIT >#44#return; 737#L39-1 assume -1 == main_#t~ret12;main_#t~ite13 := -1; 738#L39-3 call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem14;havoc main_#t~ite13;havoc main_#t~ret12; 741#L31-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 743#L31-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 750#L35 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 730#L39 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 729#recENTRY [2019-11-15 20:40:31,919 INFO L793 eck$LassoCheckResult]: Loop: 729#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 731#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 732#L18 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 729#recENTRY [2019-11-15 20:40:31,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:40:31,919 INFO L82 PathProgramCache]: Analyzing trace with hash -873815595, now seen corresponding path program 2 times [2019-11-15 20:40:31,920 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:40:31,920 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403357065] [2019-11-15 20:40:31,920 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:31,920 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:31,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:40:31,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:40:31,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:40:31,956 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:40:31,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:40:31,957 INFO L82 PathProgramCache]: Analyzing trace with hash 29956, now seen corresponding path program 2 times [2019-11-15 20:40:31,957 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:40:31,957 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383351334] [2019-11-15 20:40:31,957 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:31,958 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:31,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:40:31,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:40:31,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:40:31,966 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:40:31,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:40:31,967 INFO L82 PathProgramCache]: Analyzing trace with hash -43609424, now seen corresponding path program 3 times [2019-11-15 20:40:31,967 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:40:31,967 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330251499] [2019-11-15 20:40:31,968 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:31,968 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:31,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:40:31,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:40:32,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:40:32,013 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:40:32,141 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-11-15 20:40:32,714 WARN L191 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 91 [2019-11-15 20:40:32,894 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-11-15 20:40:34,491 WARN L191 SmtUtils]: Spent 1.51 s on a formula simplification. DAG size of input: 230 DAG size of output: 199 [2019-11-15 20:40:34,901 WARN L191 SmtUtils]: Spent 400.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2019-11-15 20:40:35,296 WARN L191 SmtUtils]: Spent 368.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2019-11-15 20:40:35,525 WARN L191 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2019-11-15 20:40:35,527 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:40:35,528 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:40:35,528 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:40:35,528 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:40:35,528 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:40:35,528 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:40:35,528 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:40:35,528 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:40:35,528 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11C.i_Iteration5_Lasso [2019-11-15 20:40:35,528 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:40:35,528 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:40:35,532 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 20:40:35,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 20:40:35,545 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 20:40:35,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 20:40:35,547 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 20:40:35,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 20:40:35,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 20:40:35,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 20:40:35,554 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 20:40:35,561 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 20:40:35,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 20:40:35,747 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-11-15 20:40:35,788 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 20:40:35,789 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 20:40:35,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 20:40:35,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 20:40:35,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 20:40:35,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 20:40:35,796 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 20:40:35,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 20:40:35,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 20:40:35,802 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 20:40:35,804 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 20:40:35,805 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 20:40:35,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 20:40:35,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 20:40:35,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 20:40:35,811 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 20:40:35,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 20:40:35,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 20:40:35,815 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 20:40:35,816 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 20:40:35,818 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 20:40:35,819 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 20:40:35,820 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 20:40:35,822 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 20:40:36,363 WARN L191 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-11-15 20:40:36,395 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:40:36,396 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:40:36,396 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 20:40:36,397 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:40:36,397 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:40:36,397 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:40:36,397 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:40:36,397 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:40:36,397 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:40:36,398 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:40:36,398 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:40:36,399 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 20:40:36,399 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:40:36,399 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:40:36,399 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:40:36,400 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:40:36,400 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:40:36,400 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:40:36,400 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:40:36,401 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:40:36,401 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 20:40:36,402 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:40:36,402 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:40:36,402 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:40:36,402 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:40:36,402 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:40:36,403 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:40:36,403 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:40:36,403 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:40:36,403 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 20:40:36,404 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:40:36,404 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:40:36,404 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:40:36,404 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:40:36,405 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:40:36,405 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:40:36,405 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:40:36,405 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:40:36,406 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 20:40:36,406 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:40:36,406 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:40:36,407 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:40:36,407 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:40:36,407 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:40:36,407 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:40:36,407 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:40:36,408 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:40:36,408 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 20:40:36,409 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:40:36,409 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:40:36,409 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:40:36,409 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:40:36,410 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:40:36,410 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:40:36,411 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:40:36,412 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 20:40:36,412 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:40:36,412 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:40:36,412 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:40:36,412 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:40:36,413 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:40:36,413 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:40:36,413 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:40:36,413 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:40:36,414 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 20:40:36,414 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:40:36,415 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:40:36,415 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:40:36,415 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:40:36,415 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:40:36,415 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:40:36,415 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:40:36,416 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:40:36,416 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 20:40:36,417 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:40:36,417 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:40:36,417 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:40:36,417 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:40:36,417 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:40:36,421 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:40:36,422 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:40:36,422 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:40:36,423 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 20:40:36,424 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:40:36,425 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:40:36,425 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:40:36,425 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:40:36,426 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:40:36,426 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:40:36,427 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:40:36,428 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 20:40:36,430 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:40:36,430 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:40:36,430 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:40:36,430 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:40:36,432 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:40:36,436 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:40:36,441 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:40:36,452 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 20:40:36,453 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:40:36,453 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:40:36,453 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:40:36,453 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:40:36,454 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:40:36,454 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:40:36,455 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:40:36,456 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 20:40:36,456 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:40:36,456 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:40:36,456 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:40:36,456 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:40:36,457 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:40:36,457 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:40:36,458 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:40:36,458 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 20:40:36,459 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:40:36,459 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:40:36,459 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:40:36,459 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:40:36,460 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:40:36,460 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:40:36,466 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:40:36,469 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 20:40:36,470 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 20:40:36,470 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:40:36,471 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 20:40:36,471 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:40:36,471 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_2) = 2*v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_2 + 1 Supporting invariants [] [2019-11-15 20:40:36,474 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-11-15 20:40:36,475 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:40:36,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:40:36,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:40:36,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 20:40:36,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:40:36,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:36,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:40:36,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-15 20:40:36,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:40:36,625 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:40:36,625 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 1 case distinctions, treesize of input 36 treesize of output 53 [2019-11-15 20:40:36,626 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:40:36,653 INFO L567 ElimStorePlain]: treesize reduction 20, result has 67.7 percent of original size [2019-11-15 20:40:36,654 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 20:40:36,654 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2019-11-15 20:40:36,671 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 20:40:36,671 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 20:40:36,671 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-11-15 20:40:36,751 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 55 states and 65 transitions. Complement of second has 14 states. [2019-11-15 20:40:36,753 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 20:40:36,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 20:40:36,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2019-11-15 20:40:36,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 22 letters. Loop has 3 letters. [2019-11-15 20:40:36,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:40:36,754 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 20:40:36,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:40:36,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:40:36,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 20:40:36,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:40:36,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:36,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:40:36,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-15 20:40:36,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:40:36,899 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:40:36,899 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 1 case distinctions, treesize of input 36 treesize of output 53 [2019-11-15 20:40:36,900 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:40:36,927 INFO L567 ElimStorePlain]: treesize reduction 20, result has 67.7 percent of original size [2019-11-15 20:40:36,928 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 20:40:36,928 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2019-11-15 20:40:36,944 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 20:40:36,944 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 20:40:36,945 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-11-15 20:40:37,015 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 55 states and 65 transitions. Complement of second has 14 states. [2019-11-15 20:40:37,017 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 20:40:37,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 20:40:37,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2019-11-15 20:40:37,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 22 letters. Loop has 3 letters. [2019-11-15 20:40:37,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:40:37,018 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 20:40:37,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:40:37,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:40:37,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 20:40:37,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:40:37,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:40:37,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:40:37,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-15 20:40:37,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:40:37,165 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:40:37,165 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 1 case distinctions, treesize of input 36 treesize of output 53 [2019-11-15 20:40:37,166 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:40:37,193 INFO L567 ElimStorePlain]: treesize reduction 20, result has 67.7 percent of original size [2019-11-15 20:40:37,193 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 20:40:37,194 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2019-11-15 20:40:37,207 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 20:40:37,207 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 20:40:37,207 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-11-15 20:40:37,327 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 68 states and 78 transitions. Complement of second has 15 states. [2019-11-15 20:40:37,330 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 20:40:37,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 20:40:37,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2019-11-15 20:40:37,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 22 letters. Loop has 3 letters. [2019-11-15 20:40:37,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:40:37,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 25 letters. Loop has 3 letters. [2019-11-15 20:40:37,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:40:37,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 22 letters. Loop has 6 letters. [2019-11-15 20:40:37,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:40:37,332 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 78 transitions. [2019-11-15 20:40:37,333 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 20:40:37,333 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 0 states and 0 transitions. [2019-11-15 20:40:37,334 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 20:40:37,334 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 20:40:37,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 20:40:37,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:40:37,334 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:40:37,334 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:40:37,334 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:40:37,334 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 20:40:37,334 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 20:40:37,334 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 20:40:37,334 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 20:40:37,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 08:40:37 BoogieIcfgContainer [2019-11-15 20:40:37,344 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 20:40:37,345 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:40:37,345 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:40:37,345 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:40:37,346 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:40:23" (3/4) ... [2019-11-15 20:40:37,350 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 20:40:37,351 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:40:37,352 INFO L168 Benchmark]: Toolchain (without parser) took 14592.26 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 394.8 MB). Free memory was 952.8 MB in the beginning and 1.0 GB in the end (delta: -89.4 MB). Peak memory consumption was 305.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:40:37,352 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:40:37,353 INFO L168 Benchmark]: CACSL2BoogieTranslator took 249.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 952.8 MB in the beginning and 1.2 GB in the end (delta: -198.5 MB). Peak memory consumption was 22.7 MB. Max. memory is 11.5 GB. [2019-11-15 20:40:37,353 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.30 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:40:37,353 INFO L168 Benchmark]: Boogie Preprocessor took 22.46 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:40:37,354 INFO L168 Benchmark]: RCFGBuilder took 362.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2019-11-15 20:40:37,355 INFO L168 Benchmark]: BuchiAutomizer took 13915.91 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 233.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 88.3 MB). Peak memory consumption was 322.1 MB. Max. memory is 11.5 GB. [2019-11-15 20:40:37,355 INFO L168 Benchmark]: Witness Printer took 5.59 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:40:37,359 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 249.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 952.8 MB in the beginning and 1.2 GB in the end (delta: -198.5 MB). Peak memory consumption was 22.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.30 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.46 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 362.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 13915.91 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 233.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 88.3 MB). Peak memory consumption was 322.1 MB. Max. memory is 11.5 GB. * Witness Printer took 5.59 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 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 - 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 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[qq][qq] and consists of 8 locations. One deterministic module has affine ranking function 2 * unknown-#memory_int-unknown[op][op] + 1 and consists of 5 locations. One nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[op][op] + 1 and consists of 6 locations. 2 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 13.8s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 11.8s. Construction of modules took 0.3s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 18 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 83 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 4/4 HoareTripleCheckerStatistics: 82 SDtfs, 61 SDslu, 146 SDs, 0 SdLazy, 238 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital385 mio100 ax100 hnf100 lsp98 ukn41 mio100 lsp29 div100 bol100 ite100 ukn100 eq180 hnf93 smp100 dnf445 smp88 tf100 neg86 sie151 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms 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...