./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.16-alloca.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_12078e08-0eca-4c6b-965a-3c81a204f030/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_12078e08-0eca-4c6b-965a-3c81a204f030/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_12078e08-0eca-4c6b-965a-3c81a204f030/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_12078e08-0eca-4c6b-965a-3c81a204f030/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.16-alloca.i -s /tmp/vcloud-vcloud-master/worker/run_dir_12078e08-0eca-4c6b-965a-3c81a204f030/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_12078e08-0eca-4c6b-965a-3c81a204f030/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 59be66e49b54b8b00b9c1d5bff1f6857d45f8bbd ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:23:10,736 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:23:10,738 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:23:10,752 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:23:10,753 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:23:10,754 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:23:10,756 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:23:10,765 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:23:10,769 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:23:10,774 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:23:10,775 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:23:10,777 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:23:10,777 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:23:10,779 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:23:10,780 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:23:10,781 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:23:10,782 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:23:10,783 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:23:10,785 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:23:10,789 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:23:10,792 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:23:10,794 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:23:10,797 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:23:10,797 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:23:10,800 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:23:10,800 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:23:10,800 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:23:10,802 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:23:10,802 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:23:10,803 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:23:10,803 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:23:10,804 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:23:10,804 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:23:10,805 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:23:10,806 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:23:10,807 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:23:10,807 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:23:10,808 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:23:10,808 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:23:10,809 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:23:10,809 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:23:10,810 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_12078e08-0eca-4c6b-965a-3c81a204f030/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 23:23:10,837 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:23:10,837 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:23:10,838 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:23:10,838 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:23:10,839 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:23:10,839 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 23:23:10,839 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 23:23:10,839 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 23:23:10,839 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 23:23:10,840 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 23:23:10,840 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 23:23:10,840 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:23:10,840 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 23:23:10,840 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:23:10,841 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:23:10,841 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 23:23:10,841 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 23:23:10,841 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 23:23:10,841 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:23:10,842 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 23:23:10,842 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:23:10,842 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 23:23:10,842 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:23:10,843 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:23:10,843 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 23:23:10,843 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:23:10,843 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:23:10,843 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 23:23:10,861 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 23:23:10,861 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_12078e08-0eca-4c6b-965a-3c81a204f030/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 -> 59be66e49b54b8b00b9c1d5bff1f6857d45f8bbd [2019-11-15 23:23:10,894 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:23:10,913 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:23:10,918 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:23:10,920 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:23:10,921 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:23:10,922 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_12078e08-0eca-4c6b-965a-3c81a204f030/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/b.16-alloca.i [2019-11-15 23:23:10,988 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_12078e08-0eca-4c6b-965a-3c81a204f030/bin/uautomizer/data/8f9bb3481/e09760b977274f6e8a92e786d6a01d7e/FLAG4dc375f26 [2019-11-15 23:23:11,355 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:23:11,356 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_12078e08-0eca-4c6b-965a-3c81a204f030/sv-benchmarks/c/termination-memory-alloca/b.16-alloca.i [2019-11-15 23:23:11,366 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_12078e08-0eca-4c6b-965a-3c81a204f030/bin/uautomizer/data/8f9bb3481/e09760b977274f6e8a92e786d6a01d7e/FLAG4dc375f26 [2019-11-15 23:23:11,692 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_12078e08-0eca-4c6b-965a-3c81a204f030/bin/uautomizer/data/8f9bb3481/e09760b977274f6e8a92e786d6a01d7e [2019-11-15 23:23:11,694 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:23:11,695 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:23:11,696 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:23:11,696 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:23:11,699 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:23:11,699 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:23:11" (1/1) ... [2019-11-15 23:23:11,701 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53a455e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:23:11, skipping insertion in model container [2019-11-15 23:23:11,701 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:23:11" (1/1) ... [2019-11-15 23:23:11,706 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:23:11,741 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:23:12,202 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:23:12,215 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:23:12,274 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:23:12,325 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:23:12,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:23:12 WrapperNode [2019-11-15 23:23:12,326 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:23:12,327 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:23:12,327 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:23:12,327 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:23:12,336 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:23:12" (1/1) ... [2019-11-15 23:23:12,352 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:23:12" (1/1) ... [2019-11-15 23:23:12,371 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:23:12,372 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:23:12,372 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:23:12,372 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:23:12,381 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:23:12" (1/1) ... [2019-11-15 23:23:12,381 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:23:12" (1/1) ... [2019-11-15 23:23:12,385 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:23:12" (1/1) ... [2019-11-15 23:23:12,385 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:23:12" (1/1) ... [2019-11-15 23:23:12,391 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:23:12" (1/1) ... [2019-11-15 23:23:12,396 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:23:12" (1/1) ... [2019-11-15 23:23:12,398 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:23:12" (1/1) ... [2019-11-15 23:23:12,401 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:23:12,401 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:23:12,401 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:23:12,401 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:23:12,402 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:23:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_12078e08-0eca-4c6b-965a-3c81a204f030/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:23:12,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 23:23:12,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:23:12,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:23:12,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:23:12,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:23:12,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:23:12,779 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:23:12,779 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 23:23:12,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:23:12 BoogieIcfgContainer [2019-11-15 23:23:12,780 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:23:12,780 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 23:23:12,780 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 23:23:12,783 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 23:23:12,784 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:23:12,784 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 11:23:11" (1/3) ... [2019-11-15 23:23:12,784 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@734fa392 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:23:12, skipping insertion in model container [2019-11-15 23:23:12,785 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:23:12,785 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:23:12" (2/3) ... [2019-11-15 23:23:12,786 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@734fa392 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:23:12, skipping insertion in model container [2019-11-15 23:23:12,786 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:23:12,786 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:23:12" (3/3) ... [2019-11-15 23:23:12,788 INFO L371 chiAutomizerObserver]: Analyzing ICFG b.16-alloca.i [2019-11-15 23:23:12,834 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 23:23:12,834 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 23:23:12,835 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 23:23:12,835 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:23:12,836 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:23:12,836 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 23:23:12,836 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:23:12,836 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 23:23:12,849 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-11-15 23:23:12,873 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 23:23:12,873 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:23:12,873 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:23:12,880 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 23:23:12,880 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 23:23:12,880 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 23:23:12,880 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-11-15 23:23:12,885 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 23:23:12,885 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:23:12,885 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:23:12,885 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 23:23:12,886 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 23:23:12,893 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~nondet10, main_#t~nondet11, main_#t~ret12;test_fun_#in~x, test_fun_#in~y := main_#t~nondet10, main_#t~nondet11;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~mem7, test_fun_#t~mem6, test_fun_#t~mem8, test_fun_#t~mem5, test_fun_#t~mem9, test_fun_~x, test_fun_~y, 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_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;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_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.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(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 7#L555-3true [2019-11-15 23:23:12,893 INFO L793 eck$LassoCheckResult]: Loop: 7#L555-3true call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 14#L555-1true assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 5#L556-3true assume !true; 8#L556-4true call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem8 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem8; 7#L555-3true [2019-11-15 23:23:12,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:23:12,898 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-15 23:23:12,906 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:23:12,906 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491395014] [2019-11-15 23:23:12,907 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:23:12,907 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:23:12,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:23:13,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:23:13,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:23:13,084 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:23:13,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:23:13,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1144360, now seen corresponding path program 1 times [2019-11-15 23:23:13,085 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:23:13,086 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191061243] [2019-11-15 23:23:13,086 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:23:13,086 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:23:13,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:23:13,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:23:13,115 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:23:13,116 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191061243] [2019-11-15 23:23:13,116 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:23:13,117 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:23:13,117 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734822118] [2019-11-15 23:23:13,121 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 23:23:13,122 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:23:13,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-15 23:23:13,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 23:23:13,141 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 2 states. [2019-11-15 23:23:13,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:23:13,147 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2019-11-15 23:23:13,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 23:23:13,149 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2019-11-15 23:23:13,150 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 23:23:13,152 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 7 states and 8 transitions. [2019-11-15 23:23:13,153 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-15 23:23:13,153 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-15 23:23:13,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2019-11-15 23:23:13,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:23:13,154 INFO L688 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-11-15 23:23:13,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2019-11-15 23:23:13,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-11-15 23:23:13,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-15 23:23:13,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-11-15 23:23:13,177 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-11-15 23:23:13,177 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-11-15 23:23:13,177 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 23:23:13,177 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2019-11-15 23:23:13,178 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 23:23:13,178 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:23:13,178 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:23:13,178 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 23:23:13,178 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 23:23:13,179 INFO L791 eck$LassoCheckResult]: Stem: 36#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 32#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~ret12;test_fun_#in~x, test_fun_#in~y := main_#t~nondet10, main_#t~nondet11;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~mem7, test_fun_#t~mem6, test_fun_#t~mem8, test_fun_#t~mem5, test_fun_#t~mem9, test_fun_~x, test_fun_~y, 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_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;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_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.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(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 33#L555-3 [2019-11-15 23:23:13,179 INFO L793 eck$LassoCheckResult]: Loop: 33#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 37#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 34#L556-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 35#L556-1 assume !(test_fun_#t~mem6 > 0);havoc test_fun_#t~mem6; 38#L556-4 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem8 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem8; 33#L555-3 [2019-11-15 23:23:13,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:23:13,179 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-11-15 23:23:13,180 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:23:13,180 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627788977] [2019-11-15 23:23:13,180 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:23:13,180 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:23:13,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:23:13,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:23:13,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:23:13,231 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:23:13,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:23:13,231 INFO L82 PathProgramCache]: Analyzing trace with hash 35468273, now seen corresponding path program 1 times [2019-11-15 23:23:13,231 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:23:13,232 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429063181] [2019-11-15 23:23:13,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:23:13,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:23:13,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:23:13,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:23:13,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:23:13,249 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:23:13,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:23:13,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1806907759, now seen corresponding path program 1 times [2019-11-15 23:23:13,250 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:23:13,250 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008339758] [2019-11-15 23:23:13,250 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:23:13,250 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:23:13,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:23:13,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:23:13,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:23:13,319 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:23:13,935 WARN L191 SmtUtils]: Spent 510.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2019-11-15 23:23:14,119 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-11-15 23:23:14,134 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:23:14,135 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:23:14,136 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:23:14,137 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:23:14,137 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:23:14,137 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:23:14,145 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:23:14,146 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:23:14,146 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.16-alloca.i_Iteration2_Lasso [2019-11-15 23:23:14,147 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:23:14,147 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:23:14,181 INFO L141 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:23:14,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:23:14,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:23:14,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:23:14,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:23:14,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:23:14,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:23:14,623 WARN L191 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2019-11-15 23:23:14,751 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-11-15 23:23:14,752 INFO L141 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:23:14,755 INFO L141 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:23:14,759 INFO L141 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:23:14,762 INFO L141 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:23:14,772 INFO L141 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:23:14,775 INFO L141 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:23:14,779 INFO L141 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:23:14,945 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2019-11-15 23:23:15,683 WARN L191 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-11-15 23:23:15,748 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:23:15,753 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:23:15,755 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:23:15,757 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:23:15,757 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:23:15,758 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:23:15,758 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:23:15,758 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:23:15,760 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:23:15,760 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:23:15,762 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:23:15,763 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:23:15,763 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:23:15,764 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:23:15,764 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:23:15,764 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:23:15,764 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:23:15,765 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:23:15,765 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:23:15,766 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:23:15,766 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:23:15,767 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:23:15,767 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:23:15,767 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:23:15,767 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:23:15,768 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:23:15,768 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:23:15,768 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:23:15,769 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:23:15,770 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:23:15,770 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:23:15,771 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:23:15,771 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:23:15,771 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:23:15,771 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:23:15,772 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:23:15,772 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:23:15,773 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:23:15,773 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:23:15,774 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:23:15,774 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:23:15,774 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:23:15,774 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:23:15,775 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:23:15,775 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:23:15,775 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:23:15,776 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:23:15,776 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:23:15,777 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:23:15,777 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:23:15,777 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:23:15,778 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:23:15,780 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:23:15,780 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:23:15,783 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:23:15,784 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:23:15,784 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:23:15,785 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:23:15,785 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:23:15,785 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:23:15,787 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:23:15,787 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:23:15,791 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:23:15,792 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:23:15,793 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:23:15,793 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:23:15,793 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:23:15,793 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:23:15,795 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:23:15,795 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:23:15,800 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:23:15,800 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:23:15,801 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:23:15,801 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:23:15,801 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:23:15,801 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:23:15,803 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:23:15,803 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:23:15,807 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:23:15,808 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:23:15,809 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:23:15,809 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:23:15,809 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:23:15,809 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:23:15,811 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:23:15,811 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:23:15,814 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:23:15,814 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:23:15,815 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:23:15,815 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:23:15,816 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:23:15,816 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:23:15,822 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:23:15,822 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:23:15,858 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:23:15,858 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:23:15,859 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:23:15,860 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:23:15,860 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:23:15,860 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:23:15,862 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:23:15,862 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:23:15,881 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:23:15,897 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 23:23:15,898 INFO L444 ModelExtractionUtils]: 10 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-11-15 23:23:15,900 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:23:15,901 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:23:15,902 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:23:15,902 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) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 Supporting invariants [] [2019-11-15 23:23:15,958 INFO L297 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2019-11-15 23:23:15,963 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 23:23:15,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:23:16,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:23:16,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:23:16,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:23:16,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:23:16,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 23:23:16,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:23:16,059 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:23:16,061 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:23:16,062 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand 4 states. [2019-11-15 23:23:16,128 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2. Second operand 4 states. Result 21 states and 26 transitions. Complement of second has 8 states. [2019-11-15 23:23:16,130 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:23:16,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 23:23:16,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2019-11-15 23:23:16,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 2 letters. Loop has 5 letters. [2019-11-15 23:23:16,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:23:16,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 7 letters. Loop has 5 letters. [2019-11-15 23:23:16,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:23:16,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 2 letters. Loop has 10 letters. [2019-11-15 23:23:16,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:23:16,134 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 26 transitions. [2019-11-15 23:23:16,135 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-15 23:23:16,136 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 20 states and 25 transitions. [2019-11-15 23:23:16,136 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-15 23:23:16,136 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-15 23:23:16,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 25 transitions. [2019-11-15 23:23:16,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:23:16,136 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2019-11-15 23:23:16,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 25 transitions. [2019-11-15 23:23:16,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-11-15 23:23:16,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-15 23:23:16,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2019-11-15 23:23:16,139 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-11-15 23:23:16,139 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-11-15 23:23:16,139 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 23:23:16,139 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2019-11-15 23:23:16,140 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-15 23:23:16,140 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:23:16,140 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:23:16,140 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-15 23:23:16,140 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2019-11-15 23:23:16,141 INFO L791 eck$LassoCheckResult]: Stem: 194#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 188#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~ret12;test_fun_#in~x, test_fun_#in~y := main_#t~nondet10, main_#t~nondet11;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~mem7, test_fun_#t~mem6, test_fun_#t~mem8, test_fun_#t~mem5, test_fun_#t~mem9, test_fun_~x, test_fun_~y, 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_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;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_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.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(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 189#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 196#L555-1 [2019-11-15 23:23:16,141 INFO L793 eck$LassoCheckResult]: Loop: 196#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 190#L556-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 191#L556-1 assume !!(test_fun_#t~mem6 > 0);havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem7 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem7; 201#L556-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 203#L556-1 assume !(test_fun_#t~mem6 > 0);havoc test_fun_#t~mem6; 199#L556-4 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem8 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem8; 195#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 196#L555-1 [2019-11-15 23:23:16,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:23:16,141 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2019-11-15 23:23:16,141 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:23:16,141 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025411462] [2019-11-15 23:23:16,142 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:23:16,142 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:23:16,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:23:16,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:23:16,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:23:16,187 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:23:16,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:23:16,188 INFO L82 PathProgramCache]: Analyzing trace with hash 15492128, now seen corresponding path program 1 times [2019-11-15 23:23:16,188 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:23:16,188 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036469757] [2019-11-15 23:23:16,189 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:23:16,189 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:23:16,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:23:16,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:23:16,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:23:16,223 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:23:16,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:23:16,224 INFO L82 PathProgramCache]: Analyzing trace with hash 765526557, now seen corresponding path program 1 times [2019-11-15 23:23:16,224 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:23:16,224 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854189884] [2019-11-15 23:23:16,224 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:23:16,225 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:23:16,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:23:16,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:23:16,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:23:16,264 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:23:16,729 WARN L191 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 92 [2019-11-15 23:23:16,894 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-11-15 23:23:16,897 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:23:16,897 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:23:16,898 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:23:16,898 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:23:16,898 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:23:16,898 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:23:16,898 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:23:16,898 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:23:16,898 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.16-alloca.i_Iteration3_Lasso [2019-11-15 23:23:16,898 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:23:16,899 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:23:16,903 INFO L141 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:23:16,907 INFO L141 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:23:16,912 INFO L141 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:23:16,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:23:16,917 INFO L141 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:23:16,919 INFO L141 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:23:16,921 INFO L141 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:23:16,923 INFO L141 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:23:16,925 INFO L141 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:23:16,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:23:16,931 INFO L141 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:23:17,253 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 75 [2019-11-15 23:23:17,382 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-11-15 23:23:17,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:23:17,383 INFO L141 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:23:17,385 INFO L141 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:23:18,004 WARN L191 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-11-15 23:23:18,156 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:23:18,157 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:23:18,157 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:23:18,158 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:23:18,158 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:23:18,159 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:23:18,159 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:23:18,159 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:23:18,160 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:23:18,160 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:23:18,161 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:23:18,161 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:23:18,162 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:23:18,162 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:23:18,162 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:23:18,162 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:23:18,163 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:23:18,163 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:23:18,163 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:23:18,164 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:23:18,165 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:23:18,165 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:23:18,165 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:23:18,166 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:23:18,166 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:23:18,166 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:23:18,167 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:23:18,167 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:23:18,167 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:23:18,168 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:23:18,168 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:23:18,169 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:23:18,169 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:23:18,169 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:23:18,170 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:23:18,170 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:23:18,172 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:23:18,173 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:23:18,173 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:23:18,173 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:23:18,174 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:23:18,174 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:23:18,175 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:23:18,175 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:23:18,178 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:23:18,178 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:23:18,179 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:23:18,179 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:23:18,179 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:23:18,180 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:23:18,180 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:23:18,180 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:23:18,180 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:23:18,181 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:23:18,182 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:23:18,182 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:23:18,182 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:23:18,183 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:23:18,183 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:23:18,183 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:23:18,183 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:23:18,184 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:23:18,184 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:23:18,185 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:23:18,185 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:23:18,186 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:23:18,186 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:23:18,186 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:23:18,187 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:23:18,187 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:23:18,189 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:23:18,190 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:23:18,190 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:23:18,190 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:23:18,191 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:23:18,191 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:23:18,192 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:23:18,192 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:23:18,194 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:23:18,194 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:23:18,195 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:23:18,195 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:23:18,196 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:23:18,196 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:23:18,197 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:23:18,197 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:23:18,199 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:23:18,200 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:23:18,200 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:23:18,201 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:23:18,201 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:23:18,201 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:23:18,202 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:23:18,202 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:23:18,205 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:23:18,205 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:23:18,206 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:23:18,206 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:23:18,206 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:23:18,207 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:23:18,208 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:23:18,208 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:23:18,215 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:23:18,215 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:23:18,216 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:23:18,216 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:23:18,217 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:23:18,217 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:23:18,218 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:23:18,218 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:23:18,220 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:23:18,220 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:23:18,221 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:23:18,221 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:23:18,221 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:23:18,222 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:23:18,223 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:23:18,223 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:23:18,225 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:23:18,226 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:23:18,227 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:23:18,227 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:23:18,227 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:23:18,227 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:23:18,229 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:23:18,229 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:23:18,234 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:23:18,235 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:23:18,235 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:23:18,236 INFO L202 nArgumentSynthesizer]: 8 stem disjuncts [2019-11-15 23:23:18,236 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:23:18,236 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:23:18,241 INFO L400 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-11-15 23:23:18,241 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:23:18,270 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:23:18,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:23:18,272 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:23:18,272 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:23:18,272 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:23:18,272 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:23:18,273 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:23:18,274 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:23:18,279 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:23:18,279 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:23:18,280 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:23:18,280 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:23:18,281 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:23:18,281 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:23:18,282 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:23:18,283 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:23:18,293 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:23:18,302 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 23:23:18,302 INFO L444 ModelExtractionUtils]: 10 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-11-15 23:23:18,303 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:23:18,304 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:23:18,304 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:23:18,304 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2 Supporting invariants [] [2019-11-15 23:23:18,392 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2019-11-15 23:23:18,405 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 23:23:18,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:23:18,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:23:18,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:23:18,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:23:18,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:23:18,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:23:18,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:23:18,524 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 32 treesize of output 16 [2019-11-15 23:23:18,525 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:23:18,532 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:23:18,532 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:23:18,532 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:17 [2019-11-15 23:23:18,592 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:23:18,592 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 63 [2019-11-15 23:23:18,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:23:18,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:23:18,599 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:23:18,676 INFO L567 ElimStorePlain]: treesize reduction 48, result has 52.0 percent of original size [2019-11-15 23:23:18,677 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-15 23:23:18,678 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:45 [2019-11-15 23:23:20,863 WARN L191 SmtUtils]: Spent 1.06 s on a formula simplification that was a NOOP. DAG size: 25 [2019-11-15 23:23:20,864 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:23:20,864 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:23:20,864 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 7 Second operand 6 states. [2019-11-15 23:23:20,895 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 7. Second operand 6 states. Result 37 states and 46 transitions. Complement of second has 6 states. [2019-11-15 23:23:20,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 23:23:20,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-15 23:23:20,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-11-15 23:23:20,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 7 letters. [2019-11-15 23:23:20,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:23:20,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 10 letters. Loop has 7 letters. [2019-11-15 23:23:20,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:23:20,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 14 letters. [2019-11-15 23:23:20,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:23:20,899 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 46 transitions. [2019-11-15 23:23:20,901 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:23:20,901 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 0 states and 0 transitions. [2019-11-15 23:23:20,901 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 23:23:20,901 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 23:23:20,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 23:23:20,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:23:20,901 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:23:20,901 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:23:20,902 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:23:20,902 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 23:23:20,902 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:23:20,902 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:23:20,902 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 23:23:20,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 11:23:20 BoogieIcfgContainer [2019-11-15 23:23:20,911 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 23:23:20,911 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:23:20,911 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:23:20,911 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:23:20,912 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:23:12" (3/4) ... [2019-11-15 23:23:20,915 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 23:23:20,916 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:23:20,917 INFO L168 Benchmark]: Toolchain (without parser) took 9221.90 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 296.7 MB). Free memory was 935.7 MB in the beginning and 1.2 GB in the end (delta: -264.8 MB). Peak memory consumption was 32.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:23:20,918 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:23:20,920 INFO L168 Benchmark]: CACSL2BoogieTranslator took 630.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 935.7 MB in the beginning and 1.1 GB in the end (delta: -203.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-11-15 23:23:20,921 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.62 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:23:20,921 INFO L168 Benchmark]: Boogie Preprocessor took 28.94 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:23:20,922 INFO L168 Benchmark]: RCFGBuilder took 378.96 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: 21.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:23:20,928 INFO L168 Benchmark]: BuchiAutomizer took 8130.34 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 140.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -89.6 MB). Peak memory consumption was 50.9 MB. Max. memory is 11.5 GB. [2019-11-15 23:23:20,928 INFO L168 Benchmark]: Witness Printer took 4.69 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:23:20,931 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 630.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 935.7 MB in the beginning and 1.1 GB in the end (delta: -203.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.62 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.94 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 378.96 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: 21.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8130.34 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 140.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -89.6 MB). Peak memory consumption was 50.9 MB. Max. memory is 11.5 GB. * Witness Printer took 4.69 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 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 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 5 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 2 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.0s and 4 iterations. TraceHistogramMax:2. Analysis of lassos took 5.2s. Construction of modules took 0.0s. Büchi inclusion checks took 2.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 19 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/2 HoareTripleCheckerStatistics: 20 SDtfs, 10 SDslu, 5 SDs, 0 SdLazy, 30 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital291 mio100 ax106 hnf100 lsp91 ukn62 mio100 lsp32 div100 bol100 ite100 ukn100 eq188 hnf88 smp98 dnf364 smp91 tf100 neg92 sie127 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 35ms VariablesStem: 7 VariablesLoop: 6 DisjunctsStem: 8 DisjunctsLoop: 1 SupportingInvariants: 2 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...