./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/Ben-Amram-2010LMCS-Ex2.3-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_7a0ef7f7-bea6-41e5-8a26-0f9e4b3eb5ff/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7a0ef7f7-bea6-41e5-8a26-0f9e4b3eb5ff/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7a0ef7f7-bea6-41e5-8a26-0f9e4b3eb5ff/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7a0ef7f7-bea6-41e5-8a26-0f9e4b3eb5ff/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/Ben-Amram-2010LMCS-Ex2.3-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_7a0ef7f7-bea6-41e5-8a26-0f9e4b3eb5ff/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7a0ef7f7-bea6-41e5-8a26-0f9e4b3eb5ff/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 4ab4fc7901859c456c176827e7d5fcf9e4988b17 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 09:19:02,845 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 09:19:02,846 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 09:19:02,855 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 09:19:02,855 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 09:19:02,856 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 09:19:02,856 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 09:19:02,858 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 09:19:02,859 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 09:19:02,859 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 09:19:02,860 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 09:19:02,860 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 09:19:02,861 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 09:19:02,862 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 09:19:02,863 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 09:19:02,863 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 09:19:02,864 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 09:19:02,865 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 09:19:02,866 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 09:19:02,868 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 09:19:02,868 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 09:19:02,869 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 09:19:02,871 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 09:19:02,871 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 09:19:02,871 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 09:19:02,872 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 09:19:02,873 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 09:19:02,874 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 09:19:02,874 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 09:19:02,875 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 09:19:02,875 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 09:19:02,876 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 09:19:02,876 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 09:19:02,876 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 09:19:02,877 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 09:19:02,877 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 09:19:02,877 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7a0ef7f7-bea6-41e5-8a26-0f9e4b3eb5ff/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-18 09:19:02,886 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 09:19:02,886 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 09:19:02,887 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 09:19:02,887 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 09:19:02,887 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 09:19:02,888 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 09:19:02,888 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 09:19:02,888 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 09:19:02,888 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 09:19:02,888 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 09:19:02,888 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 09:19:02,889 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 09:19:02,889 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 09:19:02,889 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 09:19:02,889 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 09:19:02,889 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 09:19:02,889 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 09:19:02,889 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 09:19:02,890 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 09:19:02,890 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 09:19:02,890 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 09:19:02,890 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 09:19:02,890 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 09:19:02,890 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 09:19:02,891 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 09:19:02,891 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 09:19:02,891 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 09:19:02,891 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 09:19:02,892 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 09:19:02,892 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_7a0ef7f7-bea6-41e5-8a26-0f9e4b3eb5ff/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 -> 4ab4fc7901859c456c176827e7d5fcf9e4988b17 [2018-11-18 09:19:02,912 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 09:19:02,922 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 09:19:02,925 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 09:19:02,926 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 09:19:02,927 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 09:19:02,927 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7a0ef7f7-bea6-41e5-8a26-0f9e4b3eb5ff/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/Ben-Amram-2010LMCS-Ex2.3-alloca_true-termination.c.i [2018-11-18 09:19:02,977 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7a0ef7f7-bea6-41e5-8a26-0f9e4b3eb5ff/bin-2019/uautomizer/data/0cfc2b601/2cd7849a5166417192e70923ef6a7637/FLAG66704298a [2018-11-18 09:19:03,362 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 09:19:03,362 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7a0ef7f7-bea6-41e5-8a26-0f9e4b3eb5ff/sv-benchmarks/c/termination-memory-alloca/Ben-Amram-2010LMCS-Ex2.3-alloca_true-termination.c.i [2018-11-18 09:19:03,372 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7a0ef7f7-bea6-41e5-8a26-0f9e4b3eb5ff/bin-2019/uautomizer/data/0cfc2b601/2cd7849a5166417192e70923ef6a7637/FLAG66704298a [2018-11-18 09:19:03,743 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7a0ef7f7-bea6-41e5-8a26-0f9e4b3eb5ff/bin-2019/uautomizer/data/0cfc2b601/2cd7849a5166417192e70923ef6a7637 [2018-11-18 09:19:03,746 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 09:19:03,747 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 09:19:03,748 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 09:19:03,748 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 09:19:03,751 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 09:19:03,752 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:19:03" (1/1) ... [2018-11-18 09:19:03,754 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4aa731d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:19:03, skipping insertion in model container [2018-11-18 09:19:03,754 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:19:03" (1/1) ... [2018-11-18 09:19:03,763 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 09:19:03,794 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 09:19:03,992 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:19:04,001 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 09:19:04,025 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:19:04,104 INFO L195 MainTranslator]: Completed translation [2018-11-18 09:19:04,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:19:04 WrapperNode [2018-11-18 09:19:04,105 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 09:19:04,105 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 09:19:04,105 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 09:19:04,106 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 09:19:04,113 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:19:04" (1/1) ... [2018-11-18 09:19:04,122 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:19:04" (1/1) ... [2018-11-18 09:19:04,136 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 09:19:04,136 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 09:19:04,136 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 09:19:04,137 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 09:19:04,143 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:19:04" (1/1) ... [2018-11-18 09:19:04,143 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:19:04" (1/1) ... [2018-11-18 09:19:04,146 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:19:04" (1/1) ... [2018-11-18 09:19:04,146 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:19:04" (1/1) ... [2018-11-18 09:19:04,149 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:19:04" (1/1) ... [2018-11-18 09:19:04,153 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:19:04" (1/1) ... [2018-11-18 09:19:04,154 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:19:04" (1/1) ... [2018-11-18 09:19:04,156 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 09:19:04,157 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 09:19:04,157 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 09:19:04,157 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 09:19:04,157 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:19:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7a0ef7f7-bea6-41e5-8a26-0f9e4b3eb5ff/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 09:19:04,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 09:19:04,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 09:19:04,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 09:19:04,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 09:19:04,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 09:19:04,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 09:19:04,372 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 09:19:04,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:19:04 BoogieIcfgContainer [2018-11-18 09:19:04,372 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 09:19:04,373 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 09:19:04,373 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 09:19:04,376 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 09:19:04,376 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 09:19:04,377 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 09:19:03" (1/3) ... [2018-11-18 09:19:04,377 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@59bbe13b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 09:19:04, skipping insertion in model container [2018-11-18 09:19:04,378 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 09:19:04,378 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:19:04" (2/3) ... [2018-11-18 09:19:04,378 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@59bbe13b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 09:19:04, skipping insertion in model container [2018-11-18 09:19:04,378 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 09:19:04,378 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:19:04" (3/3) ... [2018-11-18 09:19:04,380 INFO L375 chiAutomizerObserver]: Analyzing ICFG Ben-Amram-2010LMCS-Ex2.3-alloca_true-termination.c.i [2018-11-18 09:19:04,426 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 09:19:04,427 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 09:19:04,427 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 09:19:04,427 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 09:19:04,427 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 09:19:04,427 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 09:19:04,427 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 09:19:04,428 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 09:19:04,428 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 09:19:04,442 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-18 09:19:04,458 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 09:19:04,458 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:19:04,458 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:19:04,463 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 09:19:04,463 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:19:04,463 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 09:19:04,463 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-18 09:19:04,464 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 09:19:04,464 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:19:04,464 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:19:04,464 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 09:19:04,465 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:19:04,470 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#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~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~mem17, main_#t~mem18, main_#t~nondet19, main_#t~mem20, main_#t~mem8, main_#t~mem9, main_#t~short10, main_#t~mem11, main_#t~short12, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~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;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6;call write~int(main_#t~nondet7, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet7; 8#L555-2true [2018-11-18 09:19:04,471 INFO L796 eck$LassoCheckResult]: Loop: 8#L555-2true assume true; 9#L554-1true call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 11#L554-2true assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 13#L554-4true main_#t~short12 := main_#t~short10; 15#L554-5true assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 3#L554-7true assume !!main_#t~short12;havoc main_#t~short12;havoc main_#t~mem8;havoc main_#t~mem11;havoc main_#t~mem9;havoc main_#t~short10;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 5#L555true assume main_#t~mem13 > main_#t~mem14;havoc main_#t~mem13;havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem17; 8#L555-2true [2018-11-18 09:19:04,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:19:04,477 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-18 09:19:04,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:19:04,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:19:04,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:19:04,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:19:04,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:19:04,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:19:04,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:19:04,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:19:04,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1282445234, now seen corresponding path program 1 times [2018-11-18 09:19:04,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:19:04,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:19:04,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:19:04,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:19:04,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:19:04,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:19:04,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:19:04,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:19:04,615 INFO L82 PathProgramCache]: Analyzing trace with hash 263851596, now seen corresponding path program 1 times [2018-11-18 09:19:04,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:19:04,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:19:04,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:19:04,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:19:04,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:19:04,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:19:04,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:19:04,900 WARN L180 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2018-11-18 09:19:05,144 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 77 [2018-11-18 09:19:05,229 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 09:19:05,230 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 09:19:05,230 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 09:19:05,230 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 09:19:05,230 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 09:19:05,230 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:19:05,230 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 09:19:05,231 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 09:19:05,231 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ben-Amram-2010LMCS-Ex2.3-alloca_true-termination.c.i_Iteration1_Lasso [2018-11-18 09:19:05,231 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 09:19:05,231 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 09:19:05,255 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 09:19:05,265 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 09:19:05,267 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 09:19:05,269 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 09:19:05,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 09:19:05,275 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 09:19:05,277 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 09:19:05,279 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 09:19:05,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 09:19:05,285 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 09:19:05,287 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 09:19:05,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 09:19:05,508 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2018-11-18 09:19:05,591 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 09:19:05,593 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 09:19:05,594 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 09:19:05,596 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 09:19:05,597 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 09:19:05,599 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 09:19:05,600 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 09:19:05,601 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 09:19:05,603 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 09:19:05,605 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 09:19:05,947 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 09:19:05,952 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 09:19:05,953 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 09:19:05,955 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:19:05,955 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:19:05,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:19:05,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:19:05,956 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:19:05,957 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:19:05,957 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:19:05,959 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:19:05,960 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 09:19:05,960 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:19:05,960 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:19:05,960 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:19:05,961 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:19:05,961 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:19:05,964 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:19:05,964 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:19:05,964 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:19:05,965 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 09:19:05,965 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:19:05,965 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:19:05,965 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:19:05,965 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:19:05,966 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:19:05,968 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:19:05,968 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:19:05,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:19:05,969 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 09:19:05,970 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:19:05,970 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:19:05,970 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:19:05,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:19:05,970 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:19:05,971 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:19:05,971 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:19:05,972 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:19:05,972 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 09:19:05,972 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:19:05,972 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:19:05,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:19:05,973 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:19:05,973 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:19:05,973 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:19:05,973 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:19:05,974 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:19:05,975 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 09:19:05,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:19:05,979 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:19:05,979 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:19:05,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:19:05,980 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:19:05,980 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:19:05,980 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:19:05,981 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:19:05,981 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 09:19:05,982 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:19:05,982 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:19:05,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:19:05,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:19:05,982 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:19:05,983 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:19:05,983 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:19:05,983 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:19:05,984 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 09:19:05,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:19:05,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:19:05,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:19:05,985 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:19:05,986 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:19:05,987 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:19:05,990 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:19:05,990 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 09:19:05,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:19:05,991 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:19:05,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:19:05,991 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:19:05,991 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:19:05,993 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:19:05,993 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:19:05,994 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:19:05,994 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 09:19:05,995 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:19:05,995 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:19:05,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:19:05,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:19:05,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:19:05,996 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:19:05,996 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:19:05,999 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:19:05,999 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 09:19:06,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:19:06,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:19:06,000 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:19:06,000 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:19:06,001 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:19:06,002 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:19:06,007 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:19:06,007 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 09:19:06,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:19:06,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:19:06,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:19:06,008 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:19:06,015 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:19:06,015 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:19:06,042 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:19:06,042 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 09:19:06,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:19:06,043 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 09:19:06,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:19:06,043 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:19:06,046 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:19:06,046 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:19:06,052 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:19:06,053 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 09:19:06,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:19:06,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:19:06,054 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:19:06,054 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:19:06,055 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:19:06,057 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:19:06,063 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:19:06,063 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 09:19:06,064 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:19:06,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:19:06,064 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:19:06,064 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:19:06,065 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:19:06,065 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:19:06,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:19:06,073 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 09:19:06,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:19:06,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:19:06,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:19:06,074 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:19:06,075 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:19:06,075 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:19:06,077 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:19:06,077 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 09:19:06,078 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:19:06,078 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 09:19:06,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:19:06,078 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:19:06,081 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:19:06,081 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:19:06,086 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:19:06,087 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 09:19:06,088 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:19:06,089 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:19:06,089 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:19:06,089 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:19:06,090 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:19:06,091 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:19:06,096 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:19:06,097 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 09:19:06,097 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:19:06,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:19:06,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:19:06,098 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:19:06,099 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:19:06,099 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:19:06,100 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:19:06,101 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 09:19:06,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:19:06,101 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 09:19:06,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:19:06,101 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:19:06,103 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:19:06,103 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:19:06,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:19:06,112 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 09:19:06,112 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:19:06,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:19:06,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:19:06,113 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:19:06,116 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:19:06,116 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:19:06,133 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 09:19:06,144 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 09:19:06,144 INFO L444 ModelExtractionUtils]: 11 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 09:19:06,146 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 09:19:06,147 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 09:19:06,147 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 09:19:06,148 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, v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_1) = -1*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_~z~0.base) ULTIMATE.start_main_~z~0.offset)_1 + 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_1 Supporting invariants [] [2018-11-18 09:19:06,275 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-18 09:19:06,282 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 09:19:06,283 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 09:19:06,284 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 09:19:06,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:19:06,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:19:06,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:19:06,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:19:06,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:19:06,400 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 09:19:06,410 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 09:19:06,411 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states. Second operand 5 states. [2018-11-18 09:19:06,491 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states.. Second operand 5 states. Result 39 states and 50 transitions. Complement of second has 10 states. [2018-11-18 09:19:06,491 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 09:19:06,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 09:19:06,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2018-11-18 09:19:06,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 2 letters. Loop has 7 letters. [2018-11-18 09:19:06,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:19:06,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 9 letters. Loop has 7 letters. [2018-11-18 09:19:06,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:19:06,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 2 letters. Loop has 14 letters. [2018-11-18 09:19:06,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:19:06,498 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 50 transitions. [2018-11-18 09:19:06,500 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 09:19:06,504 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 23 states and 32 transitions. [2018-11-18 09:19:06,505 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-18 09:19:06,505 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-18 09:19:06,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 32 transitions. [2018-11-18 09:19:06,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:19:06,506 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2018-11-18 09:19:06,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 32 transitions. [2018-11-18 09:19:06,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-18 09:19:06,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-18 09:19:06,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 32 transitions. [2018-11-18 09:19:06,526 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2018-11-18 09:19:06,527 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2018-11-18 09:19:06,527 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 09:19:06,527 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 32 transitions. [2018-11-18 09:19:06,527 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 09:19:06,528 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:19:06,528 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:19:06,528 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:19:06,528 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:19:06,528 INFO L794 eck$LassoCheckResult]: Stem: 225#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 212#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~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~mem17, main_#t~mem18, main_#t~nondet19, main_#t~mem20, main_#t~mem8, main_#t~mem9, main_#t~short10, main_#t~mem11, main_#t~short12, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~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;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6;call write~int(main_#t~nondet7, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet7; 213#L555-2 assume true; 218#L554-1 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 234#L554-2 assume !main_#t~short10; 233#L554-4 main_#t~short12 := main_#t~short10; 232#L554-5 assume !main_#t~short12; 221#L554-7 assume !!main_#t~short12;havoc main_#t~short12;havoc main_#t~mem8;havoc main_#t~mem11;havoc main_#t~mem9;havoc main_#t~short10;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 222#L555 assume !(main_#t~mem13 > main_#t~mem14);havoc main_#t~mem13;havoc main_#t~mem14;call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;call write~int(main_#t~nondet19, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet19;call main_#t~mem20 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem20; 214#L555-2 [2018-11-18 09:19:06,528 INFO L796 eck$LassoCheckResult]: Loop: 214#L555-2 assume true; 215#L554-1 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 219#L554-2 assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 226#L554-4 main_#t~short12 := main_#t~short10; 228#L554-5 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 230#L554-7 assume !!main_#t~short12;havoc main_#t~short12;havoc main_#t~mem8;havoc main_#t~mem11;havoc main_#t~mem9;havoc main_#t~short10;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 231#L555 assume main_#t~mem13 > main_#t~mem14;havoc main_#t~mem13;havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem17; 214#L555-2 [2018-11-18 09:19:06,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:19:06,529 INFO L82 PathProgramCache]: Analyzing trace with hash 265700562, now seen corresponding path program 1 times [2018-11-18 09:19:06,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:19:06,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:19:06,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:19:06,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:19:06,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:19:06,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:19:06,572 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 09:19:06,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:19:06,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 09:19:06,576 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 09:19:06,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:19:06,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1282445234, now seen corresponding path program 2 times [2018-11-18 09:19:06,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:19:06,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:19:06,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:19:06,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:19:06,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:19:06,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:19:06,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:19:06,768 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2018-11-18 09:19:06,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 09:19:06,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:19:06,821 INFO L87 Difference]: Start difference. First operand 23 states and 32 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-18 09:19:06,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:19:06,848 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-11-18 09:19:06,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 09:19:06,849 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 38 transitions. [2018-11-18 09:19:06,850 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 09:19:06,851 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 23 states and 26 transitions. [2018-11-18 09:19:06,851 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-18 09:19:06,851 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-18 09:19:06,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 26 transitions. [2018-11-18 09:19:06,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:19:06,851 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-11-18 09:19:06,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 26 transitions. [2018-11-18 09:19:06,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-18 09:19:06,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-18 09:19:06,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2018-11-18 09:19:06,853 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-11-18 09:19:06,853 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-11-18 09:19:06,853 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 09:19:06,853 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 26 transitions. [2018-11-18 09:19:06,854 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 09:19:06,854 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:19:06,854 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:19:06,854 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:19:06,855 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:19:06,855 INFO L794 eck$LassoCheckResult]: Stem: 292#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 279#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~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~mem17, main_#t~mem18, main_#t~nondet19, main_#t~mem20, main_#t~mem8, main_#t~mem9, main_#t~short10, main_#t~mem11, main_#t~short12, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~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;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6;call write~int(main_#t~nondet7, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet7; 280#L555-2 assume true; 285#L554-1 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 301#L554-2 assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 300#L554-4 main_#t~short12 := main_#t~short10; 299#L554-5 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 288#L554-7 assume !!main_#t~short12;havoc main_#t~short12;havoc main_#t~mem8;havoc main_#t~mem11;havoc main_#t~mem9;havoc main_#t~short10;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 289#L555 assume !(main_#t~mem13 > main_#t~mem14);havoc main_#t~mem13;havoc main_#t~mem14;call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;call write~int(main_#t~nondet19, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet19;call main_#t~mem20 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem20; 281#L555-2 [2018-11-18 09:19:06,855 INFO L796 eck$LassoCheckResult]: Loop: 281#L555-2 assume true; 282#L554-1 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 286#L554-2 assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 293#L554-4 main_#t~short12 := main_#t~short10; 295#L554-5 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 297#L554-7 assume !!main_#t~short12;havoc main_#t~short12;havoc main_#t~mem8;havoc main_#t~mem11;havoc main_#t~mem9;havoc main_#t~short10;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 298#L555 assume main_#t~mem13 > main_#t~mem14;havoc main_#t~mem13;havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem17; 281#L555-2 [2018-11-18 09:19:06,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:19:06,855 INFO L82 PathProgramCache]: Analyzing trace with hash 263851598, now seen corresponding path program 1 times [2018-11-18 09:19:06,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:19:06,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:19:06,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:19:06,856 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:19:06,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:19:06,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:19:06,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:19:06,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:19:06,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1282445234, now seen corresponding path program 3 times [2018-11-18 09:19:06,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:19:06,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:19:06,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:19:06,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:19:06,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:19:06,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:19:06,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:19:06,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:19:06,899 INFO L82 PathProgramCache]: Analyzing trace with hash -305913503, now seen corresponding path program 1 times [2018-11-18 09:19:06,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:19:06,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:19:06,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:19:06,901 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:19:06,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:19:06,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:19:06,996 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:19:06,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:19:06,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 09:19:07,204 WARN L180 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2018-11-18 09:19:07,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 09:19:07,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-18 09:19:07,258 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. cyclomatic complexity: 5 Second operand 6 states. [2018-11-18 09:19:07,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:19:07,319 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2018-11-18 09:19:07,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 09:19:07,320 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 25 transitions. [2018-11-18 09:19:07,321 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 09:19:07,322 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 25 transitions. [2018-11-18 09:19:07,322 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-18 09:19:07,322 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-18 09:19:07,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 25 transitions. [2018-11-18 09:19:07,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:19:07,322 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-18 09:19:07,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 25 transitions. [2018-11-18 09:19:07,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 17. [2018-11-18 09:19:07,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 09:19:07,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-11-18 09:19:07,324 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-11-18 09:19:07,324 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-11-18 09:19:07,324 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 09:19:07,324 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2018-11-18 09:19:07,324 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 09:19:07,325 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:19:07,325 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:19:07,325 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-18 09:19:07,325 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:19:07,325 INFO L794 eck$LassoCheckResult]: Stem: 350#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 338#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~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~mem17, main_#t~mem18, main_#t~nondet19, main_#t~mem20, main_#t~mem8, main_#t~mem9, main_#t~short10, main_#t~mem11, main_#t~short12, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~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;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6;call write~int(main_#t~nondet7, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet7; 339#L555-2 assume true; 341#L554-1 [2018-11-18 09:19:07,325 INFO L796 eck$LassoCheckResult]: Loop: 341#L554-1 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 344#L554-2 assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 351#L554-4 main_#t~short12 := main_#t~short10; 353#L554-5 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 346#L554-7 assume !!main_#t~short12;havoc main_#t~short12;havoc main_#t~mem8;havoc main_#t~mem11;havoc main_#t~mem9;havoc main_#t~short10;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 347#L555 assume !(main_#t~mem13 > main_#t~mem14);havoc main_#t~mem13;havoc main_#t~mem14;call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;call write~int(main_#t~nondet19, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet19;call main_#t~mem20 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem20; 340#L555-2 assume true; 341#L554-1 [2018-11-18 09:19:07,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:19:07,326 INFO L82 PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 1 times [2018-11-18 09:19:07,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:19:07,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:19:07,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:19:07,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:19:07,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:19:07,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:19:07,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:19:07,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:19:07,338 INFO L82 PathProgramCache]: Analyzing trace with hash 582240858, now seen corresponding path program 1 times [2018-11-18 09:19:07,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:19:07,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:19:07,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:19:07,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:19:07,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:19:07,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:19:07,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:19:07,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:19:07,350 INFO L82 PathProgramCache]: Analyzing trace with hash -410535048, now seen corresponding path program 2 times [2018-11-18 09:19:07,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:19:07,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:19:07,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:19:07,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:19:07,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:19:07,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:19:07,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:19:07,579 WARN L180 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 69 [2018-11-18 09:19:07,767 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 71 [2018-11-18 09:19:07,821 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 09:19:07,822 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 09:19:07,822 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 09:19:07,822 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 09:19:07,822 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 09:19:07,822 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:19:07,822 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 09:19:07,822 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 09:19:07,822 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ben-Amram-2010LMCS-Ex2.3-alloca_true-termination.c.i_Iteration4_Lasso [2018-11-18 09:19:07,822 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 09:19:07,822 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 09:19:07,826 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 09:19:07,829 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 09:19:07,831 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 09:19:07,832 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 09:19:07,833 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 09:19:07,834 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 09:19:07,835 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 09:19:07,836 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 09:19:07,838 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 09:19:07,839 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 09:19:07,840 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 09:19:07,841 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 09:19:07,842 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 09:19:07,843 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 09:19:07,844 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 09:19:07,845 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 09:19:07,846 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 09:19:07,848 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 09:19:07,849 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 09:19:08,065 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 09:19:08,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 09:19:08,068 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 09:19:08,352 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 09:19:08,352 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 09:19:08,352 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 09:19:08,353 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:19:08,353 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:19:08,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:19:08,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:19:08,353 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:19:08,354 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:19:08,354 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:19:08,355 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:19:08,355 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 09:19:08,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:19:08,355 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:19:08,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:19:08,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:19:08,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:19:08,356 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:19:08,356 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:19:08,356 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:19:08,357 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 09:19:08,357 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:19:08,357 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:19:08,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:19:08,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:19:08,358 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:19:08,358 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:19:08,358 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:19:08,358 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:19:08,358 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 09:19:08,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:19:08,358 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:19:08,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:19:08,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:19:08,359 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:19:08,359 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:19:08,359 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:19:08,359 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:19:08,359 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 09:19:08,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:19:08,360 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:19:08,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:19:08,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:19:08,360 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:19:08,360 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:19:08,360 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:19:08,361 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:19:08,361 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 09:19:08,361 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:19:08,361 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:19:08,361 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:19:08,361 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:19:08,362 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:19:08,362 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:19:08,362 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:19:08,363 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 09:19:08,363 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:19:08,363 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:19:08,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:19:08,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:19:08,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:19:08,363 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:19:08,363 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:19:08,363 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:19:08,364 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 09:19:08,364 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:19:08,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:19:08,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:19:08,364 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:19:08,365 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:19:08,365 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:19:08,367 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:19:08,367 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 09:19:08,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:19:08,367 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:19:08,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:19:08,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:19:08,368 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:19:08,368 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:19:08,368 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:19:08,368 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:19:08,369 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 09:19:08,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:19:08,369 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:19:08,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:19:08,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:19:08,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:19:08,370 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:19:08,370 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:19:08,370 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:19:08,370 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 09:19:08,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:19:08,371 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:19:08,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:19:08,371 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:19:08,373 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:19:08,373 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:19:08,373 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:19:08,374 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:19:08,374 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 09:19:08,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:19:08,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:19:08,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:19:08,375 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:19:08,375 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:19:08,376 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:19:08,377 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:19:08,377 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 09:19:08,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:19:08,377 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:19:08,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:19:08,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:19:08,378 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:19:08,378 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:19:08,378 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:19:08,378 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:19:08,379 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 09:19:08,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:19:08,387 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:19:08,388 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:19:08,388 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:19:08,388 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:19:08,388 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:19:08,389 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:19:08,389 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:19:08,389 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 09:19:08,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:19:08,390 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:19:08,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:19:08,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:19:08,390 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:19:08,390 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:19:08,390 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:19:08,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:19:08,391 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 09:19:08,391 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:19:08,391 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:19:08,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:19:08,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:19:08,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:19:08,392 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:19:08,392 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:19:08,393 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:19:08,393 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 09:19:08,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:19:08,393 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:19:08,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:19:08,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:19:08,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:19:08,394 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:19:08,394 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:19:08,394 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:19:08,395 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 09:19:08,395 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:19:08,395 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:19:08,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:19:08,396 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:19:08,396 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:19:08,397 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:19:08,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:19:08,398 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 09:19:08,398 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:19:08,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:19:08,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:19:08,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:19:08,401 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:19:08,401 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:19:08,404 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:19:08,404 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 09:19:08,405 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:19:08,405 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 09:19:08,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:19:08,405 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:19:08,406 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:19:08,406 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:19:08,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:19:08,412 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 09:19:08,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:19:08,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:19:08,413 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:19:08,413 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:19:08,415 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:19:08,415 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:19:08,424 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:19:08,425 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 09:19:08,425 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:19:08,425 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:19:08,425 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:19:08,425 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:19:08,426 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:19:08,426 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:19:08,427 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:19:08,427 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 09:19:08,428 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:19:08,428 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 09:19:08,428 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:19:08,428 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:19:08,429 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:19:08,429 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:19:08,431 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:19:08,432 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 09:19:08,432 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:19:08,432 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:19:08,432 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:19:08,432 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:19:08,433 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:19:08,433 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:19:08,434 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:19:08,434 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 09:19:08,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:19:08,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:19:08,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:19:08,435 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:19:08,436 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:19:08,436 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:19:08,439 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 09:19:08,442 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 09:19:08,442 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 09:19:08,442 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 09:19:08,443 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 09:19:08,443 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 09:19:08,443 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_2 Supporting invariants [] [2018-11-18 09:19:08,538 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2018-11-18 09:19:08,541 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 09:19:08,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:19:08,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:19:08,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:19:08,591 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:19:08,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-18 09:19:08,625 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:19:08,626 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:19:08,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-18 09:19:08,628 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 09:19:08,634 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:19:08,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:19:08,640 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-11-18 09:19:08,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:19:08,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:19:08,725 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:19:08,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 62 [2018-11-18 09:19:08,732 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:19:08,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-11-18 09:19:08,734 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 09:19:08,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2018-11-18 09:19:08,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 09:19:08,755 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 09:19:08,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 57 [2018-11-18 09:19:08,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2018-11-18 09:19:08,799 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 09:19:08,848 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:19:08,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 46 [2018-11-18 09:19:08,857 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-18 09:19:08,885 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 09:19:08,903 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 09:19:08,920 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 09:19:08,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-18 09:19:08,946 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:108, output treesize:67 [2018-11-18 09:19:09,017 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 09:19:09,017 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-18 09:19:09,017 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand 7 states. [2018-11-18 09:19:09,069 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 4. Second operand 7 states. Result 43 states and 46 transitions. Complement of second has 10 states. [2018-11-18 09:19:09,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-18 09:19:09,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 09:19:09,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2018-11-18 09:19:09,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 3 letters. Loop has 7 letters. [2018-11-18 09:19:09,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:19:09,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 10 letters. Loop has 7 letters. [2018-11-18 09:19:09,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:19:09,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 3 letters. Loop has 14 letters. [2018-11-18 09:19:09,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:19:09,073 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 46 transitions. [2018-11-18 09:19:09,074 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 09:19:09,075 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 23 states and 24 transitions. [2018-11-18 09:19:09,075 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-18 09:19:09,075 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-18 09:19:09,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 24 transitions. [2018-11-18 09:19:09,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:19:09,075 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-11-18 09:19:09,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 24 transitions. [2018-11-18 09:19:09,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 17. [2018-11-18 09:19:09,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 09:19:09,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-11-18 09:19:09,077 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-11-18 09:19:09,077 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-11-18 09:19:09,077 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 09:19:09,077 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 18 transitions. [2018-11-18 09:19:09,077 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 09:19:09,077 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:19:09,077 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:19:09,078 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:19:09,078 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:19:09,078 INFO L794 eck$LassoCheckResult]: Stem: 572#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 561#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~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~mem17, main_#t~mem18, main_#t~nondet19, main_#t~mem20, main_#t~mem8, main_#t~mem9, main_#t~short10, main_#t~mem11, main_#t~short12, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~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;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6;call write~int(main_#t~nondet7, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet7; 562#L555-2 assume true; 565#L554-1 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 566#L554-2 assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 574#L554-4 main_#t~short12 := main_#t~short10; 576#L554-5 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 570#L554-7 assume !!main_#t~short12;havoc main_#t~short12;havoc main_#t~mem8;havoc main_#t~mem11;havoc main_#t~mem9;havoc main_#t~short10;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 571#L555 assume main_#t~mem13 > main_#t~mem14;havoc main_#t~mem13;havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem17; 567#L555-2 assume true; 563#L554-1 [2018-11-18 09:19:09,078 INFO L796 eck$LassoCheckResult]: Loop: 563#L554-1 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 564#L554-2 assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 573#L554-4 main_#t~short12 := main_#t~short10; 575#L554-5 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 568#L554-7 assume !!main_#t~short12;havoc main_#t~short12;havoc main_#t~mem8;havoc main_#t~mem11;havoc main_#t~mem9;havoc main_#t~short10;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 569#L555 assume !(main_#t~mem13 > main_#t~mem14);havoc main_#t~mem13;havoc main_#t~mem14;call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;call write~int(main_#t~nondet19, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet19;call main_#t~mem20 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem20; 577#L555-2 assume true; 563#L554-1 [2018-11-18 09:19:09,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:19:09,078 INFO L82 PathProgramCache]: Analyzing trace with hash -410535110, now seen corresponding path program 2 times [2018-11-18 09:19:09,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:19:09,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:19:09,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:19:09,088 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:19:09,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:19:09,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:19:09,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:19:09,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:19:09,104 INFO L82 PathProgramCache]: Analyzing trace with hash 582240858, now seen corresponding path program 2 times [2018-11-18 09:19:09,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:19:09,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:19:09,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:19:09,105 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:19:09,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:19:09,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:19:09,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:19:09,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:19:09,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1573442303, now seen corresponding path program 2 times [2018-11-18 09:19:09,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:19:09,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:19:09,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:19:09,116 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:19:09,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:19:09,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:19:09,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:19:09,284 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 69 [2018-11-18 09:19:09,692 WARN L180 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 107 [2018-11-18 09:19:09,797 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2018-11-18 09:19:09,800 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 09:19:09,800 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 09:19:09,800 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 09:19:09,800 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 09:19:09,800 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 09:19:09,800 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:19:09,800 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 09:19:09,800 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 09:19:09,800 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ben-Amram-2010LMCS-Ex2.3-alloca_true-termination.c.i_Iteration5_Lasso [2018-11-18 09:19:09,800 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 09:19:09,801 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 09:19:09,804 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 09:19:09,806 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 09:19:09,807 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 09:19:09,808 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 09:19:09,809 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 09:19:09,810 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 09:19:09,811 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 09:19:09,813 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 09:19:09,814 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 09:19:09,816 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 09:19:09,817 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 09:19:09,818 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 09:19:09,819 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 09:19:09,820 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 09:19:09,821 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 09:19:09,823 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 09:19:09,824 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 09:19:09,825 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 09:19:09,826 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 09:19:10,078 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 09:19:10,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:19:10,082 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 09:19:10,334 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 09:19:10,334 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 09:19:10,334 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 09:19:10,335 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:19:10,335 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:19:10,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:19:10,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:19:10,335 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:19:10,335 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:19:10,336 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:19:10,336 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:19:10,336 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 09:19:10,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:19:10,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:19:10,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:19:10,337 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:19:10,337 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:19:10,337 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:19:10,338 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:19:10,338 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 09:19:10,339 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:19:10,339 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:19:10,339 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:19:10,339 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:19:10,339 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:19:10,339 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:19:10,339 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:19:10,340 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:19:10,340 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 09:19:10,340 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:19:10,340 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:19:10,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:19:10,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:19:10,341 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:19:10,341 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:19:10,341 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:19:10,341 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:19:10,342 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 09:19:10,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:19:10,342 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:19:10,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:19:10,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:19:10,342 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:19:10,343 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:19:10,343 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:19:10,343 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:19:10,343 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 09:19:10,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:19:10,344 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:19:10,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:19:10,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:19:10,344 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:19:10,344 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:19:10,344 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:19:10,345 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:19:10,345 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 09:19:10,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:19:10,346 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:19:10,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:19:10,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:19:10,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:19:10,346 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:19:10,346 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:19:10,347 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:19:10,347 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 09:19:10,347 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:19:10,347 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:19:10,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:19:10,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:19:10,348 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:19:10,348 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:19:10,348 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:19:10,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:19:10,348 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 09:19:10,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:19:10,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:19:10,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:19:10,349 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:19:10,350 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:19:10,350 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:19:10,351 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:19:10,351 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 09:19:10,352 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:19:10,352 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:19:10,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:19:10,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:19:10,352 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:19:10,352 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:19:10,352 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:19:10,353 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:19:10,353 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 09:19:10,353 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:19:10,353 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:19:10,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:19:10,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:19:10,354 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:19:10,354 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:19:10,354 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:19:10,363 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:19:10,364 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 09:19:10,364 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:19:10,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:19:10,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:19:10,364 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:19:10,365 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:19:10,365 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:19:10,366 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:19:10,366 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 09:19:10,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:19:10,367 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:19:10,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:19:10,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:19:10,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:19:10,370 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:19:10,371 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:19:10,371 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:19:10,371 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 09:19:10,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:19:10,372 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:19:10,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:19:10,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:19:10,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:19:10,372 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:19:10,372 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:19:10,373 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:19:10,373 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 09:19:10,373 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:19:10,373 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:19:10,373 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:19:10,373 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:19:10,374 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:19:10,374 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:19:10,375 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:19:10,375 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 09:19:10,376 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:19:10,376 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:19:10,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:19:10,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:19:10,376 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:19:10,376 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:19:10,376 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:19:10,377 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:19:10,377 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 09:19:10,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:19:10,377 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:19:10,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:19:10,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:19:10,378 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:19:10,378 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:19:10,378 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:19:10,378 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:19:10,379 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 09:19:10,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:19:10,379 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:19:10,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:19:10,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:19:10,380 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:19:10,380 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:19:10,381 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:19:10,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:19:10,381 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 09:19:10,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:19:10,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:19:10,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:19:10,382 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:19:10,383 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:19:10,383 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:19:10,386 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:19:10,386 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 09:19:10,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:19:10,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:19:10,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:19:10,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:19:10,389 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:19:10,389 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:19:10,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:19:10,418 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 09:19:10,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:19:10,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:19:10,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:19:10,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:19:10,419 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:19:10,420 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:19:10,422 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:19:10,423 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 09:19:10,423 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:19:10,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:19:10,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:19:10,423 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:19:10,424 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:19:10,424 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:19:10,425 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:19:10,425 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 09:19:10,425 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:19:10,426 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:19:10,426 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:19:10,426 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:19:10,426 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:19:10,426 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:19:10,427 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:19:10,428 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 09:19:10,428 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:19:10,428 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:19:10,428 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:19:10,428 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:19:10,429 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:19:10,429 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:19:10,448 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 09:19:10,453 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 09:19:10,453 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 09:19:10,454 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 09:19:10,454 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 09:19:10,455 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 09:19:10,455 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_3 Supporting invariants [] [2018-11-18 09:19:10,518 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2018-11-18 09:19:10,521 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 09:19:10,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:19:10,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:19:10,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:19:10,553 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:19:10,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-18 09:19:10,565 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:19:10,566 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:19:10,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-18 09:19:10,567 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 09:19:10,570 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:19:10,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:19:10,574 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-11-18 09:19:10,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:19:10,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:19:10,625 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:19:10,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 62 [2018-11-18 09:19:10,633 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:19:10,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-11-18 09:19:10,634 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 09:19:10,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2018-11-18 09:19:10,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 09:19:10,648 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 09:19:10,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 57 [2018-11-18 09:19:10,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2018-11-18 09:19:10,677 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 09:19:10,711 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:19:10,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 46 [2018-11-18 09:19:10,717 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-18 09:19:10,740 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 09:19:10,755 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 09:19:10,768 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 09:19:10,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-18 09:19:10,785 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:108, output treesize:67 [2018-11-18 09:19:10,825 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 09:19:10,825 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-18 09:19:10,825 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 18 transitions. cyclomatic complexity: 3 Second operand 7 states. [2018-11-18 09:19:10,863 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 18 transitions. cyclomatic complexity: 3. Second operand 7 states. Result 28 states and 29 transitions. Complement of second has 10 states. [2018-11-18 09:19:10,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-18 09:19:10,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 09:19:10,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8 transitions. [2018-11-18 09:19:10,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 8 transitions. Stem has 10 letters. Loop has 7 letters. [2018-11-18 09:19:10,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:19:10,864 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 09:19:10,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:19:10,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:19:10,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:19:10,903 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:19:10,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-18 09:19:10,916 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:19:10,917 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:19:10,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-18 09:19:10,918 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 09:19:10,924 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:19:10,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:19:10,928 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-11-18 09:19:10,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:19:10,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:19:10,995 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:19:10,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 62 [2018-11-18 09:19:10,998 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:19:10,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-11-18 09:19:10,999 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 09:19:11,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2018-11-18 09:19:11,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 09:19:11,013 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 09:19:11,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 57 [2018-11-18 09:19:11,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2018-11-18 09:19:11,037 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 09:19:11,063 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:19:11,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 46 [2018-11-18 09:19:11,069 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-18 09:19:11,088 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 09:19:11,102 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 09:19:11,115 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 09:19:11,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-18 09:19:11,133 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:108, output treesize:67 [2018-11-18 09:19:11,169 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 09:19:11,170 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-18 09:19:11,170 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 18 transitions. cyclomatic complexity: 3 Second operand 7 states. [2018-11-18 09:19:11,205 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 18 transitions. cyclomatic complexity: 3. Second operand 7 states. Result 28 states and 29 transitions. Complement of second has 10 states. [2018-11-18 09:19:11,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-18 09:19:11,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 09:19:11,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8 transitions. [2018-11-18 09:19:11,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 8 transitions. Stem has 10 letters. Loop has 7 letters. [2018-11-18 09:19:11,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:19:11,209 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 09:19:11,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:19:11,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:19:11,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:19:11,257 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:19:11,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-18 09:19:11,269 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:19:11,276 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:19:11,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-18 09:19:11,276 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 09:19:11,279 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:19:11,283 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:19:11,283 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-11-18 09:19:11,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:19:11,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:19:11,335 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:19:11,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 62 [2018-11-18 09:19:11,339 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:19:11,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-11-18 09:19:11,340 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 09:19:11,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2018-11-18 09:19:11,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 09:19:11,353 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 09:19:11,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 57 [2018-11-18 09:19:11,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2018-11-18 09:19:11,384 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 09:19:11,413 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:19:11,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 46 [2018-11-18 09:19:11,421 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-18 09:19:11,439 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 09:19:11,454 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 09:19:11,468 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 09:19:11,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-18 09:19:11,485 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:108, output treesize:67 [2018-11-18 09:19:11,521 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 09:19:11,521 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-18 09:19:11,521 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 18 transitions. cyclomatic complexity: 3 Second operand 7 states. [2018-11-18 09:19:11,577 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 18 transitions. cyclomatic complexity: 3. Second operand 7 states. Result 30 states and 32 transitions. Complement of second has 11 states. [2018-11-18 09:19:11,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-18 09:19:11,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 09:19:11,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2018-11-18 09:19:11,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 10 letters. Loop has 7 letters. [2018-11-18 09:19:11,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:19:11,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 17 letters. Loop has 7 letters. [2018-11-18 09:19:11,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:19:11,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 10 letters. Loop has 14 letters. [2018-11-18 09:19:11,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:19:11,580 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 32 transitions. [2018-11-18 09:19:11,581 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 09:19:11,581 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 0 states and 0 transitions. [2018-11-18 09:19:11,581 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 09:19:11,581 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 09:19:11,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 09:19:11,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 09:19:11,581 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 09:19:11,582 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 09:19:11,582 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 09:19:11,582 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 09:19:11,582 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 09:19:11,582 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 09:19:11,582 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 09:19:11,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 09:19:11 BoogieIcfgContainer [2018-11-18 09:19:11,588 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 09:19:11,588 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 09:19:11,588 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 09:19:11,588 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 09:19:11,588 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:19:04" (3/4) ... [2018-11-18 09:19:11,591 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 09:19:11,591 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 09:19:11,591 INFO L168 Benchmark]: Toolchain (without parser) took 7845.25 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 239.1 MB). Free memory was 956.6 MB in the beginning and 937.6 MB in the end (delta: 19.0 MB). Peak memory consumption was 258.1 MB. Max. memory is 11.5 GB. [2018-11-18 09:19:11,592 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 09:19:11,592 INFO L168 Benchmark]: CACSL2BoogieTranslator took 356.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -189.6 MB). Peak memory consumption was 38.4 MB. Max. memory is 11.5 GB. [2018-11-18 09:19:11,593 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 09:19:11,593 INFO L168 Benchmark]: Boogie Preprocessor took 19.89 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 09:19:11,593 INFO L168 Benchmark]: RCFGBuilder took 215.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2018-11-18 09:19:11,594 INFO L168 Benchmark]: BuchiAutomizer took 7214.82 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 89.1 MB). Free memory was 1.1 GB in the beginning and 937.6 MB in the end (delta: 183.5 MB). Peak memory consumption was 272.6 MB. Max. memory is 11.5 GB. [2018-11-18 09:19:11,594 INFO L168 Benchmark]: Witness Printer took 3.00 ms. Allocated memory is still 1.3 GB. Free memory is still 937.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 09:19:11,597 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.49 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 356.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -189.6 MB). Peak memory consumption was 38.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.89 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 215.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7214.82 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 89.1 MB). Free memory was 1.1 GB in the beginning and 937.6 MB in the end (delta: 183.5 MB). Peak memory consumption was 272.6 MB. Max. memory is 11.5 GB. * Witness Printer took 3.00 ms. Allocated memory is still 1.3 GB. Free memory is still 937.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[z][z] + unknown-#memory_int-unknown[y][y] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[z][z] and consists of 6 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[z][z] and consists of 6 locations. 2 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.1s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 5.1s. Construction of modules took 0.1s. Büchi inclusion checks took 1.7s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 12 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 23 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 47 SDtfs, 55 SDslu, 49 SDs, 0 SdLazy, 133 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital536 mio100 ax104 hnf100 lsp94 ukn42 mio100 lsp39 div100 bol100 ite100 ukn100 eq189 hnf88 smp98 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms 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...