./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/c.03-alloca-1.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_72a48241-9387-42d3-82ca-aed4818061a6/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_72a48241-9387-42d3-82ca-aed4818061a6/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_72a48241-9387-42d3-82ca-aed4818061a6/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_72a48241-9387-42d3-82ca-aed4818061a6/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/c.03-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_72a48241-9387-42d3-82ca-aed4818061a6/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_72a48241-9387-42d3-82ca-aed4818061a6/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 4eacdd25ec766896c06b3ec61ff2eab4c80478ff ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 23:45:55,718 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:45:55,719 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:45:55,733 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:45:55,733 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:45:55,734 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:45:55,736 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:45:55,748 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:45:55,750 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:45:55,752 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:45:55,753 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:45:55,755 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:45:55,755 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:45:55,758 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:45:55,759 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:45:55,761 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:45:55,761 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:45:55,764 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:45:55,767 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:45:55,772 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:45:55,775 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:45:55,777 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:45:55,779 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:45:55,780 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:45:55,783 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:45:55,783 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:45:55,783 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:45:55,785 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:45:55,785 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:45:55,786 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:45:55,786 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:45:55,787 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:45:55,787 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:45:55,788 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:45:55,789 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:45:55,790 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:45:55,790 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:45:55,791 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:45:55,791 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:45:55,792 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:45:55,792 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:45:55,794 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_72a48241-9387-42d3-82ca-aed4818061a6/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 23:45:55,812 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:45:55,812 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:45:55,813 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:45:55,814 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:45:55,814 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:45:55,814 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 23:45:55,814 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 23:45:55,814 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 23:45:55,815 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 23:45:55,815 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 23:45:55,816 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 23:45:55,816 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:45:55,816 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 23:45:55,817 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:45:55,817 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:45:55,817 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 23:45:55,817 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 23:45:55,818 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 23:45:55,818 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:45:55,818 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 23:45:55,818 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:45:55,818 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 23:45:55,819 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:45:55,819 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:45:55,819 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 23:45:55,819 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:45:55,820 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:45:55,820 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 23:45:55,821 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 23:45:55,821 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_72a48241-9387-42d3-82ca-aed4818061a6/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 -> 4eacdd25ec766896c06b3ec61ff2eab4c80478ff [2019-11-15 23:45:55,858 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:45:55,873 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:45:55,875 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:45:55,876 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:45:55,876 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:45:55,877 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_72a48241-9387-42d3-82ca-aed4818061a6/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/c.03-alloca-1.i [2019-11-15 23:45:55,938 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_72a48241-9387-42d3-82ca-aed4818061a6/bin/uautomizer/data/094a272d2/fb12cec7c19e47b1b0ac6ddedd95bfdc/FLAG35be3cc7e [2019-11-15 23:45:56,369 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:45:56,370 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_72a48241-9387-42d3-82ca-aed4818061a6/sv-benchmarks/c/termination-memory-alloca/c.03-alloca-1.i [2019-11-15 23:45:56,380 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_72a48241-9387-42d3-82ca-aed4818061a6/bin/uautomizer/data/094a272d2/fb12cec7c19e47b1b0ac6ddedd95bfdc/FLAG35be3cc7e [2019-11-15 23:45:56,392 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_72a48241-9387-42d3-82ca-aed4818061a6/bin/uautomizer/data/094a272d2/fb12cec7c19e47b1b0ac6ddedd95bfdc [2019-11-15 23:45:56,394 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:45:56,395 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:45:56,396 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:45:56,396 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:45:56,400 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:45:56,400 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:45:56" (1/1) ... [2019-11-15 23:45:56,403 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27f23af1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:56, skipping insertion in model container [2019-11-15 23:45:56,403 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:45:56" (1/1) ... [2019-11-15 23:45:56,410 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:45:56,440 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:45:56,874 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:45:56,886 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:45:56,923 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:45:56,965 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:45:56,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:56 WrapperNode [2019-11-15 23:45:56,966 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:45:56,967 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:45:56,967 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:45:56,967 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:45:56,975 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:56" (1/1) ... [2019-11-15 23:45:56,988 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:56" (1/1) ... [2019-11-15 23:45:57,006 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:45:57,006 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:45:57,006 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:45:57,006 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:45:57,014 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:56" (1/1) ... [2019-11-15 23:45:57,014 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:56" (1/1) ... [2019-11-15 23:45:57,018 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:56" (1/1) ... [2019-11-15 23:45:57,018 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:56" (1/1) ... [2019-11-15 23:45:57,023 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:56" (1/1) ... [2019-11-15 23:45:57,029 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:56" (1/1) ... [2019-11-15 23:45:57,033 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:56" (1/1) ... [2019-11-15 23:45:57,036 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:45:57,037 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:45:57,037 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:45:57,037 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:45:57,037 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_72a48241-9387-42d3-82ca-aed4818061a6/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 23:45:57,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 23:45:57,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:45:57,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:45:57,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:45:57,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:45:57,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:45:57,378 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:45:57,379 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 23:45:57,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:45:57 BoogieIcfgContainer [2019-11-15 23:45:57,380 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:45:57,381 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 23:45:57,381 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 23:45:57,383 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 23:45:57,384 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:45:57,384 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 11:45:56" (1/3) ... [2019-11-15 23:45:57,385 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@77354211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:45:57, skipping insertion in model container [2019-11-15 23:45:57,386 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:45:57,386 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:56" (2/3) ... [2019-11-15 23:45:57,386 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@77354211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:45:57, skipping insertion in model container [2019-11-15 23:45:57,386 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:45:57,387 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:45:57" (3/3) ... [2019-11-15 23:45:57,388 INFO L371 chiAutomizerObserver]: Analyzing ICFG c.03-alloca-1.i [2019-11-15 23:45:57,445 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 23:45:57,445 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 23:45:57,447 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 23:45:57,447 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:45:57,448 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:45:57,448 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 23:45:57,448 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:45:57,448 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 23:45:57,462 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-11-15 23:45:57,486 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 23:45:57,486 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:45:57,486 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:45:57,491 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 23:45:57,491 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 23:45:57,491 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 23:45:57,491 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-11-15 23:45:57,493 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 23:45:57,493 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:45:57,493 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:45:57,493 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 23:45:57,494 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 23:45:57,499 INFO L791 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~ret18;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet15, main_#t~nondet16, main_#t~nondet17;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem14, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 9#L558-2true [2019-11-15 23:45:57,499 INFO L793 eck$LassoCheckResult]: Loop: 9#L558-2true call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 < test_fun_#t~mem7; 10#L557-1true assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647; 13#L557-3true assume !!test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;havoc test_fun_#t~short9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem11 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 5#L558true assume test_fun_#t~mem10 < test_fun_#t~mem11;havoc test_fun_#t~mem10;havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem12, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 9#L558-2true [2019-11-15 23:45:57,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:57,506 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-15 23:45:57,511 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:57,511 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31691623] [2019-11-15 23:45:57,512 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:57,512 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:57,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:57,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:45:57,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:45:57,696 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:45:57,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:57,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1142247, now seen corresponding path program 1 times [2019-11-15 23:45:57,698 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:57,698 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266204907] [2019-11-15 23:45:57,698 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:57,699 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:57,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:57,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:45:57,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:45:57,729 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:45:57,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:57,730 INFO L82 PathProgramCache]: Analyzing trace with hash 889569449, now seen corresponding path program 1 times [2019-11-15 23:45:57,731 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:57,731 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759598350] [2019-11-15 23:45:57,731 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:57,731 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:57,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:57,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:45:57,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:45:57,845 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:45:58,062 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-11-15 23:45:58,848 WARN L191 SmtUtils]: Spent 710.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 110 [2019-11-15 23:45:59,193 WARN L191 SmtUtils]: Spent 342.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-11-15 23:45:59,205 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:45:59,206 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:45:59,206 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:45:59,206 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:45:59,206 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:45:59,206 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:45:59,207 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:45:59,207 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:45:59,207 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.03-alloca-1.i_Iteration1_Lasso [2019-11-15 23:45:59,207 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:45:59,207 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:45:59,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:45:59,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:45:59,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:45:59,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:45:59,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:45:59,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 23:45:59,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:45:59,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 23:45:59,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 23:45:59,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 23:45:59,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:45:59,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 23:45:59,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:45:59,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 23:45:59,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:45:59,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:45:59,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:46:00,048 WARN L191 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 100 [2019-11-15 23:46:00,213 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2019-11-15 23:46:00,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:46:00,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:46:00,456 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-11-15 23:46:01,799 WARN L191 SmtUtils]: Spent 904.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-11-15 23:46:01,827 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:46:01,831 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:46:01,833 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 23:46:01,834 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:46:01,835 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:46:01,835 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:46:01,836 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:46:01,836 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:46:01,838 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:46:01,838 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:46:01,841 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:46:01,841 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 23:46:01,842 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:46:01,842 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:46:01,842 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:46:01,842 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:46:01,845 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:46:01,845 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:46:01,848 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:46:01,849 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 23:46:01,850 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:46:01,850 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:46:01,850 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:46:01,850 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:46:01,850 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:46:01,851 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:46:01,851 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:46:01,852 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:46:01,852 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 23:46:01,853 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:46:01,853 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:46:01,853 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:46:01,854 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:46:01,854 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:46:01,854 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:46:01,854 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:46:01,855 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:46:01,856 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 23:46:01,856 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:46:01,856 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:46:01,857 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:46:01,857 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:46:01,857 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:46:01,857 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:46:01,858 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:46:01,858 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:46:01,859 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 23:46:01,859 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:46:01,860 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:46:01,860 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:46:01,860 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:46:01,862 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:46:01,862 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:46:01,865 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:46:01,865 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 23:46:01,866 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:46:01,866 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:46:01,866 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:46:01,867 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:46:01,867 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:46:01,867 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:46:01,867 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:46:01,868 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:46:01,869 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 23:46:01,869 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:46:01,870 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:46:01,870 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:46:01,870 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:46:01,870 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:46:01,871 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:46:01,871 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:46:01,872 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:46:01,872 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 23:46:01,873 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:46:01,873 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:46:01,873 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:46:01,873 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:46:01,875 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:46:01,875 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:46:01,879 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:46:01,880 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 23:46:01,880 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:46:01,881 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:46:01,881 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:46:01,881 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:46:01,883 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:46:01,883 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:46:01,886 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:46:01,886 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 23:46:01,887 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:46:01,887 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:46:01,887 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:46:01,887 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:46:01,887 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:46:01,888 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:46:01,888 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:46:01,889 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:46:01,889 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 23:46:01,890 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:46:01,890 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:46:01,890 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:46:01,891 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:46:01,891 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:46:01,891 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:46:01,891 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:46:01,892 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:46:01,893 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 23:46:01,893 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:46:01,893 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:46:01,894 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:46:01,894 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:46:01,894 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:46:01,894 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:46:01,895 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:46:01,895 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:46:01,896 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 23:46:01,897 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:46:01,897 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:46:01,897 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:46:01,897 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:46:01,897 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:46:01,898 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:46:01,898 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:46:01,899 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:46:01,899 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 23:46:01,900 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:46:01,900 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:46:01,900 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:46:01,901 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:46:01,902 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:46:01,903 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:46:01,905 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:46:01,906 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 23:46:01,906 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:46:01,907 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:46:01,907 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:46:01,907 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:46:01,907 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:46:01,908 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:46:01,908 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:46:01,909 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:46:01,909 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 23:46:01,910 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:46:01,910 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:46:01,910 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:46:01,910 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:46:01,912 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:46:01,912 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:46:01,916 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:46:01,916 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 23:46:01,917 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:46:01,917 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:46:01,917 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:46:01,917 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:46:01,920 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:46:01,920 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:46:01,930 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:46:01,930 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 23:46:01,931 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:46:01,932 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:46:01,932 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:46:01,932 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:46:01,938 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:46:01,938 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:46:01,999 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:46:02,034 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 23:46:02,034 INFO L444 ModelExtractionUtils]: 33 out of 40 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-11-15 23:46:02,036 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:46:02,038 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:46:02,038 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:46:02,039 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 + 4294967291 Supporting invariants [] [2019-11-15 23:46:02,190 INFO L297 tatePredicateManager]: 41 out of 41 supporting invariants were superfluous and have been removed [2019-11-15 23:46:02,198 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 23:46:02,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:02,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:02,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:46:02,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:46:02,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:02,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 23:46:02,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:46:02,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:46:02,329 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 23:46:02,344 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 23:46:02,345 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states. Second operand 5 states. [2019-11-15 23:46:02,461 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states.. Second operand 5 states. Result 28 states and 36 transitions. Complement of second has 9 states. [2019-11-15 23:46:02,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 23:46:02,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 23:46:02,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2019-11-15 23:46:02,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 2 letters. Loop has 4 letters. [2019-11-15 23:46:02,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:46:02,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-15 23:46:02,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:46:02,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 2 letters. Loop has 8 letters. [2019-11-15 23:46:02,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:46:02,471 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 36 transitions. [2019-11-15 23:46:02,473 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 23:46:02,478 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 13 states and 19 transitions. [2019-11-15 23:46:02,479 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-15 23:46:02,479 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-11-15 23:46:02,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 19 transitions. [2019-11-15 23:46:02,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:46:02,480 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2019-11-15 23:46:02,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 19 transitions. [2019-11-15 23:46:02,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-11-15 23:46:02,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-15 23:46:02,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2019-11-15 23:46:02,503 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-11-15 23:46:02,503 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-11-15 23:46:02,503 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 23:46:02,503 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2019-11-15 23:46:02,503 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 23:46:02,503 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:46:02,504 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:46:02,504 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-15 23:46:02,504 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 23:46:02,504 INFO L791 eck$LassoCheckResult]: Stem: 260#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 253#L-1 havoc main_#res;havoc main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~ret18;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet15, main_#t~nondet16, main_#t~nondet17;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem14, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 254#L558-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 < test_fun_#t~mem7; 261#L557-1 [2019-11-15 23:46:02,504 INFO L793 eck$LassoCheckResult]: Loop: 261#L557-1 assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647; 263#L557-3 assume !!test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;havoc test_fun_#t~short9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem11 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 255#L558 assume !(test_fun_#t~mem10 < test_fun_#t~mem11);havoc test_fun_#t~mem10;havoc test_fun_#t~mem11;call test_fun_#t~mem13 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem13, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem13; 256#L558-2 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 < test_fun_#t~mem7; 261#L557-1 [2019-11-15 23:46:02,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:02,505 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2019-11-15 23:46:02,505 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:02,505 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87883389] [2019-11-15 23:46:02,505 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:02,505 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:02,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:02,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:46:02,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:46:02,561 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:46:02,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:02,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1239449, now seen corresponding path program 1 times [2019-11-15 23:46:02,562 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:02,562 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915576761] [2019-11-15 23:46:02,562 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:02,562 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:02,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:02,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:46:02,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:46:02,599 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:46:02,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:02,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1806849212, now seen corresponding path program 1 times [2019-11-15 23:46:02,602 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:46:02,602 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446364543] [2019-11-15 23:46:02,602 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:02,602 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:46:02,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:46:02,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:46:02,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:46:02,692 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:46:02,893 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2019-11-15 23:46:03,023 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-15 23:46:03,776 WARN L191 SmtUtils]: Spent 751.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 128 [2019-11-15 23:46:04,902 WARN L191 SmtUtils]: Spent 1.12 s on a formula simplification that was a NOOP. DAG size: 125 [2019-11-15 23:46:04,905 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:46:04,905 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:46:04,905 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:46:04,905 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:46:04,905 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:46:04,905 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:46:04,905 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:46:04,905 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:46:04,906 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.03-alloca-1.i_Iteration2_Lasso [2019-11-15 23:46:04,906 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:46:04,906 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:46:04,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:46:04,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:46:04,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:46:04,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:46:04,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:46:04,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:46:04,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:46:04,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:46:04,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:46:04,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:46:04,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:46:06,190 WARN L191 SmtUtils]: Spent 1.00 s on a formula simplification. DAG size of input: 126 DAG size of output: 108 [2019-11-15 23:46:06,368 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 81 [2019-11-15 23:46:06,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:46:06,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:46:06,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:46:06,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:46:06,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:46:06,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:46:06,559 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-11-15 23:46:07,116 WARN L191 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-11-15 23:46:07,259 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2019-11-15 23:46:08,196 WARN L191 SmtUtils]: Spent 840.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-11-15 23:46:08,236 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:46:08,236 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:46:08,237 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 23:46:08,240 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:46:08,240 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:46:08,240 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:46:08,241 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:46:08,241 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:46:08,241 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:46:08,241 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:46:08,242 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:46:08,243 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 23:46:08,243 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:46:08,244 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:46:08,244 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:46:08,244 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:46:08,245 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:46:08,250 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:46:08,251 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:46:08,252 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 23:46:08,253 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:46:08,253 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:46:08,254 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:46:08,254 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:46:08,254 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:46:08,255 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:46:08,255 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:46:08,255 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:46:08,256 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 23:46:08,256 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:46:08,257 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:46:08,257 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:46:08,257 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:46:08,257 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:46:08,258 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:46:08,258 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:46:08,258 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:46:08,259 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 23:46:08,260 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:46:08,260 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:46:08,260 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:46:08,260 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:46:08,261 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:46:08,261 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:46:08,263 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:46:08,263 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 23:46:08,264 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:46:08,264 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:46:08,264 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:46:08,265 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:46:08,265 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:46:08,265 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:46:08,265 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:46:08,266 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:46:08,266 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 23:46:08,267 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:46:08,267 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:46:08,267 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:46:08,267 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:46:08,268 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:46:08,268 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:46:08,270 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:46:08,271 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 23:46:08,271 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:46:08,271 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:46:08,272 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:46:08,272 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:46:08,272 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:46:08,272 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:46:08,272 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:46:08,273 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:46:08,273 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 23:46:08,274 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:46:08,274 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:46:08,274 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:46:08,274 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:46:08,275 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:46:08,275 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:46:08,276 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:46:08,277 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 23:46:08,277 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:46:08,278 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:46:08,278 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:46:08,278 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:46:08,279 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:46:08,279 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:46:08,280 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:46:08,281 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 23:46:08,281 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:46:08,281 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:46:08,282 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:46:08,282 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:46:08,283 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:46:08,283 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:46:08,285 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:46:08,285 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 23:46:08,286 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:46:08,286 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:46:08,286 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:46:08,286 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:46:08,287 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:46:08,287 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:46:08,292 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:46:08,292 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 23:46:08,293 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:46:08,293 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 23:46:08,293 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:46:08,294 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:46:08,305 INFO L400 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-11-15 23:46:08,305 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 23:46:08,513 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:46:08,759 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 23:46:08,762 INFO L444 ModelExtractionUtils]: 73 out of 81 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-11-15 23:46:08,763 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:46:08,768 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2019-11-15 23:46:08,769 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:46:08,769 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_2) = -2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_2 + 4294967293 Supporting invariants [] [2019-11-15 23:46:08,964 INFO L297 tatePredicateManager]: 41 out of 41 supporting invariants were superfluous and have been removed [2019-11-15 23:46:08,965 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 23:46:08,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:08,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:08,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:46:08,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:46:09,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:09,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:46:09,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:46:09,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:46:09,102 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2019-11-15 23:46:09,103 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:46:09,109 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:46:09,109 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:46:09,110 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:19 [2019-11-15 23:46:09,129 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 23:46:09,130 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-11-15 23:46:09,130 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 17 transitions. cyclomatic complexity: 7 Second operand 5 states. [2019-11-15 23:46:09,174 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 17 transitions. cyclomatic complexity: 7. Second operand 5 states. Result 24 states and 41 transitions. Complement of second has 8 states. [2019-11-15 23:46:09,175 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 23:46:09,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 23:46:09,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-11-15 23:46:09,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 3 letters. Loop has 4 letters. [2019-11-15 23:46:09,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:46:09,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 7 letters. Loop has 4 letters. [2019-11-15 23:46:09,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:46:09,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 3 letters. Loop has 8 letters. [2019-11-15 23:46:09,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:46:09,177 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 41 transitions. [2019-11-15 23:46:09,179 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:46:09,179 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 0 states and 0 transitions. [2019-11-15 23:46:09,179 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 23:46:09,179 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 23:46:09,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 23:46:09,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:46:09,180 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:46:09,180 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:46:09,180 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:46:09,180 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 23:46:09,180 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:46:09,180 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:46:09,180 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 23:46:09,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 11:46:09 BoogieIcfgContainer [2019-11-15 23:46:09,186 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 23:46:09,187 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:46:09,187 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:46:09,187 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:46:09,188 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:45:57" (3/4) ... [2019-11-15 23:46:09,191 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 23:46:09,191 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:46:09,192 INFO L168 Benchmark]: Toolchain (without parser) took 12796.99 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 253.2 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -182.3 MB). Peak memory consumption was 70.9 MB. Max. memory is 11.5 GB. [2019-11-15 23:46:09,193 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:46:09,194 INFO L168 Benchmark]: CACSL2BoogieTranslator took 570.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -200.4 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:46:09,194 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.87 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:46:09,195 INFO L168 Benchmark]: Boogie Preprocessor took 30.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:46:09,196 INFO L168 Benchmark]: RCFGBuilder took 343.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:46:09,196 INFO L168 Benchmark]: BuchiAutomizer took 11805.97 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 94.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -9.6 MB). Peak memory consumption was 85.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:46:09,197 INFO L168 Benchmark]: Witness Printer took 4.17 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:46:09,200 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 570.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -200.4 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.87 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 343.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 11805.97 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 94.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -9.6 MB). Peak memory consumption was 85.3 MB. Max. memory is 11.5 GB. * Witness Printer took 4.17 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[x_ref][x_ref] + 4294967291 and consists of 6 locations. One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[z_ref][z_ref] + 4294967293 and consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.7s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 11.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 12 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 10 SDtfs, 13 SDslu, 13 SDs, 0 SdLazy, 34 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital637 mio100 ax103 hnf99 lsp72 ukn76 mio100 lsp28 div100 bol105 ite100 ukn100 eq178 hnf88 smp95 dnf635 smp90 tf100 neg91 sie127 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 476ms VariablesStem: 15 VariablesLoop: 10 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 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...