./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.01-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_33edcafa-6688-4127-8db9-50fb875f803f/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_33edcafa-6688-4127-8db9-50fb875f803f/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_33edcafa-6688-4127-8db9-50fb875f803f/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_33edcafa-6688-4127-8db9-50fb875f803f/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.01-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_33edcafa-6688-4127-8db9-50fb875f803f/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_33edcafa-6688-4127-8db9-50fb875f803f/bin-2019/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 db71d1710cedf453bf2260811ea52ff2239c8a78 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 00:28:32,772 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 00:28:32,773 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 00:28:32,784 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 00:28:32,784 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 00:28:32,785 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 00:28:32,786 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 00:28:32,788 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 00:28:32,789 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 00:28:32,790 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 00:28:32,791 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 00:28:32,791 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 00:28:32,792 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 00:28:32,794 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 00:28:32,795 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 00:28:32,796 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 00:28:32,797 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 00:28:32,799 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 00:28:32,801 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 00:28:32,803 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 00:28:32,804 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 00:28:32,805 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 00:28:32,807 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 00:28:32,807 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 00:28:32,807 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 00:28:32,808 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 00:28:32,810 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 00:28:32,810 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 00:28:32,811 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 00:28:32,812 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 00:28:32,812 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 00:28:32,814 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 00:28:32,814 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 00:28:32,814 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 00:28:32,815 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 00:28:32,816 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 00:28:32,816 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_33edcafa-6688-4127-8db9-50fb875f803f/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 00:28:32,830 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 00:28:32,830 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 00:28:32,831 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 00:28:32,831 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 00:28:32,832 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 00:28:32,832 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 00:28:32,832 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 00:28:32,832 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 00:28:32,832 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 00:28:32,833 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 00:28:32,833 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 00:28:32,834 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 00:28:32,835 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 00:28:32,835 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 00:28:32,835 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 00:28:32,835 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 00:28:32,835 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 00:28:32,835 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 00:28:32,836 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 00:28:32,836 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 00:28:32,836 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 00:28:32,836 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 00:28:32,837 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 00:28:32,837 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 00:28:32,837 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 00:28:32,837 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 00:28:32,837 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 00:28:32,838 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 00:28:32,838 INFO L133 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/working_dir_33edcafa-6688-4127-8db9-50fb875f803f/bin-2019/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 -> db71d1710cedf453bf2260811ea52ff2239c8a78 [2018-11-10 00:28:32,869 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 00:28:32,881 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 00:28:32,884 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 00:28:32,886 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 00:28:32,886 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 00:28:32,887 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_33edcafa-6688-4127-8db9-50fb875f803f/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/b.01-alloca_true-termination_true-no-overflow.c.i [2018-11-10 00:28:32,945 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_33edcafa-6688-4127-8db9-50fb875f803f/bin-2019/uautomizer/data/9c776bf8e/b4d1f0919aaf4e079adc8d8b8b9b6328/FLAGc07eed4a7 [2018-11-10 00:28:33,358 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 00:28:33,359 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_33edcafa-6688-4127-8db9-50fb875f803f/sv-benchmarks/c/termination-memory-alloca/b.01-alloca_true-termination_true-no-overflow.c.i [2018-11-10 00:28:33,372 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_33edcafa-6688-4127-8db9-50fb875f803f/bin-2019/uautomizer/data/9c776bf8e/b4d1f0919aaf4e079adc8d8b8b9b6328/FLAGc07eed4a7 [2018-11-10 00:28:33,384 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_33edcafa-6688-4127-8db9-50fb875f803f/bin-2019/uautomizer/data/9c776bf8e/b4d1f0919aaf4e079adc8d8b8b9b6328 [2018-11-10 00:28:33,387 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 00:28:33,388 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 00:28:33,388 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 00:28:33,389 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 00:28:33,391 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 00:28:33,392 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:28:33" (1/1) ... [2018-11-10 00:28:33,394 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a8e72be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:28:33, skipping insertion in model container [2018-11-10 00:28:33,394 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:28:33" (1/1) ... [2018-11-10 00:28:33,402 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 00:28:33,436 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 00:28:33,667 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 00:28:33,675 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 00:28:33,709 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 00:28:33,741 INFO L193 MainTranslator]: Completed translation [2018-11-10 00:28:33,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:28:33 WrapperNode [2018-11-10 00:28:33,741 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 00:28:33,742 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 00:28:33,742 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 00:28:33,743 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 00:28:33,749 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:28:33" (1/1) ... [2018-11-10 00:28:33,814 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:28:33" (1/1) ... [2018-11-10 00:28:33,831 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 00:28:33,832 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 00:28:33,832 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 00:28:33,832 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 00:28:33,839 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:28:33" (1/1) ... [2018-11-10 00:28:33,839 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:28:33" (1/1) ... [2018-11-10 00:28:33,841 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:28:33" (1/1) ... [2018-11-10 00:28:33,841 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:28:33" (1/1) ... [2018-11-10 00:28:33,844 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:28:33" (1/1) ... [2018-11-10 00:28:33,848 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:28:33" (1/1) ... [2018-11-10 00:28:33,849 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:28:33" (1/1) ... [2018-11-10 00:28:33,851 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 00:28:33,851 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 00:28:33,851 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 00:28:33,851 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 00:28:33,852 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:28:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_33edcafa-6688-4127-8db9-50fb875f803f/bin-2019/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 [2018-11-10 00:28:33,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 00:28:33,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 00:28:33,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 00:28:33,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 00:28:34,076 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 00:28:34,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:28:34 BoogieIcfgContainer [2018-11-10 00:28:34,076 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 00:28:34,077 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 00:28:34,077 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 00:28:34,080 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 00:28:34,080 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 00:28:34,081 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 12:28:33" (1/3) ... [2018-11-10 00:28:34,082 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a57dbc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:28:34, skipping insertion in model container [2018-11-10 00:28:34,082 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 00:28:34,082 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:28:33" (2/3) ... [2018-11-10 00:28:34,083 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a57dbc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:28:34, skipping insertion in model container [2018-11-10 00:28:34,083 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 00:28:34,083 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:28:34" (3/3) ... [2018-11-10 00:28:34,085 INFO L375 chiAutomizerObserver]: Analyzing ICFG b.01-alloca_true-termination_true-no-overflow.c.i [2018-11-10 00:28:34,141 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 00:28:34,142 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 00:28:34,142 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 00:28:34,142 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 00:28:34,142 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 00:28:34,142 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 00:28:34,142 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 00:28:34,142 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 00:28:34,143 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 00:28:34,155 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-10 00:28:34,175 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 00:28:34,175 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 00:28:34,175 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 00:28:34,181 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 00:28:34,181 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:28:34,181 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 00:28:34,182 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-10 00:28:34,183 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 00:28:34,183 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 00:28:34,183 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 00:28:34,183 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 00:28:34,184 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:28:34,190 INFO L793 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet9, main_#t~nondet10, main_#t~ret11;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet9, main_#t~nondet10;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~mem5, test_fun_#t~mem6, test_fun_#t~mem8, 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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 14#L552true SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 15#L552-1true SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 11#L553true SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 16#L555-4true [2018-11-10 00:28:34,191 INFO L795 eck$LassoCheckResult]: Loop: 16#L555-4true assume true; 6#L555true SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 8#L555-1true SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 12#L555-2true assume !!(test_fun_#t~mem5 > test_fun_#t~mem6);havoc test_fun_#t~mem6;havoc test_fun_#t~mem5; 5#L556true SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 7#L556-1true SUMMARY for call write~int(test_fun_#t~mem7 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556-1 9#L556-2true havoc test_fun_#t~mem7; 16#L555-4true [2018-11-10 00:28:34,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:28:34,197 INFO L82 PathProgramCache]: Analyzing trace with hash 28691745, now seen corresponding path program 1 times [2018-11-10 00:28:34,198 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:28:34,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:28:34,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:28:34,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:28:34,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:28:34,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:28:34,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:28:34,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:28:34,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1466936139, now seen corresponding path program 1 times [2018-11-10 00:28:34,339 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:28:34,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:28:34,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:28:34,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:28:34,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:28:34,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:28:34,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:28:34,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:28:34,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1026480683, now seen corresponding path program 1 times [2018-11-10 00:28:34,362 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:28:34,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:28:34,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:28:34,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:28:34,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:28:34,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:28:34,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:28:34,886 WARN L179 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 95 [2018-11-10 00:28:35,013 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2018-11-10 00:28:35,026 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 00:28:35,028 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 00:28:35,028 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 00:28:35,028 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 00:28:35,028 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 00:28:35,029 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 00:28:35,029 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 00:28:35,029 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 00:28:35,029 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.01-alloca_true-termination_true-no-overflow.c.i_Iteration1_Lasso [2018-11-10 00:28:35,029 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 00:28:35,030 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 00:28:35,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:28:35,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:28:35,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:28:35,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:28:35,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:28:35,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:28:35,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:28:35,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:28:35,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:28:35,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:28:35,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:28:35,486 WARN L179 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 95 [2018-11-10 00:28:35,605 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2018-11-10 00:28:35,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:28:35,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:28:36,080 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 00:28:36,084 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 00:28:36,086 INFO L122 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 [2018-11-10 00:28:36,087 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:28:36,088 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:28:36,088 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:28:36,088 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:28:36,088 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:28:36,090 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:28:36,091 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:28:36,094 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:28:36,094 INFO L122 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 [2018-11-10 00:28:36,098 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:28:36,098 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:28:36,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:28:36,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:28:36,098 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:28:36,099 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:28:36,099 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:28:36,100 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:28:36,100 INFO L122 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 [2018-11-10 00:28:36,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:28:36,101 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:28:36,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:28:36,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:28:36,102 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:28:36,102 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:28:36,102 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:28:36,103 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:28:36,104 INFO L122 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 [2018-11-10 00:28:36,104 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:28:36,105 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:28:36,105 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:28:36,105 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:28:36,108 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 00:28:36,108 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 00:28:36,113 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:28:36,113 INFO L122 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 [2018-11-10 00:28:36,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:28:36,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:28:36,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:28:36,114 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:28:36,116 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 00:28:36,116 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 00:28:36,123 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:28:36,124 INFO L122 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 [2018-11-10 00:28:36,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:28:36,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:28:36,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:28:36,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:28:36,126 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 00:28:36,127 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 00:28:36,131 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:28:36,131 INFO L122 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 [2018-11-10 00:28:36,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:28:36,132 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:28:36,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:28:36,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:28:36,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:28:36,133 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:28:36,133 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:28:36,134 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:28:36,134 INFO L122 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 [2018-11-10 00:28:36,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:28:36,135 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:28:36,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:28:36,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:28:36,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:28:36,136 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:28:36,136 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:28:36,137 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:28:36,138 INFO L122 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 [2018-11-10 00:28:36,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:28:36,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:28:36,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:28:36,139 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:28:36,140 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 00:28:36,141 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 00:28:36,144 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:28:36,145 INFO L122 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 [2018-11-10 00:28:36,145 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:28:36,145 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:28:36,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:28:36,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:28:36,146 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:28:36,146 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:28:36,147 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:28:36,147 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:28:36,148 INFO L122 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 [2018-11-10 00:28:36,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:28:36,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:28:36,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:28:36,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:28:36,151 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 00:28:36,151 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 00:28:36,154 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:28:36,154 INFO L122 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 [2018-11-10 00:28:36,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:28:36,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:28:36,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:28:36,156 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:28:36,159 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 00:28:36,159 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 00:28:36,180 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:28:36,181 INFO L122 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 [2018-11-10 00:28:36,182 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:28:36,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:28:36,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:28:36,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:28:36,184 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 00:28:36,184 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 00:28:36,188 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:28:36,189 INFO L122 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 [2018-11-10 00:28:36,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:28:36,190 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 00:28:36,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:28:36,190 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:28:36,192 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 00:28:36,192 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 00:28:36,202 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:28:36,202 INFO L122 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 [2018-11-10 00:28:36,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:28:36,203 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:28:36,203 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:28:36,203 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:28:36,205 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 00:28:36,205 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 00:28:36,209 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:28:36,209 INFO L122 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 [2018-11-10 00:28:36,210 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:28:36,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:28:36,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:28:36,211 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:28:36,218 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 00:28:36,218 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 00:28:36,253 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:28:36,254 INFO L122 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 [2018-11-10 00:28:36,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:28:36,254 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 00:28:36,255 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:28:36,255 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:28:36,257 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 00:28:36,257 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 00:28:36,265 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:28:36,265 INFO L122 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 [2018-11-10 00:28:36,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:28:36,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:28:36,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:28:36,266 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:28:36,268 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 00:28:36,268 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 00:28:36,271 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:28:36,272 INFO L122 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 [2018-11-10 00:28:36,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:28:36,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:28:36,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:28:36,273 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:28:36,274 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 00:28:36,274 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 00:28:36,277 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:28:36,277 INFO L122 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 [2018-11-10 00:28:36,278 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:28:36,278 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:28:36,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:28:36,278 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:28:36,283 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 00:28:36,283 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 00:28:36,299 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 00:28:36,312 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 00:28:36,313 INFO L444 ModelExtractionUtils]: 24 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 00:28:36,315 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 00:28:36,317 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 00:28:36,317 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 00:28:36,318 INFO L519 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, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_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 - 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1 Supporting invariants [] [2018-11-10 00:28:36,403 INFO L297 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2018-11-10 00:28:36,410 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 00:28:36,410 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 00:28:36,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:28:36,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:28:36,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:28:36,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:28:36,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:28:36,574 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 00:28:36,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 59 [2018-11-10 00:28:36,618 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 00:28:36,619 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 00:28:36,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 52 [2018-11-10 00:28:36,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 00:28:36,670 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 00:28:36,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2018-11-10 00:28:36,672 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 00:28:36,692 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 00:28:36,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 00:28:36,713 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:47, output treesize:50 [2018-11-10 00:28:36,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:28:36,750 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-10 00:28:36,751 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 8 states. [2018-11-10 00:28:36,823 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 8 states. Result 38 states and 40 transitions. Complement of second has 13 states. [2018-11-10 00:28:36,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-10 00:28:36,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 00:28:36,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 26 transitions. [2018-11-10 00:28:36,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 26 transitions. Stem has 5 letters. Loop has 7 letters. [2018-11-10 00:28:36,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 00:28:36,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 26 transitions. Stem has 12 letters. Loop has 7 letters. [2018-11-10 00:28:36,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 00:28:36,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 26 transitions. Stem has 5 letters. Loop has 14 letters. [2018-11-10 00:28:36,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 00:28:36,831 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 40 transitions. [2018-11-10 00:28:36,833 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 00:28:36,835 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 0 states and 0 transitions. [2018-11-10 00:28:36,836 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 00:28:36,836 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 00:28:36,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 00:28:36,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 00:28:36,837 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 00:28:36,837 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 00:28:36,837 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 00:28:36,837 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 00:28:36,837 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 00:28:36,838 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 00:28:36,838 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 00:28:36,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 12:28:36 BoogieIcfgContainer [2018-11-10 00:28:36,842 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 00:28:36,843 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 00:28:36,843 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 00:28:36,843 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 00:28:36,844 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:28:34" (3/4) ... [2018-11-10 00:28:36,847 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 00:28:36,847 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 00:28:36,848 INFO L168 Benchmark]: Toolchain (without parser) took 3460.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 957.6 MB in the beginning and 961.9 MB in the end (delta: -4.3 MB). Peak memory consumption was 135.7 MB. Max. memory is 11.5 GB. [2018-11-10 00:28:36,849 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 00:28:36,849 INFO L168 Benchmark]: CACSL2BoogieTranslator took 353.37 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 936.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 00:28:36,850 INFO L168 Benchmark]: Boogie Procedure Inliner took 89.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 936.2 MB in the beginning and 1.1 GB in the end (delta: -200.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-11-10 00:28:36,851 INFO L168 Benchmark]: Boogie Preprocessor took 19.22 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 00:28:36,851 INFO L168 Benchmark]: RCFGBuilder took 225.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2018-11-10 00:28:36,852 INFO L168 Benchmark]: BuchiAutomizer took 2765.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 961.9 MB in the end (delta: 149.8 MB). Peak memory consumption was 149.8 MB. Max. memory is 11.5 GB. [2018-11-10 00:28:36,853 INFO L168 Benchmark]: Witness Printer took 4.33 ms. Allocated memory is still 1.2 GB. Free memory is still 961.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 00:28:36,856 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 353.37 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 936.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 89.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 936.2 MB in the beginning and 1.1 GB in the end (delta: -200.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.22 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 225.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2765.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 961.9 MB in the end (delta: 149.8 MB). Peak memory consumption was 149.8 MB. Max. memory is 11.5 GB. * Witness Printer took 4.33 ms. Allocated memory is still 1.2 GB. Free memory is still 961.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #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 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] + -1 * unknown-#memory_int-unknown[y_ref][y_ref] and consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.7s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 2.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 11 SDtfs, 12 SDslu, 23 SDs, 0 SdLazy, 28 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital249 mio100 ax107 hnf100 lsp91 ukn83 mio100 lsp36 div100 bol100 ite100 ukn100 eq206 hnf87 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 12ms VariablesStem: 3 VariablesLoop: 0 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...