./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/Avery-2006FLOPS-Tabel1_true-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-memory-alloca/Avery-2006FLOPS-Tabel1_true-alloca_true-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 9b56ae1f9bab9d3b2bc1bd2f033ce64d7d92cfe1 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 21:42:54,749 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:42:54,751 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:42:54,766 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:42:54,767 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:42:54,768 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:42:54,769 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:42:54,772 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:42:54,774 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:42:54,774 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:42:54,776 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:42:54,776 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:42:54,777 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:42:54,779 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:42:54,782 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:42:54,783 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:42:54,784 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:42:54,788 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:42:54,796 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:42:54,800 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:42:54,801 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:42:54,803 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:42:54,805 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:42:54,805 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:42:54,805 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:42:54,806 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:42:54,807 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:42:54,808 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:42:54,809 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:42:54,810 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:42:54,811 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:42:54,811 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:42:54,811 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:42:54,812 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:42:54,813 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:42:54,813 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:42:54,814 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:42:54,832 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:42:54,832 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:42:54,833 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:42:54,834 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:42:54,834 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:42:54,834 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:42:54,834 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:42:54,834 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:42:54,834 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:42:54,835 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:42:54,835 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:42:54,835 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:42:54,835 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:42:54,835 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:42:54,836 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:42:54,836 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:42:54,836 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:42:54,836 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:42:54,836 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:42:54,836 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:42:54,837 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:42:54,837 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:42:54,837 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:42:54,837 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:42:54,837 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:42:54,838 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:42:54,838 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:42:54,838 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:42:54,839 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:42:54,839 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 9b56ae1f9bab9d3b2bc1bd2f033ce64d7d92cfe1 [2019-01-01 21:42:54,893 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:42:54,911 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:42:54,918 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:42:54,920 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:42:54,921 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:42:54,922 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/Avery-2006FLOPS-Tabel1_true-alloca_true-termination.c.i [2019-01-01 21:42:54,984 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b37c9671/d35083db40b04626bdfc8c776f28360c/FLAG2ee6abb08 [2019-01-01 21:42:55,566 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:42:55,569 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/Avery-2006FLOPS-Tabel1_true-alloca_true-termination.c.i [2019-01-01 21:42:55,587 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b37c9671/d35083db40b04626bdfc8c776f28360c/FLAG2ee6abb08 [2019-01-01 21:42:55,802 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b37c9671/d35083db40b04626bdfc8c776f28360c [2019-01-01 21:42:55,807 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:42:55,809 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:42:55,810 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:42:55,810 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:42:55,815 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:42:55,819 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:42:55" (1/1) ... [2019-01-01 21:42:55,822 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@506ce86c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:42:55, skipping insertion in model container [2019-01-01 21:42:55,823 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:42:55" (1/1) ... [2019-01-01 21:42:55,833 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:42:55,882 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:42:56,285 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:42:56,304 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:42:56,430 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:42:56,493 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:42:56,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:42:56 WrapperNode [2019-01-01 21:42:56,494 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:42:56,495 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:42:56,495 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:42:56,495 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:42:56,506 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:42:56" (1/1) ... [2019-01-01 21:42:56,525 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:42:56" (1/1) ... [2019-01-01 21:42:56,553 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:42:56,553 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:42:56,553 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:42:56,553 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:42:56,562 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:42:56" (1/1) ... [2019-01-01 21:42:56,562 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:42:56" (1/1) ... [2019-01-01 21:42:56,566 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:42:56" (1/1) ... [2019-01-01 21:42:56,566 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:42:56" (1/1) ... [2019-01-01 21:42:56,572 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:42:56" (1/1) ... [2019-01-01 21:42:56,578 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:42:56" (1/1) ... [2019-01-01 21:42:56,580 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:42:56" (1/1) ... [2019-01-01 21:42:56,584 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:42:56,584 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:42:56,584 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:42:56,585 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:42:56,586 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:42:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:42:56,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 21:42:56,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 21:42:56,656 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 21:42:56,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 21:42:56,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:42:56,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:42:57,139 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:42:57,140 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-01 21:42:57,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:42:57 BoogieIcfgContainer [2019-01-01 21:42:57,140 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:42:57,141 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:42:57,141 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:42:57,146 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:42:57,147 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:42:57,148 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:42:55" (1/3) ... [2019-01-01 21:42:57,149 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7fcc7aab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:42:57, skipping insertion in model container [2019-01-01 21:42:57,149 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:42:57,149 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:42:56" (2/3) ... [2019-01-01 21:42:57,150 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7fcc7aab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:42:57, skipping insertion in model container [2019-01-01 21:42:57,150 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:42:57,150 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:42:57" (3/3) ... [2019-01-01 21:42:57,153 INFO L375 chiAutomizerObserver]: Analyzing ICFG Avery-2006FLOPS-Tabel1_true-alloca_true-termination.c.i [2019-01-01 21:42:57,216 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:42:57,218 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:42:57,218 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:42:57,218 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:42:57,218 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:42:57,218 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:42:57,218 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:42:57,218 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:42:57,219 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:42:57,233 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-01-01 21:42:57,256 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-01 21:42:57,257 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:42:57,257 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:42:57,265 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 21:42:57,265 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:42:57,265 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:42:57,266 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-01-01 21:42:57,267 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-01 21:42:57,267 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:42:57,267 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:42:57,268 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 21:42:57,268 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:42:57,278 INFO L794 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet22, main_#t~nondet23, main_#t~ret24, main_~x~0, main_~y~0;main_~x~0 := main_#t~nondet22;havoc main_#t~nondet22;main_~y~0 := main_#t~nondet23;havoc main_#t~nondet23;subxy_#in~x, subxy_#in~y := main_~x~0, main_~y~0;havoc subxy_#res;havoc subxy_#t~malloc2.base, subxy_#t~malloc2.offset, subxy_#t~malloc3.base, subxy_#t~malloc3.offset, subxy_#t~malloc4.base, subxy_#t~malloc4.offset, subxy_#t~malloc5.base, subxy_#t~malloc5.offset, subxy_#t~mem6, subxy_#t~mem7, subxy_#t~mem8, subxy_#t~short9, subxy_#t~mem11, subxy_#t~post12, subxy_#t~mem13, subxy_#t~post14, subxy_#t~mem10, subxy_#t~mem17, subxy_#t~post18, subxy_#t~mem19, subxy_#t~post20, subxy_#t~mem15, subxy_#t~mem16, subxy_#t~mem21, subxy_~x, subxy_~y, subxy_~x_ref~0.base, subxy_~x_ref~0.offset, subxy_~y_ref~0.base, subxy_~y_ref~0.offset, subxy_~z~0.base, subxy_~z~0.offset, subxy_~i~0.base, subxy_~i~0.offset;subxy_~x := subxy_#in~x;subxy_~y := subxy_#in~y;call subxy_#t~malloc2.base, subxy_#t~malloc2.offset := #Ultimate.allocOnStack(4);subxy_~x_ref~0.base, subxy_~x_ref~0.offset := subxy_#t~malloc2.base, subxy_#t~malloc2.offset;call subxy_#t~malloc3.base, subxy_#t~malloc3.offset := #Ultimate.allocOnStack(4);subxy_~y_ref~0.base, subxy_~y_ref~0.offset := subxy_#t~malloc3.base, subxy_#t~malloc3.offset;call subxy_#t~malloc4.base, subxy_#t~malloc4.offset := #Ultimate.allocOnStack(4);subxy_~z~0.base, subxy_~z~0.offset := subxy_#t~malloc4.base, subxy_#t~malloc4.offset;call subxy_#t~malloc5.base, subxy_#t~malloc5.offset := #Ultimate.allocOnStack(4);subxy_~i~0.base, subxy_~i~0.offset := subxy_#t~malloc5.base, subxy_#t~malloc5.offset;call write~int(subxy_~x, subxy_~x_ref~0.base, subxy_~x_ref~0.offset, 4);call write~int(subxy_~y, subxy_~y_ref~0.base, subxy_~y_ref~0.offset, 4);call write~int(0, subxy_~z~0.base, subxy_~z~0.offset, 4);call subxy_#t~mem6 := read~int(subxy_~x_ref~0.base, subxy_~x_ref~0.offset, 4);call write~int(subxy_#t~mem6, subxy_~i~0.base, subxy_~i~0.offset, 4);havoc subxy_#t~mem6;call subxy_#t~mem7 := read~int(subxy_~y_ref~0.base, subxy_~y_ref~0.offset, 4);subxy_#t~short9 := subxy_#t~mem7 <= 0; 5#L556true assume !subxy_#t~short9;call subxy_#t~mem8 := read~int(subxy_~x_ref~0.base, subxy_~x_ref~0.offset, 4);subxy_#t~short9 := subxy_#t~mem8 <= 0; 7#L556-2true assume !subxy_#t~short9;havoc subxy_#t~mem7;havoc subxy_#t~mem8;havoc subxy_#t~short9; 6#L559-3true [2019-01-01 21:42:57,278 INFO L796 eck$LassoCheckResult]: Loop: 6#L559-3true call subxy_#t~mem10 := read~int(subxy_~i~0.base, subxy_~i~0.offset, 4); 3#L559-1true assume !!(subxy_#t~mem10 > 0);havoc subxy_#t~mem10;call subxy_#t~mem11 := read~int(subxy_~i~0.base, subxy_~i~0.offset, 4);subxy_#t~post12 := subxy_#t~mem11;call write~int(subxy_#t~post12 - 1, subxy_~i~0.base, subxy_~i~0.offset, 4);havoc subxy_#t~post12;havoc subxy_#t~mem11;call subxy_#t~mem13 := read~int(subxy_~z~0.base, subxy_~z~0.offset, 4);subxy_#t~post14 := subxy_#t~mem13;call write~int(1 + subxy_#t~post14, subxy_~z~0.base, subxy_~z~0.offset, 4);havoc subxy_#t~mem13;havoc subxy_#t~post14; 6#L559-3true [2019-01-01 21:42:57,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:57,285 INFO L82 PathProgramCache]: Analyzing trace with hash 925673, now seen corresponding path program 1 times [2019-01-01 21:42:57,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:42:57,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:42:57,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:57,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:42:57,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:57,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:57,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:57,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:57,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1542, now seen corresponding path program 1 times [2019-01-01 21:42:57,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:42:57,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:42:57,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:57,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:42:57,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:57,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:57,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:57,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:57,561 INFO L82 PathProgramCache]: Analyzing trace with hash 889572334, now seen corresponding path program 1 times [2019-01-01 21:42:57,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:42:57,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:42:57,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:57,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:42:57,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:57,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:57,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:57,772 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-01-01 21:42:59,458 WARN L181 SmtUtils]: Spent 1.59 s on a formula simplification. DAG size of input: 151 DAG size of output: 127 [2019-01-01 21:42:59,808 WARN L181 SmtUtils]: Spent 330.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-01-01 21:42:59,828 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:42:59,829 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:42:59,829 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:42:59,829 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:42:59,830 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:42:59,830 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:42:59,830 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:42:59,830 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:42:59,830 INFO L131 ssoRankerPreferences]: Filename of dumped script: Avery-2006FLOPS-Tabel1_true-alloca_true-termination.c.i_Iteration1_Lasso [2019-01-01 21:42:59,830 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:42:59,831 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:42:59,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:59,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:59,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:59,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:59,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:59,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:59,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:59,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:59,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:59,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:00,856 WARN L181 SmtUtils]: Spent 593.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 93 [2019-01-01 21:43:01,026 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-01-01 21:43:01,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:01,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:01,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:01,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:01,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:01,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:01,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:01,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:01,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:01,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:01,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:01,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:01,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:01,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:01,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:01,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:01,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:01,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:01,396 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2019-01-01 21:43:01,937 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-01-01 21:43:03,284 WARN L181 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-01-01 21:43:03,543 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:43:03,550 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:43:03,552 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 [2019-01-01 21:43:03,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:03,555 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:03,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:03,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:03,557 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:03,560 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:03,560 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:03,562 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:03,563 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 [2019-01-01 21:43:03,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:03,564 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:03,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:03,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:03,564 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:03,567 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:03,567 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:03,568 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:03,568 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 [2019-01-01 21:43:03,569 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:03,569 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:03,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:03,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:03,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:03,570 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:03,570 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:03,572 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:03,572 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:03,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:03,573 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:03,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:03,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:03,573 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:03,574 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:03,574 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:03,575 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:03,575 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 [2019-01-01 21:43:03,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:03,576 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:03,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:03,576 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:03,576 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:03,577 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:03,577 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:03,578 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:03,578 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 [2019-01-01 21:43:03,579 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:03,579 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:03,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:03,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:03,579 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:03,580 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:03,580 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:03,580 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:03,581 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 [2019-01-01 21:43:03,581 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:03,581 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:03,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:03,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:03,582 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:03,582 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:03,583 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:03,583 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:03,584 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 [2019-01-01 21:43:03,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:03,584 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:03,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:03,585 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:03,585 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:03,585 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:03,585 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:03,586 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:03,587 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 [2019-01-01 21:43:03,587 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:03,587 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:03,587 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:03,588 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:03,590 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:03,590 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:03,594 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:03,594 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 [2019-01-01 21:43:03,595 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:03,595 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:03,595 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:03,595 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:03,597 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:03,597 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:03,602 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:03,603 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 [2019-01-01 21:43:03,603 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:03,604 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:03,604 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:03,604 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:03,612 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:03,612 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:03,662 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:03,663 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 [2019-01-01 21:43:03,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:03,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:03,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:03,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:03,669 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:03,669 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:03,673 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:03,673 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 [2019-01-01 21:43:03,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:03,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:03,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:03,679 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:03,685 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:03,685 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:03,757 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:43:03,781 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-01 21:43:03,781 INFO L444 ModelExtractionUtils]: 13 out of 19 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-01 21:43:03,789 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:43:03,790 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:43:03,791 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:43:03,791 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_subxy_~i~0.base) ULTIMATE.start_subxy_~i~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_subxy_~i~0.base) ULTIMATE.start_subxy_~i~0.offset)_1 Supporting invariants [] [2019-01-01 21:43:04,087 INFO L297 tatePredicateManager]: 33 out of 36 supporting invariants were superfluous and have been removed [2019-01-01 21:43:04,100 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:43:04,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:04,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:43:04,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:43:04,306 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-01-01 21:43:04,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:43:04,330 INFO L478 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 20 treesize of output 32 [2019-01-01 21:43:04,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-01-01 21:43:04,494 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-01 21:43:04,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:43:04,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:43:04,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:43:04,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 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 [2019-01-01 21:43:04,591 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 21:43:04,622 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:43:04,631 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:43:04,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:43:04,649 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:30, output treesize:12 [2019-01-01 21:43:04,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:43:04,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:43:04,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:43:04,732 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-01 21:43:04,734 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states. Second operand 4 states. [2019-01-01 21:43:04,917 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states.. Second operand 4 states. Result 32 states and 41 transitions. Complement of second has 9 states. [2019-01-01 21:43:04,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 21:43:04,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:43:04,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2019-01-01 21:43:04,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-01 21:43:04,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:43:04,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 6 letters. Loop has 2 letters. [2019-01-01 21:43:04,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:43:04,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 4 letters. Loop has 4 letters. [2019-01-01 21:43:04,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:43:04,925 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 41 transitions. [2019-01-01 21:43:04,928 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:43:04,933 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 12 states and 15 transitions. [2019-01-01 21:43:04,934 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-01-01 21:43:04,935 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-01 21:43:04,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 15 transitions. [2019-01-01 21:43:04,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:43:04,936 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2019-01-01 21:43:04,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 15 transitions. [2019-01-01 21:43:04,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 10. [2019-01-01 21:43:04,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-01 21:43:04,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-01-01 21:43:04,965 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-01 21:43:04,965 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-01 21:43:04,965 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:43:04,966 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2019-01-01 21:43:04,967 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:43:04,967 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:43:04,967 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:43:04,967 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:43:04,968 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:43:04,968 INFO L794 eck$LassoCheckResult]: Stem: 248#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 242#L-1 havoc main_#res;havoc main_#t~nondet22, main_#t~nondet23, main_#t~ret24, main_~x~0, main_~y~0;main_~x~0 := main_#t~nondet22;havoc main_#t~nondet22;main_~y~0 := main_#t~nondet23;havoc main_#t~nondet23;subxy_#in~x, subxy_#in~y := main_~x~0, main_~y~0;havoc subxy_#res;havoc subxy_#t~malloc2.base, subxy_#t~malloc2.offset, subxy_#t~malloc3.base, subxy_#t~malloc3.offset, subxy_#t~malloc4.base, subxy_#t~malloc4.offset, subxy_#t~malloc5.base, subxy_#t~malloc5.offset, subxy_#t~mem6, subxy_#t~mem7, subxy_#t~mem8, subxy_#t~short9, subxy_#t~mem11, subxy_#t~post12, subxy_#t~mem13, subxy_#t~post14, subxy_#t~mem10, subxy_#t~mem17, subxy_#t~post18, subxy_#t~mem19, subxy_#t~post20, subxy_#t~mem15, subxy_#t~mem16, subxy_#t~mem21, subxy_~x, subxy_~y, subxy_~x_ref~0.base, subxy_~x_ref~0.offset, subxy_~y_ref~0.base, subxy_~y_ref~0.offset, subxy_~z~0.base, subxy_~z~0.offset, subxy_~i~0.base, subxy_~i~0.offset;subxy_~x := subxy_#in~x;subxy_~y := subxy_#in~y;call subxy_#t~malloc2.base, subxy_#t~malloc2.offset := #Ultimate.allocOnStack(4);subxy_~x_ref~0.base, subxy_~x_ref~0.offset := subxy_#t~malloc2.base, subxy_#t~malloc2.offset;call subxy_#t~malloc3.base, subxy_#t~malloc3.offset := #Ultimate.allocOnStack(4);subxy_~y_ref~0.base, subxy_~y_ref~0.offset := subxy_#t~malloc3.base, subxy_#t~malloc3.offset;call subxy_#t~malloc4.base, subxy_#t~malloc4.offset := #Ultimate.allocOnStack(4);subxy_~z~0.base, subxy_~z~0.offset := subxy_#t~malloc4.base, subxy_#t~malloc4.offset;call subxy_#t~malloc5.base, subxy_#t~malloc5.offset := #Ultimate.allocOnStack(4);subxy_~i~0.base, subxy_~i~0.offset := subxy_#t~malloc5.base, subxy_#t~malloc5.offset;call write~int(subxy_~x, subxy_~x_ref~0.base, subxy_~x_ref~0.offset, 4);call write~int(subxy_~y, subxy_~y_ref~0.base, subxy_~y_ref~0.offset, 4);call write~int(0, subxy_~z~0.base, subxy_~z~0.offset, 4);call subxy_#t~mem6 := read~int(subxy_~x_ref~0.base, subxy_~x_ref~0.offset, 4);call write~int(subxy_#t~mem6, subxy_~i~0.base, subxy_~i~0.offset, 4);havoc subxy_#t~mem6;call subxy_#t~mem7 := read~int(subxy_~y_ref~0.base, subxy_~y_ref~0.offset, 4);subxy_#t~short9 := subxy_#t~mem7 <= 0; 243#L556 assume !subxy_#t~short9;call subxy_#t~mem8 := read~int(subxy_~x_ref~0.base, subxy_~x_ref~0.offset, 4);subxy_#t~short9 := subxy_#t~mem8 <= 0; 250#L556-2 assume !subxy_#t~short9;havoc subxy_#t~mem7;havoc subxy_#t~mem8;havoc subxy_#t~short9; 251#L559-3 call subxy_#t~mem10 := read~int(subxy_~i~0.base, subxy_~i~0.offset, 4); 244#L559-1 assume !(subxy_#t~mem10 > 0);havoc subxy_#t~mem10; 245#L563-2 [2019-01-01 21:43:04,968 INFO L796 eck$LassoCheckResult]: Loop: 245#L563-2 call subxy_#t~mem15 := read~int(subxy_~i~0.base, subxy_~i~0.offset, 4);call subxy_#t~mem16 := read~int(subxy_~y_ref~0.base, subxy_~y_ref~0.offset, 4); 249#L563 assume !!(subxy_#t~mem15 < subxy_#t~mem16);havoc subxy_#t~mem15;havoc subxy_#t~mem16;call subxy_#t~mem17 := read~int(subxy_~i~0.base, subxy_~i~0.offset, 4);subxy_#t~post18 := subxy_#t~mem17;call write~int(1 + subxy_#t~post18, subxy_~i~0.base, subxy_~i~0.offset, 4);havoc subxy_#t~post18;havoc subxy_#t~mem17;call subxy_#t~mem19 := read~int(subxy_~z~0.base, subxy_~z~0.offset, 4);subxy_#t~post20 := subxy_#t~mem19;call write~int(subxy_#t~post20 - 1, subxy_~z~0.base, subxy_~z~0.offset, 4);havoc subxy_#t~mem19;havoc subxy_#t~post20; 245#L563-2 [2019-01-01 21:43:04,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:04,969 INFO L82 PathProgramCache]: Analyzing trace with hash 889572332, now seen corresponding path program 1 times [2019-01-01 21:43:04,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:43:04,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:43:04,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:04,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:43:04,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:04,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:43:05,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:43:05,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:43:05,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 21:43:05,243 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:43:05,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:05,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1926, now seen corresponding path program 1 times [2019-01-01 21:43:05,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:43:05,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:43:05,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:05,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:43:05,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:05,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:05,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:05,440 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-01-01 21:43:05,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 21:43:05,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-01 21:43:05,481 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand 6 states. [2019-01-01 21:43:05,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:43:05,626 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2019-01-01 21:43:05,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 21:43:05,628 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 14 transitions. [2019-01-01 21:43:05,629 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:43:05,630 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 11 states and 13 transitions. [2019-01-01 21:43:05,630 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-01-01 21:43:05,630 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-01 21:43:05,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2019-01-01 21:43:05,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:43:05,631 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-01-01 21:43:05,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2019-01-01 21:43:05,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-01-01 21:43:05,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-01 21:43:05,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2019-01-01 21:43:05,634 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-01-01 21:43:05,634 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-01-01 21:43:05,634 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:43:05,634 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2019-01-01 21:43:05,636 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:43:05,636 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:43:05,636 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:43:05,637 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-01 21:43:05,638 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:43:05,638 INFO L794 eck$LassoCheckResult]: Stem: 285#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 279#L-1 havoc main_#res;havoc main_#t~nondet22, main_#t~nondet23, main_#t~ret24, main_~x~0, main_~y~0;main_~x~0 := main_#t~nondet22;havoc main_#t~nondet22;main_~y~0 := main_#t~nondet23;havoc main_#t~nondet23;subxy_#in~x, subxy_#in~y := main_~x~0, main_~y~0;havoc subxy_#res;havoc subxy_#t~malloc2.base, subxy_#t~malloc2.offset, subxy_#t~malloc3.base, subxy_#t~malloc3.offset, subxy_#t~malloc4.base, subxy_#t~malloc4.offset, subxy_#t~malloc5.base, subxy_#t~malloc5.offset, subxy_#t~mem6, subxy_#t~mem7, subxy_#t~mem8, subxy_#t~short9, subxy_#t~mem11, subxy_#t~post12, subxy_#t~mem13, subxy_#t~post14, subxy_#t~mem10, subxy_#t~mem17, subxy_#t~post18, subxy_#t~mem19, subxy_#t~post20, subxy_#t~mem15, subxy_#t~mem16, subxy_#t~mem21, subxy_~x, subxy_~y, subxy_~x_ref~0.base, subxy_~x_ref~0.offset, subxy_~y_ref~0.base, subxy_~y_ref~0.offset, subxy_~z~0.base, subxy_~z~0.offset, subxy_~i~0.base, subxy_~i~0.offset;subxy_~x := subxy_#in~x;subxy_~y := subxy_#in~y;call subxy_#t~malloc2.base, subxy_#t~malloc2.offset := #Ultimate.allocOnStack(4);subxy_~x_ref~0.base, subxy_~x_ref~0.offset := subxy_#t~malloc2.base, subxy_#t~malloc2.offset;call subxy_#t~malloc3.base, subxy_#t~malloc3.offset := #Ultimate.allocOnStack(4);subxy_~y_ref~0.base, subxy_~y_ref~0.offset := subxy_#t~malloc3.base, subxy_#t~malloc3.offset;call subxy_#t~malloc4.base, subxy_#t~malloc4.offset := #Ultimate.allocOnStack(4);subxy_~z~0.base, subxy_~z~0.offset := subxy_#t~malloc4.base, subxy_#t~malloc4.offset;call subxy_#t~malloc5.base, subxy_#t~malloc5.offset := #Ultimate.allocOnStack(4);subxy_~i~0.base, subxy_~i~0.offset := subxy_#t~malloc5.base, subxy_#t~malloc5.offset;call write~int(subxy_~x, subxy_~x_ref~0.base, subxy_~x_ref~0.offset, 4);call write~int(subxy_~y, subxy_~y_ref~0.base, subxy_~y_ref~0.offset, 4);call write~int(0, subxy_~z~0.base, subxy_~z~0.offset, 4);call subxy_#t~mem6 := read~int(subxy_~x_ref~0.base, subxy_~x_ref~0.offset, 4);call write~int(subxy_#t~mem6, subxy_~i~0.base, subxy_~i~0.offset, 4);havoc subxy_#t~mem6;call subxy_#t~mem7 := read~int(subxy_~y_ref~0.base, subxy_~y_ref~0.offset, 4);subxy_#t~short9 := subxy_#t~mem7 <= 0; 280#L556 assume !subxy_#t~short9;call subxy_#t~mem8 := read~int(subxy_~x_ref~0.base, subxy_~x_ref~0.offset, 4);subxy_#t~short9 := subxy_#t~mem8 <= 0; 288#L556-2 assume !subxy_#t~short9;havoc subxy_#t~mem7;havoc subxy_#t~mem8;havoc subxy_#t~short9; 287#L559-3 call subxy_#t~mem10 := read~int(subxy_~i~0.base, subxy_~i~0.offset, 4); 283#L559-1 assume !!(subxy_#t~mem10 > 0);havoc subxy_#t~mem10;call subxy_#t~mem11 := read~int(subxy_~i~0.base, subxy_~i~0.offset, 4);subxy_#t~post12 := subxy_#t~mem11;call write~int(subxy_#t~post12 - 1, subxy_~i~0.base, subxy_~i~0.offset, 4);havoc subxy_#t~post12;havoc subxy_#t~mem11;call subxy_#t~mem13 := read~int(subxy_~z~0.base, subxy_~z~0.offset, 4);subxy_#t~post14 := subxy_#t~mem13;call write~int(1 + subxy_#t~post14, subxy_~z~0.base, subxy_~z~0.offset, 4);havoc subxy_#t~mem13;havoc subxy_#t~post14; 284#L559-3 call subxy_#t~mem10 := read~int(subxy_~i~0.base, subxy_~i~0.offset, 4); 281#L559-1 assume !(subxy_#t~mem10 > 0);havoc subxy_#t~mem10; 282#L563-2 [2019-01-01 21:43:05,638 INFO L796 eck$LassoCheckResult]: Loop: 282#L563-2 call subxy_#t~mem15 := read~int(subxy_~i~0.base, subxy_~i~0.offset, 4);call subxy_#t~mem16 := read~int(subxy_~y_ref~0.base, subxy_~y_ref~0.offset, 4); 286#L563 assume !!(subxy_#t~mem15 < subxy_#t~mem16);havoc subxy_#t~mem15;havoc subxy_#t~mem16;call subxy_#t~mem17 := read~int(subxy_~i~0.base, subxy_~i~0.offset, 4);subxy_#t~post18 := subxy_#t~mem17;call write~int(1 + subxy_#t~post18, subxy_~i~0.base, subxy_~i~0.offset, 4);havoc subxy_#t~post18;havoc subxy_#t~mem17;call subxy_#t~mem19 := read~int(subxy_~z~0.base, subxy_~z~0.offset, 4);subxy_#t~post20 := subxy_#t~mem19;call write~int(subxy_#t~post20 - 1, subxy_~z~0.base, subxy_~z~0.offset, 4);havoc subxy_#t~mem19;havoc subxy_#t~post20; 282#L563-2 [2019-01-01 21:43:05,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:05,638 INFO L82 PathProgramCache]: Analyzing trace with hash 180521649, now seen corresponding path program 1 times [2019-01-01 21:43:05,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:43:05,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:43:05,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:05,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:43:05,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:05,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:05,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:05,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:05,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1926, now seen corresponding path program 2 times [2019-01-01 21:43:05,706 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:43:05,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:43:05,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:05,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:43:05,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:05,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:05,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:05,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:05,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1682613814, now seen corresponding path program 1 times [2019-01-01 21:43:05,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:43:05,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:43:05,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:05,731 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:43:05,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:43:05,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:05,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:43:05,931 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-01-01 21:43:07,011 WARN L181 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 173 DAG size of output: 144 [2019-01-01 21:43:07,622 WARN L181 SmtUtils]: Spent 579.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-01-01 21:43:07,638 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:43:07,638 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:43:07,638 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:43:07,639 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:43:07,639 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:43:07,639 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:43:07,639 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:43:07,639 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:43:07,639 INFO L131 ssoRankerPreferences]: Filename of dumped script: Avery-2006FLOPS-Tabel1_true-alloca_true-termination.c.i_Iteration3_Lasso [2019-01-01 21:43:07,639 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:43:07,639 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:43:07,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:07,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:07,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:07,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:07,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:07,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:07,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:07,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:07,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:07,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:07,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:07,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:08,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:08,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43: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 [2019-01-01 21:43:08,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:08,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:08,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:08,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:08,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:08,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:09,892 WARN L181 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 95 [2019-01-01 21:43:10,044 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-01-01 21:43:10,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:10,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:10,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:10,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:10,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:10,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:10,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:43:11,856 WARN L181 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-01-01 21:43:11,973 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:43:11,973 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:43:11,974 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 [2019-01-01 21:43:11,974 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:11,974 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:11,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:11,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:11,977 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:11,977 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:11,977 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:11,979 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:11,979 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 [2019-01-01 21:43:11,981 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:11,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:11,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:11,982 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:11,984 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:11,984 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:11,986 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:11,987 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 [2019-01-01 21:43:11,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:11,987 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:11,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:11,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:11,987 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:11,988 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:11,988 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:11,988 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:11,992 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 [2019-01-01 21:43:11,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:11,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:11,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:11,993 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:11,996 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:11,996 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:11,999 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:11,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 [2019-01-01 21:43:12,001 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:12,001 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:12,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:12,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:12,002 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:12,002 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:12,002 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:12,004 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:12,005 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 [2019-01-01 21:43:12,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:12,005 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:12,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:12,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:12,008 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:12,008 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:12,008 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:12,009 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:12,009 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 [2019-01-01 21:43:12,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:12,012 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:12,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:12,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:12,012 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:12,013 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:12,013 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:12,014 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:12,014 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 [2019-01-01 21:43:12,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:12,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:12,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:12,018 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:12,019 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:12,019 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:12,022 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:12,023 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 [2019-01-01 21:43:12,023 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:12,023 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:12,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:12,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:12,024 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:12,024 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:12,024 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:12,028 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:12,028 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 [2019-01-01 21:43:12,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:12,029 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:12,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:12,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:12,029 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:12,030 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:12,032 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:12,033 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:12,033 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 [2019-01-01 21:43:12,036 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:12,036 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:12,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:12,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:12,037 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:12,037 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:12,037 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:12,038 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:12,038 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 [2019-01-01 21:43:12,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:12,039 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:12,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:12,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:12,042 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:12,042 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:12,042 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:12,043 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:12,043 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 [2019-01-01 21:43:12,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:12,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:12,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:12,047 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:12,049 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:12,049 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:12,051 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:12,052 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 [2019-01-01 21:43:12,052 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:12,053 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:12,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:12,053 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:12,053 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:12,053 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:12,053 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:12,057 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:12,057 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 [2019-01-01 21:43:12,058 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:12,058 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:12,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:12,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:12,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:12,062 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:12,062 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:12,063 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:12,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 [2019-01-01 21:43:12,063 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:12,063 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:12,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:12,067 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:12,067 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:12,067 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:12,067 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:12,068 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:12,068 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 [2019-01-01 21:43:12,072 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:12,072 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:12,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:12,072 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:12,073 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:12,073 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:12,074 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:12,076 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 [2019-01-01 21:43:12,077 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:12,077 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:12,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:12,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:12,077 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:12,080 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:12,081 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:12,081 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:12,082 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 [2019-01-01 21:43:12,082 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:12,082 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:12,082 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:12,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:12,085 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:12,086 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:12,086 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:12,086 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:12,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 [2019-01-01 21:43:12,087 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:12,087 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:43:12,087 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:12,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:12,091 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:12,091 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:43:12,091 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:43:12,093 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:12,093 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 [2019-01-01 21:43:12,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:12,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:12,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:12,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:12,095 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:12,095 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:12,097 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:12,098 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:43:12,098 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:12,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:12,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:12,099 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:12,102 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:12,102 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:12,107 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:12,108 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 [2019-01-01 21:43:12,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:12,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:12,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:12,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:12,112 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:12,113 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:12,115 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:12,115 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 [2019-01-01 21:43:12,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:12,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:12,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:12,116 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:12,117 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:12,117 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:12,124 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:12,125 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 [2019-01-01 21:43:12,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:12,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:12,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:12,128 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:12,132 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:12,132 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:12,146 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:12,146 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 [2019-01-01 21:43:12,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:12,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:12,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:12,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:12,151 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:12,151 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:12,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:12,157 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 [2019-01-01 21:43:12,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:12,159 INFO L205 nArgumentSynthesizer]: 16 stem disjuncts [2019-01-01 21:43:12,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:12,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:12,169 INFO L402 nArgumentSynthesizer]: We have 36 Motzkin's Theorem applications. [2019-01-01 21:43:12,169 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:12,222 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:12,222 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 [2019-01-01 21:43:12,224 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:12,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:12,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:12,226 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:12,228 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:12,228 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:12,231 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:43:12,232 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 [2019-01-01 21:43:12,232 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:43:12,232 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:43:12,232 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:43:12,235 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:43:12,237 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:43:12,237 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:43:12,251 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:43:12,260 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:43:12,260 INFO L444 ModelExtractionUtils]: 24 out of 31 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-01 21:43:12,261 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:43:12,262 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:43:12,263 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:43:12,263 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_subxy_~i~0.base) ULTIMATE.start_subxy_~i~0.offset)_2, v_rep(select (select #memory_int ULTIMATE.start_subxy_~y_ref~0.base) ULTIMATE.start_subxy_~y_ref~0.offset)_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_subxy_~i~0.base) ULTIMATE.start_subxy_~i~0.offset)_2 + 1*v_rep(select (select #memory_int ULTIMATE.start_subxy_~y_ref~0.base) ULTIMATE.start_subxy_~y_ref~0.offset)_2 Supporting invariants [] [2019-01-01 21:43:12,861 INFO L297 tatePredicateManager]: 34 out of 37 supporting invariants were superfluous and have been removed [2019-01-01 21:43:12,868 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:43:12,869 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:43:12,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:43:12,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:43:12,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:43:12,959 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2019-01-01 21:43:12,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2019-01-01 21:43:13,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:43:13,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:43:13,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:43:13,007 INFO L478 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 9 [2019-01-01 21:43:13,008 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 21:43:13,016 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:43:13,022 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:43:13,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:43:13,034 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:22, output treesize:12 [2019-01-01 21:43:13,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:43:13,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:43:13,292 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-01-01 21:43:13,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:43:13,293 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-01 21:43:13,293 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 4 Second operand 4 states. [2019-01-01 21:43:13,371 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 12 states and 15 transitions. Complement of second has 5 states. [2019-01-01 21:43:13,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:43:13,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:43:13,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2019-01-01 21:43:13,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 8 letters. Loop has 2 letters. [2019-01-01 21:43:13,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:43:13,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 10 letters. Loop has 2 letters. [2019-01-01 21:43:13,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:43:13,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 8 letters. Loop has 4 letters. [2019-01-01 21:43:13,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:43:13,374 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 15 transitions. [2019-01-01 21:43:13,375 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:43:13,375 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 0 states and 0 transitions. [2019-01-01 21:43:13,375 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:43:13,375 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:43:13,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:43:13,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:43:13,376 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:43:13,376 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:43:13,376 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:43:13,376 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:43:13,379 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:43:13,379 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:43:13,379 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:43:13,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:43:13 BoogieIcfgContainer [2019-01-01 21:43:13,386 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:43:13,386 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:43:13,386 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:43:13,386 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:43:13,387 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:42:57" (3/4) ... [2019-01-01 21:43:13,391 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:43:13,393 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:43:13,394 INFO L168 Benchmark]: Toolchain (without parser) took 17587.14 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 320.9 MB). Free memory was 950.0 MB in the beginning and 1.1 GB in the end (delta: -130.2 MB). Peak memory consumption was 190.6 MB. Max. memory is 11.5 GB. [2019-01-01 21:43:13,397 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:43:13,398 INFO L168 Benchmark]: CACSL2BoogieTranslator took 684.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 950.0 MB in the beginning and 1.1 GB in the end (delta: -177.7 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. [2019-01-01 21:43:13,399 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.79 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:43:13,399 INFO L168 Benchmark]: Boogie Preprocessor took 30.77 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:43:13,400 INFO L168 Benchmark]: RCFGBuilder took 556.19 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: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 11.5 GB. [2019-01-01 21:43:13,401 INFO L168 Benchmark]: BuchiAutomizer took 16244.61 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 173.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.1 MB). Peak memory consumption was 195.1 MB. Max. memory is 11.5 GB. [2019-01-01 21:43:13,403 INFO L168 Benchmark]: Witness Printer took 7.38 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:43:13,412 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 684.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 950.0 MB in the beginning and 1.1 GB in the end (delta: -177.7 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 57.79 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.77 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 556.19 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: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 16244.61 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 173.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.1 MB). Peak memory consumption was 195.1 MB. Max. memory is 11.5 GB. * Witness Printer took 7.38 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[i][i] and consists of 6 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[i][i] + unknown-#memory_int-unknown[y_ref][y_ref] and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 16.1s and 4 iterations. TraceHistogramMax:2. Analysis of lassos took 14.5s. Construction of modules took 0.1s. Büchi inclusion checks took 1.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 10 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 21 SDtfs, 24 SDslu, 16 SDs, 0 SdLazy, 44 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital791 mio100 ax102 hnf100 lsp96 ukn32 mio100 lsp32 div100 bol100 ite100 ukn100 eq192 hnf87 smp98 dnf733 smp90 tf100 neg91 sie127 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 65ms VariablesStem: 9 VariablesLoop: 6 DisjunctsStem: 16 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 36 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...