./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c6901c34-1fda-4763-83d6-ab78954f5825/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c6901c34-1fda-4763-83d6-ab78954f5825/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c6901c34-1fda-4763-83d6-ab78954f5825/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c6901c34-1fda-4763-83d6-ab78954f5825/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c6901c34-1fda-4763-83d6-ab78954f5825/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c6901c34-1fda-4763-83d6-ab78954f5825/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 30ab881e1a71a9d76a9921c34ce47cc9425d2331 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 13:57:49,745 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 13:57:49,747 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 13:57:49,757 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 13:57:49,759 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 13:57:49,760 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 13:57:49,763 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 13:57:49,764 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 13:57:49,765 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 13:57:49,766 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 13:57:49,767 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 13:57:49,767 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 13:57:49,768 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 13:57:49,769 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 13:57:49,769 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 13:57:49,770 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 13:57:49,771 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 13:57:49,772 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 13:57:49,773 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 13:57:49,775 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 13:57:49,776 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 13:57:49,777 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 13:57:49,778 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 13:57:49,779 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 13:57:49,779 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 13:57:49,780 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 13:57:49,780 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 13:57:49,781 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 13:57:49,781 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 13:57:49,782 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 13:57:49,783 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 13:57:49,784 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 13:57:49,784 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 13:57:49,784 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 13:57:49,785 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 13:57:49,785 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 13:57:49,785 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c6901c34-1fda-4763-83d6-ab78954f5825/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-18 13:57:49,797 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 13:57:49,797 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 13:57:49,798 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 13:57:49,798 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 13:57:49,799 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 13:57:49,799 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 13:57:49,799 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 13:57:49,799 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 13:57:49,799 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 13:57:49,799 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 13:57:49,800 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 13:57:49,800 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 13:57:49,800 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 13:57:49,800 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 13:57:49,800 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 13:57:49,800 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 13:57:49,800 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 13:57:49,801 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 13:57:49,801 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 13:57:49,801 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 13:57:49,801 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 13:57:49,801 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 13:57:49,802 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 13:57:49,803 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 13:57:49,803 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 13:57:49,803 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 13:57:49,803 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 13:57:49,803 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 13:57:49,804 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 13:57:49,804 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_c6901c34-1fda-4763-83d6-ab78954f5825/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 -> 30ab881e1a71a9d76a9921c34ce47cc9425d2331 [2018-11-18 13:57:49,830 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 13:57:49,844 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 13:57:49,847 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 13:57:49,848 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 13:57:49,848 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 13:57:49,848 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c6901c34-1fda-4763-83d6-ab78954f5825/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i [2018-11-18 13:57:49,894 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c6901c34-1fda-4763-83d6-ab78954f5825/bin-2019/uautomizer/data/0986c7152/f98b2f104fe947d19151e5a06c59e582/FLAGbcbc30ff8 [2018-11-18 13:57:50,317 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 13:57:50,318 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c6901c34-1fda-4763-83d6-ab78954f5825/sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i [2018-11-18 13:57:50,326 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c6901c34-1fda-4763-83d6-ab78954f5825/bin-2019/uautomizer/data/0986c7152/f98b2f104fe947d19151e5a06c59e582/FLAGbcbc30ff8 [2018-11-18 13:57:50,335 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c6901c34-1fda-4763-83d6-ab78954f5825/bin-2019/uautomizer/data/0986c7152/f98b2f104fe947d19151e5a06c59e582 [2018-11-18 13:57:50,337 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 13:57:50,338 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 13:57:50,338 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 13:57:50,338 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 13:57:50,341 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 13:57:50,341 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:57:50" (1/1) ... [2018-11-18 13:57:50,343 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fb2fd35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:57:50, skipping insertion in model container [2018-11-18 13:57:50,343 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:57:50" (1/1) ... [2018-11-18 13:57:50,350 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 13:57:50,378 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 13:57:50,596 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:57:50,604 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 13:57:50,637 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:57:50,725 INFO L195 MainTranslator]: Completed translation [2018-11-18 13:57:50,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:57:50 WrapperNode [2018-11-18 13:57:50,726 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 13:57:50,727 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 13:57:50,727 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 13:57:50,727 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 13:57:50,734 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:57:50" (1/1) ... [2018-11-18 13:57:50,747 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:57:50" (1/1) ... [2018-11-18 13:57:50,763 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 13:57:50,763 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 13:57:50,763 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 13:57:50,763 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 13:57:50,771 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:57:50" (1/1) ... [2018-11-18 13:57:50,771 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:57:50" (1/1) ... [2018-11-18 13:57:50,773 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:57:50" (1/1) ... [2018-11-18 13:57:50,773 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:57:50" (1/1) ... [2018-11-18 13:57:50,776 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:57:50" (1/1) ... [2018-11-18 13:57:50,781 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:57:50" (1/1) ... [2018-11-18 13:57:50,782 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:57:50" (1/1) ... [2018-11-18 13:57:50,784 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 13:57:50,784 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 13:57:50,784 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 13:57:50,784 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 13:57:50,785 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:57:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c6901c34-1fda-4763-83d6-ab78954f5825/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-18 13:57:50,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 13:57:50,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 13:57:50,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 13:57:50,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 13:57:50,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 13:57:50,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 13:57:51,031 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 13:57:51,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:57:51 BoogieIcfgContainer [2018-11-18 13:57:51,032 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 13:57:51,032 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 13:57:51,032 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 13:57:51,035 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 13:57:51,036 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 13:57:51,036 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 01:57:50" (1/3) ... [2018-11-18 13:57:51,037 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5302051f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 01:57:51, skipping insertion in model container [2018-11-18 13:57:51,038 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 13:57:51,038 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:57:50" (2/3) ... [2018-11-18 13:57:51,038 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5302051f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 01:57:51, skipping insertion in model container [2018-11-18 13:57:51,038 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 13:57:51,038 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:57:51" (3/3) ... [2018-11-18 13:57:51,040 INFO L375 chiAutomizerObserver]: Analyzing ICFG CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i [2018-11-18 13:57:51,089 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 13:57:51,090 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 13:57:51,090 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 13:57:51,090 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 13:57:51,090 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 13:57:51,091 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 13:57:51,091 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 13:57:51,091 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 13:57:51,091 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 13:57:51,104 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2018-11-18 13:57:51,126 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 13:57:51,127 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:57:51,127 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:57:51,132 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 13:57:51,133 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 13:57:51,133 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 13:57:51,133 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2018-11-18 13:57:51,134 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 13:57:51,134 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:57:51,134 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:57:51,134 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 13:57:51,134 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 13:57:51,141 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet7, main_#t~mem8, main_#t~nondet9, main_#t~mem10, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 12#L551-2true [2018-11-18 13:57:51,141 INFO L796 eck$LassoCheckResult]: Loop: 12#L551-2true assume true; 13#L550-1true call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := main_#t~mem4 > 0; 4#L550-2true assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 7#L550-4true assume !!main_#t~short6;havoc main_#t~mem5;havoc main_#t~mem4;havoc main_#t~short6; 8#L551true assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem8 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem8; 12#L551-2true [2018-11-18 13:57:51,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:57:51,146 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-18 13:57:51,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:57:51,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:57:51,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:57:51,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:57:51,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:57:51,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:57:51,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:57:51,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:57:51,244 INFO L82 PathProgramCache]: Analyzing trace with hash 34419787, now seen corresponding path program 1 times [2018-11-18 13:57:51,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:57:51,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:57:51,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:57:51,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:57:51,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:57:51,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:57:51,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:57:51,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:57:51,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1805859273, now seen corresponding path program 1 times [2018-11-18 13:57:51,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:57:51,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:57:51,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:57:51,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:57:51,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:57:51,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:57:51,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:57:51,553 WARN L180 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2018-11-18 13:57:51,771 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:57:51,772 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:57:51,772 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:57:51,772 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:57:51,772 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 13:57:51,772 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:57:51,772 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:57:51,773 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:57:51,773 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i_Iteration1_Lasso [2018-11-18 13:57:51,773 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:57:51,773 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:57:51,792 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-18 13:57:52,268 WARN L180 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2018-11-18 13:57:52,268 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-18 13:57:52,270 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-18 13:57:52,271 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-18 13:57:52,272 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-18 13:57:52,278 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-18 13:57:52,280 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-18 13:57:52,282 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-18 13:57:52,284 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-18 13:57:52,286 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-18 13:57:52,288 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-18 13:57:52,289 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-18 13:57:52,291 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-18 13:57:52,298 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-18 13:57:52,591 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:57:52,594 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 13:57:52,596 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-18 13:57:52,597 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:57:52,597 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:57:52,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:57:52,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:57:52,604 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:57:52,605 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:57:52,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:57:52,647 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-18 13:57:52,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:57:52,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:57:52,648 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:57:52,648 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:57:52,649 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:57:52,649 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:57:52,658 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:57:52,659 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-18 13:57:52,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:57:52,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:57:52,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:57:52,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:57:52,660 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:57:52,661 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:57:52,661 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:57:52,662 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 13:57:52,665 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 13:57:52,666 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 13:57:52,667 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 13:57:52,667 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 13:57:52,667 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 13:57:52,667 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 Supporting invariants [] [2018-11-18 13:57:52,707 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-11-18 13:57:52,711 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 13:57:52,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:57:52,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:57:52,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:57:52,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:57:52,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:57:52,823 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-18 13:57:52,833 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 [2018-11-18 13:57:52,834 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states. Second operand 5 states. [2018-11-18 13:57:52,952 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states.. Second operand 5 states. Result 43 states and 51 transitions. Complement of second has 10 states. [2018-11-18 13:57:52,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-18 13:57:52,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 13:57:52,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2018-11-18 13:57:52,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 2 letters. Loop has 5 letters. [2018-11-18 13:57:52,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:57:52,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 7 letters. Loop has 5 letters. [2018-11-18 13:57:52,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:57:52,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 2 letters. Loop has 10 letters. [2018-11-18 13:57:52,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:57:52,961 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 51 transitions. [2018-11-18 13:57:52,963 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 13:57:52,966 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 19 states and 25 transitions. [2018-11-18 13:57:52,967 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-18 13:57:52,967 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-18 13:57:52,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 25 transitions. [2018-11-18 13:57:52,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:57:52,968 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2018-11-18 13:57:52,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 25 transitions. [2018-11-18 13:57:52,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-11-18 13:57:52,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 13:57:52,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2018-11-18 13:57:52,993 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2018-11-18 13:57:52,993 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2018-11-18 13:57:52,993 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 13:57:52,993 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2018-11-18 13:57:52,994 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 13:57:52,994 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:57:52,994 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:57:52,994 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:57:52,994 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 13:57:52,995 INFO L794 eck$LassoCheckResult]: Stem: 157#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 155#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet7, main_#t~mem8, main_#t~nondet9, main_#t~mem10, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 156#L551-2 assume true; 166#L550-1 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := main_#t~mem4 > 0; 151#L550-2 assume !main_#t~short6; 152#L550-4 assume !!main_#t~short6;havoc main_#t~mem5;havoc main_#t~mem4;havoc main_#t~short6; 161#L551 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(main_#t~nondet9, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet9;call main_#t~mem10 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem10; 162#L551-2 [2018-11-18 13:57:52,995 INFO L796 eck$LassoCheckResult]: Loop: 162#L551-2 assume true; 164#L550-1 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := main_#t~mem4 > 0; 167#L550-2 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 158#L550-4 assume !!main_#t~short6;havoc main_#t~mem5;havoc main_#t~mem4;havoc main_#t~short6; 159#L551 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem8 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem8; 162#L551-2 [2018-11-18 13:57:52,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:57:52,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1805861197, now seen corresponding path program 1 times [2018-11-18 13:57:52,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:57:52,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:57:52,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:57:52,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:57:52,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:57:53,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:57:53,025 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-18 13:57:53,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:57:53,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:57:53,028 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 13:57:53,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:57:53,028 INFO L82 PathProgramCache]: Analyzing trace with hash 34419787, now seen corresponding path program 2 times [2018-11-18 13:57:53,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:57:53,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:57:53,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:57:53,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:57:53,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:57:53,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:57:53,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:57:53,167 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2018-11-18 13:57:53,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:57:53,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:57:53,186 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-11-18 13:57:53,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:57:53,195 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2018-11-18 13:57:53,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:57:53,197 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 23 transitions. [2018-11-18 13:57:53,197 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 13:57:53,198 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 17 states and 20 transitions. [2018-11-18 13:57:53,198 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-18 13:57:53,198 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-18 13:57:53,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 20 transitions. [2018-11-18 13:57:53,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:57:53,198 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-11-18 13:57:53,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 20 transitions. [2018-11-18 13:57:53,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-18 13:57:53,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 13:57:53,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2018-11-18 13:57:53,200 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-11-18 13:57:53,200 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-11-18 13:57:53,200 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 13:57:53,200 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2018-11-18 13:57:53,201 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 13:57:53,201 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:57:53,201 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:57:53,201 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:57:53,201 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 13:57:53,201 INFO L794 eck$LassoCheckResult]: Stem: 200#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 194#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet7, main_#t~mem8, main_#t~nondet9, main_#t~mem10, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 195#L551-2 assume true; 207#L550-1 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := main_#t~mem4 > 0; 196#L550-2 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 197#L550-4 assume !!main_#t~short6;havoc main_#t~mem5;havoc main_#t~mem4;havoc main_#t~short6; 201#L551 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(main_#t~nondet9, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet9;call main_#t~mem10 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem10; 203#L551-2 [2018-11-18 13:57:53,202 INFO L796 eck$LassoCheckResult]: Loop: 203#L551-2 assume true; 205#L550-1 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := main_#t~mem4 > 0; 210#L550-2 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 209#L550-4 assume !!main_#t~short6;havoc main_#t~mem5;havoc main_#t~mem4;havoc main_#t~short6; 208#L551 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem8 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem8; 203#L551-2 [2018-11-18 13:57:53,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:57:53,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1805859275, now seen corresponding path program 1 times [2018-11-18 13:57:53,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:57:53,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:57:53,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:57:53,207 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:57:53,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:57:53,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:57:53,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:57:53,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:57:53,224 INFO L82 PathProgramCache]: Analyzing trace with hash 34419787, now seen corresponding path program 3 times [2018-11-18 13:57:53,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:57:53,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:57:53,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:57:53,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:57:53,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:57:53,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:57:53,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:57:53,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:57:53,247 INFO L82 PathProgramCache]: Analyzing trace with hash 20482241, now seen corresponding path program 1 times [2018-11-18 13:57:53,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:57:53,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:57:53,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:57:53,249 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:57:53,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:57:53,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:57:53,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:57:53,478 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 72 [2018-11-18 13:57:53,520 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:57:53,521 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:57:53,521 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:57:53,521 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:57:53,521 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 13:57:53,521 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:57:53,521 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:57:53,521 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:57:53,521 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i_Iteration3_Lasso [2018-11-18 13:57:53,521 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:57:53,522 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:57:53,527 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-18 13:57:53,535 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-18 13:57:53,544 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-18 13:57:53,546 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-18 13:57:53,548 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-18 13:57:53,553 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-18 13:57:53,555 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-18 13:57:53,557 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-18 13:57:53,559 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-18 13:57:53,561 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-18 13:57:53,699 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2018-11-18 13:57:53,763 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-18 13:57:53,765 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-18 13:57:53,789 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-18 13:57:53,790 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-18 13:57:53,791 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-18 13:57:53,963 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2018-11-18 13:57:54,155 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:57:54,155 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 13:57:54,155 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-18 13:57:54,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:57:54,156 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:57:54,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:57:54,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:57:54,156 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:57:54,157 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:57:54,157 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:57:54,157 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:57:54,158 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-18 13:57:54,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:57:54,158 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:57:54,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:57:54,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:57:54,158 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:57:54,159 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:57:54,159 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:57:54,163 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:57:54,163 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-18 13:57:54,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:57:54,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:57:54,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:57:54,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:57:54,165 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:57:54,165 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:57:54,167 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:57:54,167 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-18 13:57:54,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:57:54,168 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:57:54,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:57:54,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:57:54,168 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:57:54,168 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:57:54,168 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:57:54,169 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:57:54,169 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-18 13:57:54,169 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:57:54,170 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:57:54,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:57:54,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:57:54,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:57:54,174 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:57:54,174 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:57:54,174 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:57:54,175 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-18 13:57:54,175 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:57:54,175 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:57:54,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:57:54,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:57:54,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:57:54,176 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:57:54,176 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:57:54,176 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:57:54,177 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-18 13:57:54,177 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:57:54,177 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:57:54,177 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:57:54,177 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:57:54,178 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:57:54,178 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:57:54,180 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:57:54,180 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-18 13:57:54,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:57:54,181 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:57:54,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:57:54,181 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 13:57:54,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:57:54,182 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:57:54,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:57:54,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:57:54,184 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-18 13:57:54,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:57:54,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:57:54,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:57:54,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:57:54,185 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:57:54,185 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:57:54,187 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:57:54,188 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-18 13:57:54,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:57:54,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:57:54,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:57:54,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:57:54,191 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:57:54,191 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:57:54,203 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:57:54,203 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-18 13:57:54,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:57:54,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:57:54,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:57:54,204 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:57:54,205 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:57:54,205 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:57:54,209 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:57:54,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-18 13:57:54,210 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:57:54,210 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 13:57:54,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:57:54,210 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:57:54,211 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 13:57:54,211 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:57:54,216 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:57:54,217 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-18 13:57:54,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:57:54,217 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:57:54,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:57:54,218 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:57:54,219 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:57:54,219 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:57:54,224 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:57:54,224 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-18 13:57:54,224 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:57:54,224 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 13:57:54,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:57:54,225 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:57:54,226 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 13:57:54,226 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:57:54,230 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:57:54,231 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-18 13:57:54,231 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:57:54,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:57:54,231 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:57:54,232 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:57:54,233 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:57:54,233 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:57:54,238 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:57:54,238 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-18 13:57:54,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:57:54,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:57:54,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:57:54,239 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:57:54,240 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:57:54,240 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:57:54,249 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 13:57:54,255 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 13:57:54,258 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 13:57:54,259 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 13:57:54,262 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 13:57:54,262 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 13:57:54,262 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2 Supporting invariants [] [2018-11-18 13:57:54,340 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-11-18 13:57:54,341 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 13:57:54,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:57:54,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:57:54,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:57:54,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:57:54,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:57:54,489 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-18 13:57:54,489 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 [2018-11-18 13:57:54,490 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 5 states. [2018-11-18 13:57:54,512 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 27 states and 32 transitions. Complement of second has 9 states. [2018-11-18 13:57:54,512 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 [2018-11-18 13:57:54,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 13:57:54,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2018-11-18 13:57:54,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 7 letters. Loop has 5 letters. [2018-11-18 13:57:54,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:57:54,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 12 letters. Loop has 5 letters. [2018-11-18 13:57:54,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:57:54,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 7 letters. Loop has 10 letters. [2018-11-18 13:57:54,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:57:54,514 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 32 transitions. [2018-11-18 13:57:54,515 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 13:57:54,515 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 32 transitions. [2018-11-18 13:57:54,515 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-18 13:57:54,515 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-18 13:57:54,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 32 transitions. [2018-11-18 13:57:54,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:57:54,515 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-11-18 13:57:54,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 32 transitions. [2018-11-18 13:57:54,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-18 13:57:54,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-18 13:57:54,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2018-11-18 13:57:54,517 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-11-18 13:57:54,517 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-11-18 13:57:54,517 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 13:57:54,518 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 32 transitions. [2018-11-18 13:57:54,518 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 13:57:54,518 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:57:54,518 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:57:54,519 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1] [2018-11-18 13:57:54,519 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 13:57:54,519 INFO L794 eck$LassoCheckResult]: Stem: 352#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 350#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet7, main_#t~mem8, main_#t~nondet9, main_#t~mem10, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 351#L551-2 assume true; 360#L550-1 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := main_#t~mem4 > 0; 346#L550-2 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 347#L550-4 assume !!main_#t~short6;havoc main_#t~mem5;havoc main_#t~mem4;havoc main_#t~short6; 353#L551 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(main_#t~nondet9, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet9;call main_#t~mem10 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem10; 355#L551-2 assume true; 367#L550-1 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := main_#t~mem4 > 0; 366#L550-2 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 364#L550-4 assume !!main_#t~short6;havoc main_#t~mem5;havoc main_#t~mem4;havoc main_#t~short6; 362#L551 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(main_#t~nondet9, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet9;call main_#t~mem10 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem10; 357#L551-2 [2018-11-18 13:57:54,519 INFO L796 eck$LassoCheckResult]: Loop: 357#L551-2 assume true; 358#L550-1 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := main_#t~mem4 > 0; 365#L550-2 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 363#L550-4 assume !!main_#t~short6;havoc main_#t~mem5;havoc main_#t~mem4;havoc main_#t~short6; 361#L551 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem8 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem8; 357#L551-2 [2018-11-18 13:57:54,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:57:54,519 INFO L82 PathProgramCache]: Analyzing trace with hash 20482243, now seen corresponding path program 2 times [2018-11-18 13:57:54,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:57:54,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:57:54,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:57:54,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:57:54,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:57:54,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:57:54,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:57:54,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:57:54,538 INFO L82 PathProgramCache]: Analyzing trace with hash 34419787, now seen corresponding path program 4 times [2018-11-18 13:57:54,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:57:54,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:57:54,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:57:54,540 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:57:54,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:57:54,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:57:54,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:57:54,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:57:54,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1643500745, now seen corresponding path program 2 times [2018-11-18 13:57:54,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:57:54,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:57:54,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:57:54,548 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:57:54,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:57:54,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:57:54,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:57:54,724 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2018-11-18 13:57:54,954 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 95 [2018-11-18 13:57:55,035 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:57:55,035 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:57:55,035 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:57:55,035 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:57:55,035 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 13:57:55,036 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:57:55,036 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:57:55,036 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:57:55,036 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i_Iteration4_Lasso [2018-11-18 13:57:55,036 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:57:55,036 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:57:55,038 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-18 13:57:55,040 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-18 13:57:55,042 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-18 13:57:55,047 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-18 13:57:55,049 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-18 13:57:55,050 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-18 13:57:55,051 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-18 13:57:55,053 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-18 13:57:55,054 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-18 13:57:55,055 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-18 13:57:55,061 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-18 13:57:55,062 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-18 13:57:55,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-18 13:57:55,066 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-18 13:57:55,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-18 13:57:55,468 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:57:55,468 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 13:57:55,468 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-18 13:57:55,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:57:55,469 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:57:55,469 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:57:55,469 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:57:55,469 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:57:55,469 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:57:55,469 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:57:55,470 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:57:55,470 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-18 13:57:55,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:57:55,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:57:55,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:57:55,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:57:55,477 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:57:55,477 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:57:55,478 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:57:55,478 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-18 13:57:55,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:57:55,479 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:57:55,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:57:55,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:57:55,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:57:55,479 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:57:55,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:57:55,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:57:55,480 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-18 13:57:55,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:57:55,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:57:55,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:57:55,481 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 13:57:55,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:57:55,481 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:57:55,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:57:55,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:57:55,488 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-18 13:57:55,489 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:57:55,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:57:55,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:57:55,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:57:55,490 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:57:55,490 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:57:55,491 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:57:55,492 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-18 13:57:55,492 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:57:55,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:57:55,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:57:55,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:57:55,493 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:57:55,493 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:57:55,494 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:57:55,494 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-18 13:57:55,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:57:55,500 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:57:55,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:57:55,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:57:55,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:57:55,500 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:57:55,501 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:57:55,501 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:57:55,501 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-18 13:57:55,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:57:55,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:57:55,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:57:55,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:57:55,503 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:57:55,503 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:57:55,510 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:57:55,510 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-18 13:57:55,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:57:55,512 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:57:55,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:57:55,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:57:55,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:57:55,513 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:57:55,513 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:57:55,514 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:57:55,514 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-18 13:57:55,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:57:55,514 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:57:55,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:57:55,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:57:55,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:57:55,515 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:57:55,515 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:57:55,515 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:57:55,516 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-18 13:57:55,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:57:55,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:57:55,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:57:55,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:57:55,516 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:57:55,516 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:57:55,517 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:57:55,517 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:57:55,517 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-18 13:57:55,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:57:55,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:57:55,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:57:55,518 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:57:55,528 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:57:55,528 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:57:55,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:57:55,530 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-18 13:57:55,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:57:55,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:57:55,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:57:55,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:57:55,531 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:57:55,531 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:57:55,532 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:57:55,533 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-18 13:57:55,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:57:55,533 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:57:55,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:57:55,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:57:55,533 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:57:55,533 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:57:55,534 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:57:55,534 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:57:55,534 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-18 13:57:55,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:57:55,541 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 13:57:55,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:57:55,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:57:55,542 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 13:57:55,542 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:57:55,548 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:57:55,548 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-18 13:57:55,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:57:55,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:57:55,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:57:55,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:57:55,550 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:57:55,550 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:57:55,553 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:57:55,554 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-18 13:57:55,554 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:57:55,554 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:57:55,554 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:57:55,554 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:57:55,561 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:57:55,561 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:57:55,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:57:55,565 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-18 13:57:55,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:57:55,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:57:55,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:57:55,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:57:55,566 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:57:55,566 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:57:55,569 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:57:55,570 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-18 13:57:55,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:57:55,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:57:55,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:57:55,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:57:55,571 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:57:55,571 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:57:55,572 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:57:55,572 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-18 13:57:55,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:57:55,573 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 13:57:55,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:57:55,573 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:57:55,573 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 13:57:55,573 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:57:55,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:57:55,576 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-18 13:57:55,577 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:57:55,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:57:55,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:57:55,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:57:55,578 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:57:55,578 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:57:55,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:57:55,585 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-18 13:57:55,585 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:57:55,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:57:55,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:57:55,586 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:57:55,586 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:57:55,587 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:57:55,588 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:57:55,588 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-18 13:57:55,588 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:57:55,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:57:55,588 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:57:55,589 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:57:55,589 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:57:55,589 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:57:55,594 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 13:57:55,596 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 13:57:55,596 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 13:57:55,597 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 13:57:55,597 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 13:57:55,598 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 13:57:55,598 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3 Supporting invariants [] [2018-11-18 13:57:55,659 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-11-18 13:57:55,671 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 13:57:55,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:57:55,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:57:55,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:57:55,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:57:55,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:57:55,908 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-18 13:57:55,908 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 [2018-11-18 13:57:55,909 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 32 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-11-18 13:57:55,939 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 32 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 35 states and 42 transitions. Complement of second has 9 states. [2018-11-18 13:57:55,940 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 [2018-11-18 13:57:55,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 13:57:55,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2018-11-18 13:57:55,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 12 letters. Loop has 5 letters. [2018-11-18 13:57:55,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:57:55,941 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 13:57:55,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:57:55,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:57:55,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:57:56,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:57:56,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:57:56,119 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-18 13:57:56,119 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-18 13:57:56,120 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 32 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-11-18 13:57:56,246 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 32 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 35 states and 42 transitions. Complement of second has 9 states. [2018-11-18 13:57:56,246 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 [2018-11-18 13:57:56,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 13:57:56,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2018-11-18 13:57:56,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 12 letters. Loop has 5 letters. [2018-11-18 13:57:56,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:57:56,247 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 13:57:56,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:57:56,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:57:56,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:57:56,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:57:56,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:57:56,327 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-18 13:57:56,328 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-18 13:57:56,328 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 32 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-11-18 13:57:56,349 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 32 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 40 states and 48 transitions. Complement of second has 8 states. [2018-11-18 13:57:56,349 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 [2018-11-18 13:57:56,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 13:57:56,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2018-11-18 13:57:56,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 12 letters. Loop has 5 letters. [2018-11-18 13:57:56,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:57:56,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 17 letters. Loop has 5 letters. [2018-11-18 13:57:56,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:57:56,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 12 letters. Loop has 10 letters. [2018-11-18 13:57:56,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:57:56,351 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 48 transitions. [2018-11-18 13:57:56,352 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-18 13:57:56,353 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 32 states and 38 transitions. [2018-11-18 13:57:56,353 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-18 13:57:56,353 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-18 13:57:56,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 38 transitions. [2018-11-18 13:57:56,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:57:56,353 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2018-11-18 13:57:56,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 38 transitions. [2018-11-18 13:57:56,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 12. [2018-11-18 13:57:56,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 13:57:56,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2018-11-18 13:57:56,355 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2018-11-18 13:57:56,355 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2018-11-18 13:57:56,355 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 13:57:56,355 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 14 transitions. [2018-11-18 13:57:56,355 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-18 13:57:56,355 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:57:56,356 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:57:56,356 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 13:57:56,356 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 13:57:56,356 INFO L794 eck$LassoCheckResult]: Stem: 739#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 737#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet7, main_#t~mem8, main_#t~nondet9, main_#t~mem10, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 738#L551-2 [2018-11-18 13:57:56,356 INFO L796 eck$LassoCheckResult]: Loop: 738#L551-2 assume true; 744#L550-1 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := main_#t~mem4 > 0; 733#L550-2 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 734#L550-4 assume !!main_#t~short6;havoc main_#t~mem5;havoc main_#t~mem4;havoc main_#t~short6; 740#L551 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(main_#t~nondet9, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet9;call main_#t~mem10 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem10; 738#L551-2 [2018-11-18 13:57:56,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:57:56,356 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-18 13:57:56,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:57:56,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:57:56,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:57:56,358 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:57:56,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:57:56,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:57:56,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:57:56,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:57:56,362 INFO L82 PathProgramCache]: Analyzing trace with hash 34419789, now seen corresponding path program 1 times [2018-11-18 13:57:56,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:57:56,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:57:56,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:57:56,363 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:57:56,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:57:56,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:57:56,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:57:56,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:57:56,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1805859275, now seen corresponding path program 3 times [2018-11-18 13:57:56,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:57:56,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:57:56,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:57:56,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:57:56,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:57:56,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:57:56,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:57:56,635 WARN L180 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2018-11-18 13:57:56,730 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:57:56,731 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:57:56,731 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:57:56,731 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:57:56,731 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 13:57:56,731 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:57:56,731 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:57:56,731 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:57:56,731 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i_Iteration5_Lasso [2018-11-18 13:57:56,731 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:57:56,731 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:57:56,733 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-18 13:57:56,737 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-18 13:57:56,739 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-18 13:57:56,741 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-18 13:57:56,742 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-18 13:57:56,743 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-18 13:57:56,745 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-18 13:57:56,883 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-18 13:57:56,884 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-18 13:57:56,886 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-18 13:57:56,887 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-18 13:57:56,888 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-18 13:57:56,890 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-18 13:57:57,086 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:57:57,086 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 13:57:57,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-18 13:57:57,086 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:57:57,087 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:57:57,087 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:57:57,087 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:57:57,087 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:57:57,087 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:57:57,087 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:57:57,088 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:57:57,088 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-18 13:57:57,088 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:57:57,088 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:57:57,088 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:57:57,089 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:57:57,089 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:57:57,089 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:57:57,090 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:57:57,090 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-18 13:57:57,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:57:57,091 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:57:57,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:57:57,091 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:57:57,091 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:57:57,091 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:57:57,092 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:57:57,092 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-18 13:57:57,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:57:57,093 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:57:57,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:57:57,093 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:57:57,093 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:57:57,093 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:57:57,093 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:57:57,094 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:57:57,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-18 13:57:57,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:57:57,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:57:57,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:57:57,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:57:57,095 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:57:57,095 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:57:57,096 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:57:57,096 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-18 13:57:57,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:57:57,096 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:57:57,096 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:57:57,096 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:57:57,097 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:57:57,097 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:57:57,097 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:57:57,097 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:57:57,098 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-18 13:57:57,098 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:57:57,098 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 13:57:57,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:57:57,098 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:57:57,099 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 13:57:57,099 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:57:57,101 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:57:57,102 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-18 13:57:57,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:57:57,102 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 13:57:57,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:57:57,102 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:57:57,104 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 13:57:57,104 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:57:57,106 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:57:57,107 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-18 13:57:57,107 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:57:57,107 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:57:57,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:57:57,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:57:57,108 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:57:57,108 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:57:57,108 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:57:57,109 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:57:57,109 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-18 13:57:57,109 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:57:57,110 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:57:57,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:57:57,110 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:57:57,113 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:57:57,113 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:57:57,121 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:57:57,121 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-18 13:57:57,122 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:57:57,122 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:57:57,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:57:57,122 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:57:57,122 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:57:57,122 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:57:57,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:57:57,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-18 13:57:57,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:57:57,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:57:57,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:57:57,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:57:57,126 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:57:57,126 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:57:57,128 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:57:57,129 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-18 13:57:57,129 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:57:57,129 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:57:57,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:57:57,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:57:57,129 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:57:57,130 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:57:57,130 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:57:57,137 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 13:57:57,138 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 13:57:57,138 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 13:57:57,139 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 13:57:57,139 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 13:57:57,139 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 13:57:57,139 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_4) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_4 Supporting invariants [] [2018-11-18 13:57:57,287 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2018-11-18 13:57:57,288 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 13:57:57,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:57:57,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:57:57,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:57:57,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:57:57,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:57:57,390 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-18 13:57:57,390 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 [2018-11-18 13:57:57,390 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 14 transitions. cyclomatic complexity: 3 Second operand 5 states. [2018-11-18 13:57:57,432 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 14 transitions. cyclomatic complexity: 3. Second operand 5 states. Result 34 states and 41 transitions. Complement of second has 8 states. [2018-11-18 13:57:57,432 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 [2018-11-18 13:57:57,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 13:57:57,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2018-11-18 13:57:57,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 2 letters. Loop has 5 letters. [2018-11-18 13:57:57,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:57:57,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 7 letters. Loop has 5 letters. [2018-11-18 13:57:57,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:57:57,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 2 letters. Loop has 10 letters. [2018-11-18 13:57:57,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:57:57,434 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 41 transitions. [2018-11-18 13:57:57,434 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 13:57:57,434 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 0 states and 0 transitions. [2018-11-18 13:57:57,435 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 13:57:57,435 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 13:57:57,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 13:57:57,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:57:57,435 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 13:57:57,435 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 13:57:57,435 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 13:57:57,435 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 13:57:57,435 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 13:57:57,435 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 13:57:57,435 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 13:57:57,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 01:57:57 BoogieIcfgContainer [2018-11-18 13:57:57,440 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 13:57:57,441 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 13:57:57,441 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 13:57:57,441 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 13:57:57,441 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:57:51" (3/4) ... [2018-11-18 13:57:57,445 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 13:57:57,445 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 13:57:57,445 INFO L168 Benchmark]: Toolchain (without parser) took 7108.25 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 282.1 MB). Free memory was 957.1 MB in the beginning and 1.2 GB in the end (delta: -198.9 MB). Peak memory consumption was 83.2 MB. Max. memory is 11.5 GB. [2018-11-18 13:57:57,446 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:57:57,446 INFO L168 Benchmark]: CACSL2BoogieTranslator took 388.05 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.5 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -141.0 MB). Peak memory consumption was 30.0 MB. Max. memory is 11.5 GB. [2018-11-18 13:57:57,447 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.30 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-11-18 13:57:57,447 INFO L168 Benchmark]: Boogie Preprocessor took 20.62 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:57:57,448 INFO L168 Benchmark]: RCFGBuilder took 247.82 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2018-11-18 13:57:57,448 INFO L168 Benchmark]: BuchiAutomizer took 6408.27 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 173.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -88.1 MB). Peak memory consumption was 85.5 MB. Max. memory is 11.5 GB. [2018-11-18 13:57:57,449 INFO L168 Benchmark]: Witness Printer took 3.96 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. [2018-11-18 13:57:57,452 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 388.05 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.5 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -141.0 MB). Peak memory consumption was 30.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.30 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.62 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 247.82 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6408.27 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 173.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -88.1 MB). Peak memory consumption was 85.5 MB. Max. memory is 11.5 GB. * Witness Printer took 3.96 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 - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (1 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 5 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 5 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.3s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 4.9s. Construction of modules took 0.2s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 22 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 27 states and ocurred in iteration 3. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 62 SDtfs, 65 SDslu, 29 SDs, 0 SdLazy, 71 SolverSat, 32 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital246 mio100 ax109 hnf100 lsp86 ukn60 mio100 lsp42 div100 bol100 ite100 ukn100 eq186 hnf88 smp99 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 2 VariablesLoop: 2 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...