./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f 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/CookSeeZuleger-2013TACAS-Fig7a-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 0d5c046770a708e0857845f9429def45b08d1347 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 02:26:25,709 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:26:25,715 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:26:25,737 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:26:25,738 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:26:25,740 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:26:25,743 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:26:25,747 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:26:25,748 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:26:25,751 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:26:25,752 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:26:25,754 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:26:25,755 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:26:25,756 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:26:25,757 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:26:25,758 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:26:25,759 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:26:25,760 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:26:25,762 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:26:25,764 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:26:25,765 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:26:25,766 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:26:25,768 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:26:25,769 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:26:25,769 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:26:25,770 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:26:25,771 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:26:25,772 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:26:25,772 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:26:25,774 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:26:25,774 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:26:25,774 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:26:25,775 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:26:25,775 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:26:25,776 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:26:25,777 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:26:25,777 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-14 02:26:25,794 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:26:25,794 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:26:25,796 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:26:25,796 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:26:25,796 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:26:25,796 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:26:25,796 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:26:25,797 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:26:25,797 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:26:25,797 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:26:25,797 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:26:25,797 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:26:25,798 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:26:25,798 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:26:25,798 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:26:25,798 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:26:25,798 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:26:25,798 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:26:25,799 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:26:25,799 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:26:25,799 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:26:25,799 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:26:25,799 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:26:25,799 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:26:25,800 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:26:25,800 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:26:25,800 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:26:25,800 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:26:25,801 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:26:25,801 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 -> 0d5c046770a708e0857845f9429def45b08d1347 [2019-01-14 02:26:25,852 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:26:25,868 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:26:25,875 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:26:25,877 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:26:25,878 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:26:25,879 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i [2019-01-14 02:26:25,949 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9065f3820/62b3eaae97ea40338fde8c1466095ade/FLAG06b9c36e5 [2019-01-14 02:26:26,428 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:26:26,429 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i [2019-01-14 02:26:26,441 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9065f3820/62b3eaae97ea40338fde8c1466095ade/FLAG06b9c36e5 [2019-01-14 02:26:26,765 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9065f3820/62b3eaae97ea40338fde8c1466095ade [2019-01-14 02:26:26,768 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:26:26,770 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:26:26,771 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:26:26,771 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:26:26,774 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:26:26,775 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:26:26" (1/1) ... [2019-01-14 02:26:26,778 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74bc7883 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:26:26, skipping insertion in model container [2019-01-14 02:26:26,778 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:26:26" (1/1) ... [2019-01-14 02:26:26,786 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:26:26,826 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:26:27,186 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:26:27,203 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:26:27,321 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:26:27,379 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:26:27,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:26:27 WrapperNode [2019-01-14 02:26:27,380 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:26:27,381 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:26:27,381 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:26:27,381 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:26:27,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:26:27" (1/1) ... [2019-01-14 02:26:27,413 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:26:27" (1/1) ... [2019-01-14 02:26:27,443 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:26:27,443 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:26:27,443 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:26:27,446 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:26:27,455 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:26:27" (1/1) ... [2019-01-14 02:26:27,456 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:26:27" (1/1) ... [2019-01-14 02:26:27,462 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:26:27" (1/1) ... [2019-01-14 02:26:27,462 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:26:27" (1/1) ... [2019-01-14 02:26:27,471 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:26:27" (1/1) ... [2019-01-14 02:26:27,486 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:26:27" (1/1) ... [2019-01-14 02:26:27,488 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:26:27" (1/1) ... [2019-01-14 02:26:27,495 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:26:27,496 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:26:27,496 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:26:27,496 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:26:27,500 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:26:27" (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-14 02:26:27,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 02:26:27,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:26:27,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 02:26:27,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 02:26:27,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:26:27,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:26:28,035 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:26:28,035 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-14 02:26:28,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:26:28 BoogieIcfgContainer [2019-01-14 02:26:28,037 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:26:28,037 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:26:28,037 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:26:28,041 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:26:28,042 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:26:28,042 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:26:26" (1/3) ... [2019-01-14 02:26:28,043 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3ccddd55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:26:28, skipping insertion in model container [2019-01-14 02:26:28,044 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:26:28,044 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:26:27" (2/3) ... [2019-01-14 02:26:28,044 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3ccddd55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:26:28, skipping insertion in model container [2019-01-14 02:26:28,044 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:26:28,044 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:26:28" (3/3) ... [2019-01-14 02:26:28,046 INFO L375 chiAutomizerObserver]: Analyzing ICFG CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i [2019-01-14 02:26:28,099 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:26:28,100 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:26:28,100 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:26:28,100 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:26:28,101 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:26:28,101 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:26:28,101 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:26:28,101 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:26:28,101 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:26:28,113 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-01-14 02:26:28,133 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-14 02:26:28,133 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:26:28,134 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:26:28,141 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:26:28,141 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:26:28,141 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:26:28,141 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-01-14 02:26:28,142 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-14 02:26:28,143 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:26:28,143 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:26:28,143 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:26:28,143 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:26:28,151 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~nondet13, main_#t~mem14, main_#t~mem15, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~d~0.base, main_~d~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~d~0.base, main_~d~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 11#L552-2true [2019-01-14 02:26:28,151 INFO L796 eck$LassoCheckResult]: Loop: 11#L552-2true call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 12#L551-1true assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 4#L551-3true main_#t~short9 := main_#t~short7; 7#L551-4true assume main_#t~short9;call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 10#L551-6true assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~short9; 8#L552true assume 0 != main_#t~nondet10;havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11;call write~int(main_#t~nondet12, main_~d~0.base, main_~d~0.offset, 4);havoc main_#t~nondet12; 11#L552-2true [2019-01-14 02:26:28,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:28,158 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-01-14 02:26:28,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:26:28,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:26:28,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:28,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:26:28,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:28,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:28,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:28,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:28,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 1 times [2019-01-14 02:26:28,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:26:28,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:26:28,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:28,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:26:28,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:28,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:28,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:28,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:28,362 INFO L82 PathProgramCache]: Analyzing trace with hash 177626380, now seen corresponding path program 1 times [2019-01-14 02:26:28,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:26:28,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:26:28,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:28,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:26:28,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:28,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:28,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:29,362 WARN L181 SmtUtils]: Spent 869.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 63 [2019-01-14 02:26:29,703 WARN L181 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-01-14 02:26:29,866 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-01-14 02:26:29,895 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:26:29,897 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:26:29,899 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:26:29,900 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:26:29,900 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:26:29,900 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:26:29,901 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:26:29,901 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:26:29,901 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i_Iteration1_Lasso [2019-01-14 02:26:29,901 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:26:29,903 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:26:29,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:29,939 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-14 02:26:29,946 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-14 02:26:29,950 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-14 02:26:29,958 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-14 02:26:29,962 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-14 02:26:29,966 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-14 02:26:29,987 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-14 02:26:30,017 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-14 02:26:30,051 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-14 02:26:30,084 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-14 02:26:30,110 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-14 02:26:30,138 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-14 02:26:30,173 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-14 02:26:30,201 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-14 02:26:30,768 WARN L181 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2019-01-14 02:26:30,981 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-01-14 02:26:30,982 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-14 02:26:30,985 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-14 02:26:31,182 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-01-14 02:26:32,155 WARN L181 SmtUtils]: Spent 580.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-01-14 02:26:32,263 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:26:32,268 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:26:32,270 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-14 02:26:32,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:32,273 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:32,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:32,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:32,273 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:32,276 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:32,276 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:32,278 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:32,278 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-14 02:26:32,279 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:32,279 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:32,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:32,280 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 02:26:32,280 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:32,281 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:26:32,281 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:32,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:32,286 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-14 02:26:32,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:32,287 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:32,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:32,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:32,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:32,288 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:32,288 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:32,289 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:32,289 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-14 02:26:32,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:32,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:32,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:32,290 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:32,293 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:32,293 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:32,297 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:32,297 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-14 02:26:32,299 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:32,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:32,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:32,300 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:32,302 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:32,303 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:32,311 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:32,311 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-14 02:26:32,312 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:32,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:32,312 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:32,313 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:32,314 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:32,315 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:32,318 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:32,319 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-14 02:26:32,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:32,320 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:32,320 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:32,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:32,320 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:32,321 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:32,321 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:32,322 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:32,323 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-14 02:26:32,323 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:32,324 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:32,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:32,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:32,326 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:32,327 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:32,327 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:32,328 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:32,329 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-14 02:26:32,331 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:32,332 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:32,332 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:32,332 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:32,333 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:32,335 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:32,335 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:32,336 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:32,336 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:32,339 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:32,339 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:32,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:32,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:32,340 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:32,340 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:32,341 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:32,341 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:32,347 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:32,348 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:32,348 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:32,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:32,348 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:32,348 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:32,349 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:32,349 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:32,354 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:32,356 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-14 02:26:32,357 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:32,358 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:32,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:32,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:32,359 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:32,359 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:32,359 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:32,360 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:32,365 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-14 02:26:32,365 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:32,366 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:32,366 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:32,366 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:32,371 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:32,374 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:32,380 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:32,384 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-14 02:26:32,385 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:32,385 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:32,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:32,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:32,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:32,390 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:32,390 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:32,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:32,392 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-14 02:26:32,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:32,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:32,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:32,398 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:32,414 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:32,414 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:32,471 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:32,472 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-14 02:26:32,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:32,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:32,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:32,473 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:32,477 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:32,477 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:32,498 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:32,501 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:32,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:32,502 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:32,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:32,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:32,503 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:32,505 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:32,505 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:32,510 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:26:32,519 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:26:32,524 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:26:32,526 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:26:32,527 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:26:32,527 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:26:32,528 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 Supporting invariants [] [2019-01-14 02:26:32,801 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2019-01-14 02:26:32,809 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:26:32,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:32,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:26:32,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:26:32,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:26:32,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:26:33,000 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-14 02:26:33,014 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-14 02:26:33,015 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states. Second operand 4 states. [2019-01-14 02:26:33,180 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states.. Second operand 4 states. Result 55 states and 71 transitions. Complement of second has 10 states. [2019-01-14 02:26:33,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 02:26:33,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:26:33,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2019-01-14 02:26:33,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 29 transitions. Stem has 2 letters. Loop has 6 letters. [2019-01-14 02:26:33,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:26:33,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 29 transitions. Stem has 8 letters. Loop has 6 letters. [2019-01-14 02:26:33,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:26:33,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 29 transitions. Stem has 2 letters. Loop has 12 letters. [2019-01-14 02:26:33,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:26:33,189 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 71 transitions. [2019-01-14 02:26:33,193 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2019-01-14 02:26:33,199 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 31 states and 44 transitions. [2019-01-14 02:26:33,200 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-01-14 02:26:33,201 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-01-14 02:26:33,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 44 transitions. [2019-01-14 02:26:33,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:26:33,202 INFO L706 BuchiCegarLoop]: Abstraction has 31 states and 44 transitions. [2019-01-14 02:26:33,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 44 transitions. [2019-01-14 02:26:33,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-01-14 02:26:33,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-14 02:26:33,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 42 transitions. [2019-01-14 02:26:33,228 INFO L729 BuchiCegarLoop]: Abstraction has 30 states and 42 transitions. [2019-01-14 02:26:33,228 INFO L609 BuchiCegarLoop]: Abstraction has 30 states and 42 transitions. [2019-01-14 02:26:33,228 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:26:33,228 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 42 transitions. [2019-01-14 02:26:33,230 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2019-01-14 02:26:33,230 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:26:33,230 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:26:33,230 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 02:26:33,231 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:26:33,231 INFO L794 eck$LassoCheckResult]: Stem: 230#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 228#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~nondet13, main_#t~mem14, main_#t~mem15, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~d~0.base, main_~d~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~d~0.base, main_~d~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 229#L552-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 242#L551-1 [2019-01-14 02:26:33,231 INFO L796 eck$LassoCheckResult]: Loop: 242#L551-1 assume !main_#t~short7; 224#L551-3 main_#t~short9 := main_#t~short7; 225#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 231#L551-6 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~short9; 243#L552 assume 0 != main_#t~nondet10;havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11;call write~int(main_#t~nondet12, main_~d~0.base, main_~d~0.offset, 4);havoc main_#t~nondet12; 244#L552-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 242#L551-1 [2019-01-14 02:26:33,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:33,231 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2019-01-14 02:26:33,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:26:33,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:26:33,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:33,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:26:33,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:33,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:33,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:33,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:33,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1244514134, now seen corresponding path program 1 times [2019-01-14 02:26:33,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:26:33,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:26:33,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:33,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:26:33,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:33,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:26:33,310 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-14 02:26:33,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:26:33,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:26:33,314 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:26:33,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 02:26:33,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 02:26:33,318 INFO L87 Difference]: Start difference. First operand 30 states and 42 transitions. cyclomatic complexity: 15 Second operand 4 states. [2019-01-14 02:26:33,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:26:33,371 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2019-01-14 02:26:33,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 02:26:33,373 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 35 transitions. [2019-01-14 02:26:33,374 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-14 02:26:33,375 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 20 states and 23 transitions. [2019-01-14 02:26:33,376 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-01-14 02:26:33,376 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-01-14 02:26:33,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2019-01-14 02:26:33,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:26:33,376 INFO L706 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-01-14 02:26:33,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2019-01-14 02:26:33,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-01-14 02:26:33,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-14 02:26:33,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-01-14 02:26:33,379 INFO L729 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-01-14 02:26:33,379 INFO L609 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-01-14 02:26:33,379 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:26:33,379 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2019-01-14 02:26:33,380 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-14 02:26:33,380 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:26:33,380 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:26:33,380 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:26:33,381 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:26:33,381 INFO L794 eck$LassoCheckResult]: Stem: 304#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 295#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~nondet13, main_#t~mem14, main_#t~mem15, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~d~0.base, main_~d~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~d~0.base, main_~d~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 296#L552-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 311#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 297#L551-3 main_#t~short9 := main_#t~short7; 298#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 309#L551-6 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~short9; 305#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10;call write~int(main_#t~nondet13, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet13;call main_#t~mem14 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem14 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~d~0.base, main_~d~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~d~0.base, main_~d~0.offset, 4);havoc main_#t~mem15; 306#L552-2 [2019-01-14 02:26:33,381 INFO L796 eck$LassoCheckResult]: Loop: 306#L552-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 310#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 314#L551-3 main_#t~short9 := main_#t~short7; 301#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 302#L551-6 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~short9; 313#L552 assume 0 != main_#t~nondet10;havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11;call write~int(main_#t~nondet12, main_~d~0.base, main_~d~0.offset, 4);havoc main_#t~nondet12; 306#L552-2 [2019-01-14 02:26:33,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:33,381 INFO L82 PathProgramCache]: Analyzing trace with hash 177626382, now seen corresponding path program 1 times [2019-01-14 02:26:33,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:26:33,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:26:33,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:33,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:26:33,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:33,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:33,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:33,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:33,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 2 times [2019-01-14 02:26:33,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:26:33,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:26:33,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:33,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:26:33,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:33,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:33,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:33,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:33,439 INFO L82 PathProgramCache]: Analyzing trace with hash -692497897, now seen corresponding path program 1 times [2019-01-14 02:26:33,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:26:33,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:26:33,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:33,440 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:26:33,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:33,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:33,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:33,897 WARN L181 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 63 [2019-01-14 02:26:34,013 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-01-14 02:26:34,450 WARN L181 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 101 [2019-01-14 02:26:34,595 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-01-14 02:26:34,602 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:26:34,602 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:26:34,602 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:26:34,602 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:26:34,602 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:26:34,602 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:26:34,603 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:26:34,603 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:26:34,603 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i_Iteration3_Lasso [2019-01-14 02:26:34,603 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:26:34,603 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:26:34,610 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-14 02:26:34,613 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-14 02:26:34,617 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-14 02:26:34,619 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-14 02:26:34,621 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-14 02:26:34,625 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-14 02:26:34,630 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-14 02:26:34,632 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-14 02:26:34,633 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-14 02:26:34,636 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-14 02:26:34,642 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-14 02:26:34,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-14 02:26:34,647 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-14 02:26:34,651 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-14 02:26:34,654 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-14 02:26:35,059 WARN L181 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2019-01-14 02:26:35,198 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-01-14 02:26:35,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:35,201 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-14 02:26:35,203 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-14 02:26:36,113 WARN L181 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-01-14 02:26:36,299 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:26:36,299 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:26:36,299 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-14 02:26:36,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:36,300 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:36,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:36,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:36,301 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:36,301 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:36,301 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:36,302 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:36,302 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-14 02:26:36,303 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:36,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:36,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:36,303 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:36,304 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:36,304 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:36,306 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:36,307 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-14 02:26:36,307 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:36,307 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:36,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:36,308 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:36,308 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:36,308 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:36,308 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:36,309 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:36,309 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-14 02:26:36,310 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:36,310 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:36,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:36,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:36,310 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:36,311 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:36,311 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:36,312 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:36,312 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-14 02:26:36,312 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:36,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:36,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:36,313 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:36,314 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:36,314 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:36,317 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:36,317 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-14 02:26:36,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:36,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:36,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:36,318 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:36,319 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:36,319 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:36,321 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:36,322 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-14 02:26:36,322 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:36,322 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:36,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:36,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:36,323 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:36,323 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:36,323 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:36,324 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:36,324 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-14 02:26:36,325 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:36,325 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:36,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:36,325 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:36,325 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:36,326 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:36,326 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:36,350 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:36,354 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-14 02:26:36,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:36,354 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:36,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:36,355 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 02:26:36,355 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:36,355 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:26:36,355 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:36,357 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:36,364 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:36,364 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:36,365 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:36,365 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:36,365 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:36,365 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:36,365 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:36,365 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:36,366 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:36,366 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:36,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:36,367 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:36,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:36,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:36,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:36,367 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:36,368 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:36,373 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:36,374 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:36,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:36,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:36,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:36,375 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:36,376 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:36,381 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:36,389 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:36,389 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:36,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:36,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:36,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:36,390 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:36,394 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:36,395 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:36,396 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:36,399 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-14 02:26:36,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:36,399 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:36,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:36,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:36,400 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:36,400 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:36,400 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:36,401 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:36,401 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-14 02:26:36,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:36,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:36,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:36,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:36,406 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:36,406 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:36,416 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:36,417 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-14 02:26:36,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:36,420 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2019-01-14 02:26:36,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:36,421 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:36,428 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-01-14 02:26:36,429 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:36,473 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:36,473 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-14 02:26:36,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:36,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:36,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:36,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:36,475 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:36,475 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:36,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:36,477 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-14 02:26:36,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:36,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:36,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:36,478 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:36,479 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:36,479 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:36,484 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:36,484 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-14 02:26:36,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:36,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:36,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:36,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:36,488 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:36,488 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:36,502 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:36,503 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-14 02:26:36,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:36,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:36,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:36,504 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:36,504 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:36,505 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:36,511 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:36,513 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-14 02:26:36,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:36,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:36,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:36,516 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:36,518 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:36,518 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:36,525 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:36,529 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-14 02:26:36,531 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:36,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:36,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:36,532 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:36,533 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:36,533 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:36,541 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:36,542 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-14 02:26:36,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:36,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:36,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:36,545 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:36,547 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:36,548 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:36,557 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:26:36,571 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:26:36,572 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-14 02:26:36,573 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:26:36,574 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:26:36,579 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:26:36,579 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2 Supporting invariants [] [2019-01-14 02:26:36,942 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2019-01-14 02:26:36,968 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:26:37,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:37,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:26:37,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:26:37,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:37,086 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 17 treesize of output 29 [2019-01-14 02:26:37,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:37,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:37,136 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 13 [2019-01-14 02:26:37,137 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:37,153 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:37,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:37,161 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2019-01-14 02:26:37,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:26:37,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:26:37,339 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-14 02:26:37,339 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-01-14 02:26:37,340 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 23 transitions. cyclomatic complexity: 5 Second operand 5 states. [2019-01-14 02:26:37,408 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 23 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 32 states and 37 transitions. Complement of second has 8 states. [2019-01-14 02:26:37,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 02:26:37,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:26:37,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2019-01-14 02:26:37,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 8 letters. Loop has 6 letters. [2019-01-14 02:26:37,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:26:37,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 14 letters. Loop has 6 letters. [2019-01-14 02:26:37,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:26:37,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 8 letters. Loop has 12 letters. [2019-01-14 02:26:37,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:26:37,413 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 37 transitions. [2019-01-14 02:26:37,415 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-14 02:26:37,415 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 37 transitions. [2019-01-14 02:26:37,416 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-01-14 02:26:37,416 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-01-14 02:26:37,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 37 transitions. [2019-01-14 02:26:37,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:26:37,416 INFO L706 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2019-01-14 02:26:37,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 37 transitions. [2019-01-14 02:26:37,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-01-14 02:26:37,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-14 02:26:37,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2019-01-14 02:26:37,420 INFO L729 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2019-01-14 02:26:37,420 INFO L609 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2019-01-14 02:26:37,420 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:26:37,420 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 37 transitions. [2019-01-14 02:26:37,421 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-14 02:26:37,421 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:26:37,421 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:26:37,422 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1] [2019-01-14 02:26:37,422 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:26:37,422 INFO L794 eck$LassoCheckResult]: Stem: 525#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 521#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~nondet13, main_#t~mem14, main_#t~mem15, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~d~0.base, main_~d~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~d~0.base, main_~d~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 522#L552-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 540#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 539#L551-3 main_#t~short9 := main_#t~short7; 538#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 537#L551-6 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~short9; 536#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10;call write~int(main_#t~nondet13, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet13;call main_#t~mem14 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem14 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~d~0.base, main_~d~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~d~0.base, main_~d~0.offset, 4);havoc main_#t~mem15; 535#L552-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 531#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 517#L551-3 main_#t~short9 := main_#t~short7; 518#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 523#L551-6 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~short9; 526#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10;call write~int(main_#t~nondet13, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet13;call main_#t~mem14 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem14 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~d~0.base, main_~d~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~d~0.base, main_~d~0.offset, 4);havoc main_#t~mem15; 527#L552-2 [2019-01-14 02:26:37,422 INFO L796 eck$LassoCheckResult]: Loop: 527#L552-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 533#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 548#L551-3 main_#t~short9 := main_#t~short7; 546#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 544#L551-6 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~short9; 542#L552 assume 0 != main_#t~nondet10;havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11;call write~int(main_#t~nondet12, main_~d~0.base, main_~d~0.offset, 4);havoc main_#t~nondet12; 527#L552-2 [2019-01-14 02:26:37,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:37,423 INFO L82 PathProgramCache]: Analyzing trace with hash -692497895, now seen corresponding path program 2 times [2019-01-14 02:26:37,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:26:37,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:26:37,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:37,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:26:37,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:37,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:37,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:37,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:37,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 3 times [2019-01-14 02:26:37,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:26:37,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:26:37,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:37,494 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:26:37,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:37,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:37,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:37,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:37,518 INFO L82 PathProgramCache]: Analyzing trace with hash 502600418, now seen corresponding path program 2 times [2019-01-14 02:26:37,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:26:37,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:26:37,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:37,519 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:26:37,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:37,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:37,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:37,923 WARN L181 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 63 [2019-01-14 02:26:39,109 WARN L181 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 190 DAG size of output: 138 [2019-01-14 02:26:39,523 WARN L181 SmtUtils]: Spent 314.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-14 02:26:39,527 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:26:39,527 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:26:39,528 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:26:39,528 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:26:39,528 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:26:39,528 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:26:39,528 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:26:39,528 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:26:39,528 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i_Iteration4_Lasso [2019-01-14 02:26:39,528 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:26:39,529 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:26:39,534 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-14 02:26:39,536 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-14 02:26:39,538 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-14 02:26:39,539 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-14 02:26:39,541 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-14 02:26:39,542 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-14 02:26:39,956 WARN L181 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2019-01-14 02:26:40,129 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-01-14 02:26:40,129 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-14 02:26:40,133 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-14 02:26:40,135 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-14 02:26:40,137 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-14 02:26:40,139 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-14 02:26:40,140 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-14 02:26:40,142 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-14 02:26:40,144 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-14 02:26:40,145 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-14 02:26:40,147 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-14 02:26:40,149 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-14 02:26:40,153 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-14 02:26:40,831 WARN L181 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-01-14 02:26:41,045 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:26:41,045 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:26:41,045 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-14 02:26:41,051 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:41,051 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:41,051 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:41,051 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:41,051 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:41,052 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:41,052 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:41,052 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:41,055 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-14 02:26:41,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:41,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:41,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:41,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:41,059 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:41,059 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:41,063 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:41,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-14 02:26:41,063 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:41,064 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:41,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:41,064 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:41,064 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:41,064 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:41,064 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:41,064 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:41,065 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-14 02:26:41,065 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:41,065 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:41,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:41,065 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:41,072 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:41,072 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:41,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:41,074 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-14 02:26:41,075 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:41,075 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:41,075 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:41,075 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:41,075 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:41,076 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:41,076 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:41,076 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:41,077 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:41,081 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:41,081 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:41,081 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:41,081 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:41,082 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:41,082 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:41,089 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:41,089 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-14 02:26:41,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:41,092 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2019-01-14 02:26:41,092 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:41,092 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:41,096 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-01-14 02:26:41,096 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:41,114 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:41,117 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-14 02:26:41,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:41,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:41,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:41,120 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:41,121 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:41,121 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:41,122 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:41,124 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:41,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:41,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:41,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:41,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:41,125 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:41,125 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:41,131 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:41,131 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:41,131 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:41,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:41,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:41,134 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:41,135 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:41,135 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:41,138 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:41,138 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:41,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:41,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:41,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:41,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:41,142 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:41,142 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:41,145 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:41,148 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:41,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:41,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:41,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:41,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:41,152 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:41,153 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:41,157 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:41,158 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:41,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:41,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:41,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:41,158 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:41,159 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:41,159 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:41,167 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:26:41,171 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:26:41,171 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:26:41,171 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:26:41,172 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:26:41,172 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:26:41,172 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3 Supporting invariants [] [2019-01-14 02:26:41,790 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2019-01-14 02:26:41,812 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:26:41,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:41,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:26:41,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:26:41,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:41,979 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 17 treesize of output 29 [2019-01-14 02:26:42,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:42,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:42,053 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 13 [2019-01-14 02:26:42,054 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:42,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:42,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:42,066 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2019-01-14 02:26:42,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:26:42,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:26:42,142 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-14 02:26:42,142 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-01-14 02:26:42,143 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 37 transitions. cyclomatic complexity: 8 Second operand 5 states. [2019-01-14 02:26:42,211 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 37 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 42 states and 49 transitions. Complement of second has 8 states. [2019-01-14 02:26:42,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 02:26:42,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:26:42,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2019-01-14 02:26:42,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 14 letters. Loop has 6 letters. [2019-01-14 02:26:42,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:26:42,213 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:26:42,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:42,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:26:42,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:26:42,382 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-14 02:26:42,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:42,405 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 17 treesize of output 29 [2019-01-14 02:26:42,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:42,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:42,429 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 13 [2019-01-14 02:26:42,429 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:42,433 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:42,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:42,439 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2019-01-14 02:26:42,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:26:42,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:26:42,591 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 16 [2019-01-14 02:26:42,608 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-14 02:26:42,609 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2019-01-14 02:26:42,609 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 37 transitions. cyclomatic complexity: 8 Second operand 5 states. [2019-01-14 02:26:42,718 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 37 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 42 states and 49 transitions. Complement of second has 8 states. [2019-01-14 02:26:42,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 02:26:42,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:26:42,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2019-01-14 02:26:42,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 14 letters. Loop has 6 letters. [2019-01-14 02:26:42,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:26:42,721 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:26:42,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:42,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:26:42,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:26:42,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:42,797 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 17 treesize of output 29 [2019-01-14 02:26:42,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:42,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:42,836 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 13 [2019-01-14 02:26:42,837 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:42,843 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:42,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:42,850 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2019-01-14 02:26:42,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:26:42,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:26:42,903 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-14 02:26:42,904 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-01-14 02:26:42,904 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 37 transitions. cyclomatic complexity: 8 Second operand 5 states. [2019-01-14 02:26:42,970 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 37 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 48 states and 56 transitions. Complement of second has 7 states. [2019-01-14 02:26:42,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 02:26:42,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:26:42,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2019-01-14 02:26:42,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 14 letters. Loop has 6 letters. [2019-01-14 02:26:42,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:26:42,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 20 letters. Loop has 6 letters. [2019-01-14 02:26:42,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:26:42,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 14 letters. Loop has 12 letters. [2019-01-14 02:26:42,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:26:42,975 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 56 transitions. [2019-01-14 02:26:42,977 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-01-14 02:26:42,978 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 38 states and 44 transitions. [2019-01-14 02:26:42,978 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-01-14 02:26:42,978 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-01-14 02:26:42,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 44 transitions. [2019-01-14 02:26:42,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:26:42,980 INFO L706 BuchiCegarLoop]: Abstraction has 38 states and 44 transitions. [2019-01-14 02:26:42,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 44 transitions. [2019-01-14 02:26:42,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 14. [2019-01-14 02:26:42,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-14 02:26:42,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-01-14 02:26:42,985 INFO L729 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-01-14 02:26:42,985 INFO L609 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-01-14 02:26:42,985 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 02:26:42,985 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2019-01-14 02:26:42,987 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-01-14 02:26:42,987 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:26:42,987 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:26:42,988 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:26:42,988 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:26:42,988 INFO L794 eck$LassoCheckResult]: Stem: 1024#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1020#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~nondet13, main_#t~mem14, main_#t~mem15, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~d~0.base, main_~d~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~d~0.base, main_~d~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 1021#L552-2 [2019-01-14 02:26:42,988 INFO L796 eck$LassoCheckResult]: Loop: 1021#L552-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 1028#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 1016#L551-3 main_#t~short9 := main_#t~short7; 1017#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 1022#L551-6 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~short9; 1025#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10;call write~int(main_#t~nondet13, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet13;call main_#t~mem14 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem14 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~d~0.base, main_~d~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~d~0.base, main_~d~0.offset, 4);havoc main_#t~mem15; 1021#L552-2 [2019-01-14 02:26:42,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:42,988 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-01-14 02:26:42,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:26:42,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:26:42,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:42,993 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:26:42,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:42,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:43,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:43,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:43,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577164, now seen corresponding path program 1 times [2019-01-14 02:26:43,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:26:43,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:26:43,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:43,005 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:26:43,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:43,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:43,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:43,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:43,020 INFO L82 PathProgramCache]: Analyzing trace with hash 177626382, now seen corresponding path program 3 times [2019-01-14 02:26:43,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:26:43,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:26:43,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:43,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:26:43,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:43,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:43,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:43,476 WARN L181 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 68 [2019-01-14 02:26:43,703 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-01-14 02:26:43,779 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:26:43,779 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:26:43,779 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:26:43,779 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:26:43,779 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:26:43,779 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:26:43,780 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:26:43,780 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:26:43,780 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i_Iteration5_Lasso [2019-01-14 02:26:43,780 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:26:43,780 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:26:43,789 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-14 02:26:43,829 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-14 02:26:43,853 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-14 02:26:43,862 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-14 02:26:43,863 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-14 02:26:43,864 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-14 02:26:43,871 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-14 02:26:43,873 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-14 02:26:43,874 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-14 02:26:43,875 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-14 02:26:43,876 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-14 02:26:43,882 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-14 02:26:43,884 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-14 02:26:43,885 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-14 02:26:43,911 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-14 02:26:43,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-14 02:26:44,189 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2019-01-14 02:26:44,327 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-01-14 02:26:44,327 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-14 02:26:45,260 WARN L181 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-01-14 02:26:45,279 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:26:45,279 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:26:45,279 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-14 02:26:45,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:45,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:45,280 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:45,280 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:45,285 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:45,285 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:45,287 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:45,288 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-14 02:26:45,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:45,288 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:45,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:45,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:45,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:45,291 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:45,292 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:45,292 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:45,292 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-14 02:26:45,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:45,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:45,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:45,293 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:45,294 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:45,294 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:45,295 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:45,295 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-14 02:26:45,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:45,295 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:45,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:45,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:45,300 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:45,300 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:45,300 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:45,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:45,301 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-14 02:26:45,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:45,302 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:45,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:45,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:45,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:45,302 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:45,302 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:45,308 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:45,308 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-14 02:26:45,309 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:45,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:45,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:45,309 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:45,310 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:45,310 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:45,311 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:45,311 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-14 02:26:45,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:45,316 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:45,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:45,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:45,316 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:45,317 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:45,317 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:45,317 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:45,318 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-14 02:26:45,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:45,318 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:45,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:45,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:45,323 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:45,323 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:45,323 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:45,324 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:45,324 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-14 02:26:45,325 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:45,325 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:45,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:45,325 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:45,325 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:45,325 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:45,325 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:45,328 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:45,328 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-14 02:26:45,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:45,329 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:45,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:45,329 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:45,329 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:45,330 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:45,330 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:45,330 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:45,330 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-14 02:26:45,334 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:45,334 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:45,334 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:45,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:45,335 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:45,335 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:45,335 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:45,335 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:45,339 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-14 02:26:45,339 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:45,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:45,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:45,340 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:45,340 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:45,340 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:45,341 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:45,345 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:45,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:45,345 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:45,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:45,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:45,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:45,346 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:45,346 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:45,346 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:45,347 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:45,347 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:45,347 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:45,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:45,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:45,348 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:45,350 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:45,350 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:45,351 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:45,351 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:45,351 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:45,351 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:45,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:45,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:45,354 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:45,354 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:45,354 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:45,355 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:45,355 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:45,356 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:45,356 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:45,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:45,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:45,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:45,357 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:45,357 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:45,358 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:45,358 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:45,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:45,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:45,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:45,359 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:45,359 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:45,360 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:45,361 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:45,361 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:45,361 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:45,362 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:45,362 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:45,362 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:45,363 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:45,363 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:45,369 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:45,369 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:45,370 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:45,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:45,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:45,370 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:45,371 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:45,371 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:45,379 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:45,380 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-14 02:26:45,380 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:45,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:45,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:45,380 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:45,381 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:45,381 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:45,387 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:45,388 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-14 02:26:45,388 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:45,388 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:45,388 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:45,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:45,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:45,389 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:45,389 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:45,390 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:26:45,391 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:26:45,392 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:26:45,396 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:26:45,396 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:26:45,397 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:26:45,397 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~d~0.base) ULTIMATE.start_main_~d~0.offset)_4) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~d~0.base) ULTIMATE.start_main_~d~0.offset)_4 Supporting invariants [] [2019-01-14 02:26:45,863 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2019-01-14 02:26:45,866 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:26:45,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:45,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:26:45,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:26:45,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:26:45,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:26:45,949 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-14 02:26:45,950 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-14 02:26:45,950 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 16 transitions. cyclomatic complexity: 3 Second operand 5 states. [2019-01-14 02:26:46,012 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 16 transitions. cyclomatic complexity: 3. Second operand 5 states. Result 36 states and 42 transitions. Complement of second has 9 states. [2019-01-14 02:26:46,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 02:26:46,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:26:46,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 8 transitions. [2019-01-14 02:26:46,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 2 letters. Loop has 6 letters. [2019-01-14 02:26:46,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:26:46,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 8 letters. Loop has 6 letters. [2019-01-14 02:26:46,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:26:46,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 2 letters. Loop has 12 letters. [2019-01-14 02:26:46,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:26:46,016 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 42 transitions. [2019-01-14 02:26:46,018 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-01-14 02:26:46,018 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 26 states and 30 transitions. [2019-01-14 02:26:46,018 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-01-14 02:26:46,018 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-01-14 02:26:46,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 30 transitions. [2019-01-14 02:26:46,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:26:46,019 INFO L706 BuchiCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-01-14 02:26:46,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 30 transitions. [2019-01-14 02:26:46,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2019-01-14 02:26:46,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-14 02:26:46,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-01-14 02:26:46,021 INFO L729 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-01-14 02:26:46,021 INFO L609 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-01-14 02:26:46,021 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 02:26:46,021 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 25 transitions. [2019-01-14 02:26:46,022 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-01-14 02:26:46,022 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:26:46,022 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:26:46,022 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:26:46,022 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:26:46,023 INFO L794 eck$LassoCheckResult]: Stem: 1225#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1219#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~nondet13, main_#t~mem14, main_#t~mem15, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~d~0.base, main_~d~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~d~0.base, main_~d~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 1220#L552-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 1233#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 1223#L551-3 main_#t~short9 := main_#t~short7; 1224#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 1227#L551-6 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~short9; 1230#L552 assume 0 != main_#t~nondet10;havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11;call write~int(main_#t~nondet12, main_~d~0.base, main_~d~0.offset, 4);havoc main_#t~nondet12; 1231#L552-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 1235#L551-1 [2019-01-14 02:26:46,023 INFO L796 eck$LassoCheckResult]: Loop: 1235#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 1221#L551-3 main_#t~short9 := main_#t~short7; 1222#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 1226#L551-6 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~short9; 1228#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10;call write~int(main_#t~nondet13, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet13;call main_#t~mem14 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem14 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~d~0.base, main_~d~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~d~0.base, main_~d~0.offset, 4);havoc main_#t~mem15; 1229#L552-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 1235#L551-1 [2019-01-14 02:26:46,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:46,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1211450491, now seen corresponding path program 2 times [2019-01-14 02:26:46,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:26:46,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:26:46,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:46,024 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:26:46,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:46,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:46,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:46,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:46,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1187255894, now seen corresponding path program 2 times [2019-01-14 02:26:46,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:26:46,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:26:46,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:46,041 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:26:46,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:46,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:46,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:46,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:46,051 INFO L82 PathProgramCache]: Analyzing trace with hash 816748368, now seen corresponding path program 3 times [2019-01-14 02:26:46,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:26:46,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:26:46,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:46,052 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:26:46,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:46,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:46,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:46,404 WARN L181 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 75 [2019-01-14 02:26:46,587 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-01-14 02:26:47,106 WARN L181 SmtUtils]: Spent 518.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 113 [2019-01-14 02:26:48,077 WARN L181 SmtUtils]: Spent 955.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 97 [2019-01-14 02:26:48,082 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:26:48,082 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:26:48,082 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:26:48,082 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:26:48,082 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:26:48,082 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:26:48,083 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:26:48,083 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:26:48,083 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i_Iteration6_Lasso [2019-01-14 02:26:48,083 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:26:48,083 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:26:48,092 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-14 02:26:48,095 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-14 02:26:48,097 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-14 02:26:48,098 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-14 02:26:48,100 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-14 02:26:48,102 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-14 02:26:48,103 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-14 02:26:48,846 WARN L181 SmtUtils]: Spent 621.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 75 [2019-01-14 02:26:49,754 WARN L181 SmtUtils]: Spent 896.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-01-14 02:26:49,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:49,757 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-14 02:26:49,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:49,760 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-14 02:26:49,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:49,764 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-14 02:26:49,765 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-14 02:26:49,766 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-14 02:26:49,768 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-14 02:26:49,771 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-14 02:26:50,164 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2019-01-14 02:26:50,917 WARN L181 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-01-14 02:26:51,019 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:26:51,019 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:26:51,020 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-14 02:26:51,020 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:51,020 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:51,020 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:51,020 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:51,021 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:51,021 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:51,028 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:51,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-14 02:26:51,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:51,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:51,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:51,029 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:51,034 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:51,035 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:51,035 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:51,037 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-14 02:26:51,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:51,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:51,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:51,038 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:51,040 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:51,040 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:51,042 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:51,045 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-14 02:26:51,046 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:51,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:51,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:51,046 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:51,046 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:51,046 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:51,047 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:51,048 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-14 02:26:51,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:51,048 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:51,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:51,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:51,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:51,052 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:51,052 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:51,052 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:51,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-14 02:26:51,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:51,053 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:51,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:51,053 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:51,053 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:51,054 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:51,054 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:51,057 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:51,058 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-14 02:26:51,058 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:51,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:51,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:51,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:51,059 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:51,059 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:51,065 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:51,065 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-14 02:26:51,065 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:51,065 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:51,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:51,068 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:51,068 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:51,069 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:51,075 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:26:51,080 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:26:51,080 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:26:51,081 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:26:51,081 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:26:51,082 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:26:51,082 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~d~0.base) ULTIMATE.start_main_~d~0.offset)_5) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~d~0.base) ULTIMATE.start_main_~d~0.offset)_5 Supporting invariants [] [2019-01-14 02:26:51,299 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2019-01-14 02:26:51,302 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:26:51,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:51,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:26:51,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:26:51,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:51,351 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 17 treesize of output 29 [2019-01-14 02:26:51,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:51,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:51,374 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 13 [2019-01-14 02:26:51,375 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:51,379 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:51,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:51,386 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2019-01-14 02:26:51,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:26:51,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:26:51,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 80 [2019-01-14 02:26:51,617 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:26:51,617 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:51,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:51,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 59 [2019-01-14 02:26:51,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2019-01-14 02:26:51,653 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:51,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:51,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2019-01-14 02:26:51,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:51,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2019-01-14 02:26:51,684 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:51,694 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:51,703 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:51,714 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:51,740 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 90 [2019-01-14 02:26:51,792 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:26:51,792 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:51,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:51,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 73 [2019-01-14 02:26:51,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:51,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2019-01-14 02:26:51,863 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:51,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:51,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2019-01-14 02:26:51,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:51,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2019-01-14 02:26:51,892 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:51,900 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:51,909 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:51,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:51,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 65 [2019-01-14 02:26:51,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:51,923 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 38 [2019-01-14 02:26:51,924 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:51,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:51,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2019-01-14 02:26:51,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:51,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 24 [2019-01-14 02:26:51,951 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:51,957 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:51,966 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:51,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:51,996 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 84 [2019-01-14 02:26:52,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:52,002 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 77 treesize of output 70 [2019-01-14 02:26:52,003 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:52,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:52,165 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 52 treesize of output 61 [2019-01-14 02:26:52,166 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:52,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:52,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:52,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:52,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:52,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 87 [2019-01-14 02:26:52,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:52,271 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:26:52,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:52,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:52,281 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 100 [2019-01-14 02:26:52,281 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:52,304 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:52,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:52,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 52 [2019-01-14 02:26:52,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:52,460 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 33 treesize of output 22 [2019-01-14 02:26:52,461 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:52,476 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:52,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:52,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 70 [2019-01-14 02:26:52,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:52,561 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 45 treesize of output 44 [2019-01-14 02:26:52,561 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:52,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 39 [2019-01-14 02:26:52,619 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:52,650 INFO L267 ElimStorePlain]: Start of recursive call 25: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:26:52,670 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:52,706 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:26:52,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 126 treesize of output 101 [2019-01-14 02:26:53,367 WARN L181 SmtUtils]: Spent 612.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 96 [2019-01-14 02:26:53,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 83 [2019-01-14 02:26:53,371 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:53,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 83 [2019-01-14 02:26:53,376 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:53,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 85 [2019-01-14 02:26:53,380 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:53,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 74 [2019-01-14 02:26:53,866 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:54,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:54,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:54,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 83 [2019-01-14 02:26:54,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:54,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 81 [2019-01-14 02:26:54,364 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:54,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:54,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:54,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:54,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 84 [2019-01-14 02:26:54,442 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 71 [2019-01-14 02:26:54,447 INFO L267 ElimStorePlain]: Start of recursive call 36: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-14 02:26:54,475 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:54,490 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:54,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:54,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:54,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 100 [2019-01-14 02:26:54,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:54,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 90 [2019-01-14 02:26:54,534 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:54,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:54,634 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 56 treesize of output 61 [2019-01-14 02:26:54,636 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:54,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:54,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:54,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:54,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 77 [2019-01-14 02:26:54,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:54,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2019-01-14 02:26:54,736 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:54,753 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:54,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:54,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 51 [2019-01-14 02:26:54,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:54,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2019-01-14 02:26:54,927 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:54,943 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:54,973 INFO L267 ElimStorePlain]: Start of recursive call 37: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:26:54,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:54,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:55,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 78 treesize of output 111 [2019-01-14 02:26:55,049 WARN L307 Elim1Store]: Array PQE input equivalent to false [2019-01-14 02:26:55,049 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:55,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:55,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 78 [2019-01-14 02:26:55,897 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:56,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:56,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 65 [2019-01-14 02:26:56,660 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:57,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:57,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 92 [2019-01-14 02:26:57,424 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 2 xjuncts. [2019-01-14 02:26:58,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:58,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:58,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:58,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:58,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:58,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:58,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 100 [2019-01-14 02:26:58,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:58,314 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:26:58,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:58,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:58,348 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 3 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 122 [2019-01-14 02:26:58,350 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 2 xjuncts. [2019-01-14 02:26:58,437 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:26:59,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:59,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:59,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:59,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 98 [2019-01-14 02:26:59,035 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:59,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:59,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 55 [2019-01-14 02:26:59,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:59,509 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 33 treesize of output 22 [2019-01-14 02:26:59,509 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:59,522 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:59,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:59,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:59,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:59,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 93 [2019-01-14 02:26:59,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:59,893 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 76 treesize of output 65 [2019-01-14 02:26:59,894 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:59,955 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:27:00,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:00,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:00,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:00,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 81 [2019-01-14 02:27:00,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:00,279 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 33 treesize of output 22 [2019-01-14 02:27:00,280 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:00,313 INFO L267 ElimStorePlain]: Start of recursive call 56: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:00,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:00,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:00,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:00,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:00,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 109 [2019-01-14 02:27:00,649 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 99 [2019-01-14 02:27:00,650 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:00,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:00,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:00,785 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 73 [2019-01-14 02:27:00,785 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:00,828 INFO L267 ElimStorePlain]: Start of recursive call 58: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:27:00,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:00,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:00,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:00,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 90 [2019-01-14 02:27:00,869 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 83 [2019-01-14 02:27:00,869 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:00,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:00,952 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 51 treesize of output 56 [2019-01-14 02:27:00,953 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:00,990 INFO L267 ElimStorePlain]: Start of recursive call 61: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:27:01,519 INFO L267 ElimStorePlain]: Start of recursive call 44: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 6 xjuncts. [2019-01-14 02:27:01,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:01,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 99 [2019-01-14 02:27:02,008 WARN L307 Elim1Store]: Array PQE input equivalent to false [2019-01-14 02:27:02,008 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:02,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:02,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 70 [2019-01-14 02:27:02,822 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:03,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:03,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 65 [2019-01-14 02:27:03,509 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:04,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:04,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 65 [2019-01-14 02:27:04,156 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:04,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:04,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 55 [2019-01-14 02:27:04,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:04,931 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 33 treesize of output 22 [2019-01-14 02:27:04,932 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:04,944 INFO L267 ElimStorePlain]: Start of recursive call 69: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:05,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:05,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:05,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:05,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:05,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 91 [2019-01-14 02:27:05,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:05,408 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:27:05,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:05,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:05,420 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 96 [2019-01-14 02:27:05,421 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:05,452 INFO L267 ElimStorePlain]: Start of recursive call 71: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:05,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:05,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:05,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:05,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 84 [2019-01-14 02:27:05,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:05,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:05,685 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:27:05,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:05,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:05,718 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 122 [2019-01-14 02:27:05,719 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 2 xjuncts. [2019-01-14 02:27:05,797 INFO L267 ElimStorePlain]: Start of recursive call 73: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:27:05,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:05,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:05,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:06,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 93 [2019-01-14 02:27:06,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:06,018 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 84 treesize of output 73 [2019-01-14 02:27:06,019 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:06,079 INFO L267 ElimStorePlain]: Start of recursive call 75: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:27:06,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:06,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 55 [2019-01-14 02:27:06,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:06,990 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 33 treesize of output 22 [2019-01-14 02:27:06,990 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:07,003 INFO L267 ElimStorePlain]: Start of recursive call 77: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:07,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:07,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 52 [2019-01-14 02:27:07,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:07,129 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 33 treesize of output 22 [2019-01-14 02:27:07,130 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:07,141 INFO L267 ElimStorePlain]: Start of recursive call 79: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:07,170 INFO L267 ElimStorePlain]: Start of recursive call 64: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:07,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:07,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 69 [2019-01-14 02:27:07,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:07,184 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 48 treesize of output 38 [2019-01-14 02:27:07,185 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:07,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:07,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2019-01-14 02:27:07,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:07,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 24 [2019-01-14 02:27:07,219 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:07,226 INFO L267 ElimStorePlain]: Start of recursive call 83: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:07,240 INFO L267 ElimStorePlain]: Start of recursive call 81: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:07,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:07,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 88 [2019-01-14 02:27:07,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:07,282 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 77 treesize of output 70 [2019-01-14 02:27:07,282 INFO L267 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:07,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:07,372 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 56 treesize of output 61 [2019-01-14 02:27:07,373 INFO L267 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:07,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:07,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 51 [2019-01-14 02:27:07,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:07,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2019-01-14 02:27:07,461 INFO L267 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:07,472 INFO L267 ElimStorePlain]: Start of recursive call 88: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:07,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:07,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:07,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:07,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 80 [2019-01-14 02:27:07,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:07,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2019-01-14 02:27:07,561 INFO L267 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:07,582 INFO L267 ElimStorePlain]: Start of recursive call 90: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:07,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:07,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 52 [2019-01-14 02:27:07,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:07,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2019-01-14 02:27:07,648 INFO L267 ElimStorePlain]: Start of recursive call 93: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:07,660 INFO L267 ElimStorePlain]: Start of recursive call 92: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:07,685 INFO L267 ElimStorePlain]: Start of recursive call 85: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:07,846 INFO L267 ElimStorePlain]: Start of recursive call 28: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:27:07,923 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:27:07,923 INFO L202 ElimStorePlain]: Needed 93 recursive calls to eliminate 5 variables, input treesize:150, output treesize:45 [2019-01-14 02:27:07,947 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-14 02:27:07,947 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2019-01-14 02:27:07,947 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 25 transitions. cyclomatic complexity: 6 Second operand 7 states. [2019-01-14 02:27:08,012 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 25 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 38 states and 44 transitions. Complement of second has 10 states. [2019-01-14 02:27:08,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 02:27:08,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 02:27:08,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 10 transitions. [2019-01-14 02:27:08,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 9 letters. Loop has 6 letters. [2019-01-14 02:27:08,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:27:08,014 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:27:08,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:27:08,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:27:08,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:27:08,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:08,143 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 17 treesize of output 29 [2019-01-14 02:27:08,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:08,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:08,164 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 13 [2019-01-14 02:27:08,165 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:08,169 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:08,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:08,175 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2019-01-14 02:27:08,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:27:08,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:27:08,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 90 [2019-01-14 02:27:08,352 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:27:08,352 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:08,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:08,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 73 [2019-01-14 02:27:08,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:08,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2019-01-14 02:27:08,417 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:08,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:08,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2019-01-14 02:27:08,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:08,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2019-01-14 02:27:08,445 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:08,450 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:08,468 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:08,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:08,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 65 [2019-01-14 02:27:08,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:08,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 38 [2019-01-14 02:27:08,482 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:08,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:08,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2019-01-14 02:27:08,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:08,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 24 [2019-01-14 02:27:08,532 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:08,553 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:08,565 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:08,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:08,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 84 [2019-01-14 02:27:08,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:08,819 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 77 treesize of output 70 [2019-01-14 02:27:08,820 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:08,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:08,972 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 52 treesize of output 61 [2019-01-14 02:27:08,973 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:09,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:09,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 51 [2019-01-14 02:27:09,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:09,076 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 33 treesize of output 22 [2019-01-14 02:27:09,076 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:09,086 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:09,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:09,145 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 48 [2019-01-14 02:27:09,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:09,149 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 33 treesize of output 22 [2019-01-14 02:27:09,150 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:09,158 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:09,186 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:09,225 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:27:09,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 126 treesize of output 101 [2019-01-14 02:27:10,094 WARN L181 SmtUtils]: Spent 816.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 96 [2019-01-14 02:27:10,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 85 [2019-01-14 02:27:10,097 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:10,100 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 83 [2019-01-14 02:27:10,101 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:10,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 83 [2019-01-14 02:27:10,104 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:10,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 74 [2019-01-14 02:27:10,613 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:11,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:11,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:11,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 78 treesize of output 111 [2019-01-14 02:27:11,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:11,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 108 [2019-01-14 02:27:11,223 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 2 xjuncts. [2019-01-14 02:27:12,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:12,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 78 [2019-01-14 02:27:12,247 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:13,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:13,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 65 [2019-01-14 02:27:13,143 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:14,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:14,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:14,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:14,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 84 [2019-01-14 02:27:14,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:14,685 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 33 treesize of output 22 [2019-01-14 02:27:14,686 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:14,707 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:15,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:15,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:15,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:15,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:15,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 117 [2019-01-14 02:27:15,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 96 [2019-01-14 02:27:15,247 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:15,327 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:27:16,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:16,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:16,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:16,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:16,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:16,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:16,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 100 [2019-01-14 02:27:16,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:16,141 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:27:16,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:16,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:16,173 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 3 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 122 [2019-01-14 02:27:16,175 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 2 xjuncts. [2019-01-14 02:27:16,352 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:27:16,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:16,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:16,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:16,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 84 [2019-01-14 02:27:16,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:16,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:16,732 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:27:16,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:16,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:16,762 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 122 [2019-01-14 02:27:16,763 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 2 xjuncts. [2019-01-14 02:27:16,843 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:27:17,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:17,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:17,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:17,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 81 [2019-01-14 02:27:17,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:17,195 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 33 treesize of output 22 [2019-01-14 02:27:17,196 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:17,215 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:17,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:17,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 55 [2019-01-14 02:27:17,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:17,761 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 33 treesize of output 22 [2019-01-14 02:27:17,762 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:17,773 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:17,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:17,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:18,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:18,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 90 [2019-01-14 02:27:18,030 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 83 [2019-01-14 02:27:18,031 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:18,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:18,130 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 51 treesize of output 56 [2019-01-14 02:27:18,131 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:18,179 INFO L267 ElimStorePlain]: Start of recursive call 40: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:27:18,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:18,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:18,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:18,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:18,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 109 [2019-01-14 02:27:18,229 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 99 [2019-01-14 02:27:18,230 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:18,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:18,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:18,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 73 [2019-01-14 02:27:18,742 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:18,782 INFO L267 ElimStorePlain]: Start of recursive call 43: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:27:18,940 INFO L267 ElimStorePlain]: Start of recursive call 24: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 6 xjuncts. [2019-01-14 02:27:18,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:18,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:18,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 100 [2019-01-14 02:27:18,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:18,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 90 [2019-01-14 02:27:18,994 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:19,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:19,096 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 56 treesize of output 61 [2019-01-14 02:27:19,098 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:19,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:19,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:19,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:19,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 77 [2019-01-14 02:27:19,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:19,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2019-01-14 02:27:19,214 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:19,231 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:19,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:19,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 51 [2019-01-14 02:27:19,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:19,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2019-01-14 02:27:19,314 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:19,324 INFO L267 ElimStorePlain]: Start of recursive call 51: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:19,354 INFO L267 ElimStorePlain]: Start of recursive call 46: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:27:19,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:19,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:19,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 83 [2019-01-14 02:27:19,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:19,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 81 [2019-01-14 02:27:19,373 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:19,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:19,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:19,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:19,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 84 [2019-01-14 02:27:19,427 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 71 [2019-01-14 02:27:19,430 INFO L267 ElimStorePlain]: Start of recursive call 56: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-14 02:27:19,457 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:19,473 INFO L267 ElimStorePlain]: Start of recursive call 53: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:19,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:19,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 99 [2019-01-14 02:27:19,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:19,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 73 [2019-01-14 02:27:19,947 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:20,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:20,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 65 [2019-01-14 02:27:20,987 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:21,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:21,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 70 [2019-01-14 02:27:21,738 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:23,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:23,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:23,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:23,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 84 [2019-01-14 02:27:23,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:23,094 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 33 treesize of output 22 [2019-01-14 02:27:23,095 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:23,113 INFO L267 ElimStorePlain]: Start of recursive call 61: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:23,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:23,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 60 [2019-01-14 02:27:23,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:23,545 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 33 treesize of output 22 [2019-01-14 02:27:23,546 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:23,558 INFO L267 ElimStorePlain]: Start of recursive call 63: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:23,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:23,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:23,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:23,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:23,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 117 [2019-01-14 02:27:23,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 95 [2019-01-14 02:27:23,920 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:23,991 INFO L267 ElimStorePlain]: Start of recursive call 65: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:27:24,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:24,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:24,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:24,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 84 [2019-01-14 02:27:24,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:24,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:24,413 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:27:24,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:24,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:24,447 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 122 [2019-01-14 02:27:24,448 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 2 xjuncts. [2019-01-14 02:27:24,528 INFO L267 ElimStorePlain]: Start of recursive call 67: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:27:24,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:24,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 55 [2019-01-14 02:27:24,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:24,699 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 33 treesize of output 22 [2019-01-14 02:27:24,700 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:24,715 INFO L267 ElimStorePlain]: Start of recursive call 69: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:24,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:24,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 70 [2019-01-14 02:27:24,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 59 [2019-01-14 02:27:24,849 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:24,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:24,910 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 41 treesize of output 40 [2019-01-14 02:27:24,911 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:24,943 INFO L267 ElimStorePlain]: Start of recursive call 71: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:27:24,973 INFO L267 ElimStorePlain]: Start of recursive call 57: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:24,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:24,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 69 [2019-01-14 02:27:24,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:24,988 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 48 treesize of output 38 [2019-01-14 02:27:24,989 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:25,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:25,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2019-01-14 02:27:25,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:25,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 24 [2019-01-14 02:27:25,022 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:25,032 INFO L267 ElimStorePlain]: Start of recursive call 76: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:25,045 INFO L267 ElimStorePlain]: Start of recursive call 74: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:25,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:25,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 88 [2019-01-14 02:27:25,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:25,090 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 77 treesize of output 70 [2019-01-14 02:27:25,091 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:25,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:25,186 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 56 treesize of output 61 [2019-01-14 02:27:25,187 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:25,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:25,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 56 [2019-01-14 02:27:25,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:25,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2019-01-14 02:27:25,273 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:25,288 INFO L267 ElimStorePlain]: Start of recursive call 81: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:25,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:25,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 51 [2019-01-14 02:27:25,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:25,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2019-01-14 02:27:25,339 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:25,353 INFO L267 ElimStorePlain]: Start of recursive call 83: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:25,387 INFO L267 ElimStorePlain]: Start of recursive call 78: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:25,521 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:27:25,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 80 [2019-01-14 02:27:25,590 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:27:25,591 INFO L267 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:25,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:25,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 59 [2019-01-14 02:27:25,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2019-01-14 02:27:25,645 INFO L267 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:25,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:25,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2019-01-14 02:27:25,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:25,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2019-01-14 02:27:25,698 INFO L267 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:25,706 INFO L267 ElimStorePlain]: Start of recursive call 89: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:25,715 INFO L267 ElimStorePlain]: Start of recursive call 87: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:25,727 INFO L267 ElimStorePlain]: Start of recursive call 85: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:25,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:27:25,839 INFO L202 ElimStorePlain]: Needed 90 recursive calls to eliminate 5 variables, input treesize:150, output treesize:45 [2019-01-14 02:27:25,891 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-14 02:27:25,892 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2019-01-14 02:27:25,892 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 25 transitions. cyclomatic complexity: 6 Second operand 7 states. [2019-01-14 02:27:26,019 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 25 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 35 states and 39 transitions. Complement of second has 12 states. [2019-01-14 02:27:26,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2019-01-14 02:27:26,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 02:27:26,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2019-01-14 02:27:26,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. Stem has 9 letters. Loop has 6 letters. [2019-01-14 02:27:26,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:27:26,021 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:27:26,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:27:26,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:27:26,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:27:26,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:26,150 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 17 treesize of output 29 [2019-01-14 02:27:26,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:26,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:26,192 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 13 [2019-01-14 02:27:26,192 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:26,203 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:26,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:26,208 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2019-01-14 02:27:26,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:27:26,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:27:26,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 80 [2019-01-14 02:27:26,393 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:27:26,393 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:26,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:26,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 59 [2019-01-14 02:27:26,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2019-01-14 02:27:26,423 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:26,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:26,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2019-01-14 02:27:26,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:26,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2019-01-14 02:27:26,447 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:26,455 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:26,462 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:26,473 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:26,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 90 [2019-01-14 02:27:26,544 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:27:26,545 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:26,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:26,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 65 [2019-01-14 02:27:26,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:26,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 38 [2019-01-14 02:27:26,620 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:26,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:26,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2019-01-14 02:27:26,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:26,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 24 [2019-01-14 02:27:26,644 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:26,652 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:26,662 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:26,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:26,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 73 [2019-01-14 02:27:26,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:26,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2019-01-14 02:27:26,682 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:26,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:26,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2019-01-14 02:27:26,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:26,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2019-01-14 02:27:26,707 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:26,713 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:26,721 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:26,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:26,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 84 [2019-01-14 02:27:26,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:26,785 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 77 treesize of output 70 [2019-01-14 02:27:26,786 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:26,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:26,876 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 52 treesize of output 61 [2019-01-14 02:27:26,876 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:26,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:26,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 51 [2019-01-14 02:27:26,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:26,958 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 33 treesize of output 22 [2019-01-14 02:27:26,959 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:26,971 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:27,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:27,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:27,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:27,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:27,210 INFO L303 Elim1Store]: Index analysis took 177 ms [2019-01-14 02:27:27,211 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 87 [2019-01-14 02:27:27,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:27,245 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:27:27,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:27,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:27,262 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 96 [2019-01-14 02:27:27,263 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:27,289 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:27,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:27,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 48 [2019-01-14 02:27:27,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:27,346 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 33 treesize of output 22 [2019-01-14 02:27:27,346 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:27,354 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:27,375 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:27,434 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:27:27,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 126 treesize of output 101 [2019-01-14 02:27:28,277 WARN L181 SmtUtils]: Spent 797.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 96 [2019-01-14 02:27:28,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 85 [2019-01-14 02:27:28,280 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:28,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 83 [2019-01-14 02:27:28,283 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:28,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 83 [2019-01-14 02:27:28,287 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:28,762 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 74 [2019-01-14 02:27:28,763 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:29,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:29,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:29,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 83 [2019-01-14 02:27:29,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:29,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 81 [2019-01-14 02:27:29,248 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:29,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:29,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:29,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:29,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 84 [2019-01-14 02:27:29,314 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 71 [2019-01-14 02:27:29,317 INFO L267 ElimStorePlain]: Start of recursive call 35: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-14 02:27:29,343 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:29,359 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:29,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:29,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:29,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 100 [2019-01-14 02:27:29,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:29,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 88 treesize of output 86 [2019-01-14 02:27:29,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:29,418 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 45 [2019-01-14 02:27:29,420 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 02:27:29,440 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:29,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:29,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 74 [2019-01-14 02:27:29,547 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:29,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:29,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:29,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:29,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 80 [2019-01-14 02:27:29,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:29,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2019-01-14 02:27:29,636 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:29,654 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:29,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:29,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 51 [2019-01-14 02:27:29,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:29,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2019-01-14 02:27:29,722 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:29,733 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:29,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:29,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:29,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:29,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 77 [2019-01-14 02:27:29,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:29,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2019-01-14 02:27:29,840 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:29,913 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:29,949 INFO L267 ElimStorePlain]: Start of recursive call 36: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:27:29,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:29,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:29,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 78 treesize of output 111 [2019-01-14 02:27:30,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:30,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 108 [2019-01-14 02:27:30,034 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 2 xjuncts. [2019-01-14 02:27:31,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:31,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 65 [2019-01-14 02:27:31,150 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:34,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:34,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 78 [2019-01-14 02:27:34,330 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:35,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:35,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 55 [2019-01-14 02:27:35,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:35,176 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 33 treesize of output 22 [2019-01-14 02:27:35,176 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:35,187 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:35,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:35,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:35,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:35,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 98 [2019-01-14 02:27:35,718 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:36,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:36,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:36,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:36,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:36,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:36,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:36,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 100 [2019-01-14 02:27:36,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:36,147 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:27:36,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:36,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:36,186 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 3 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 122 [2019-01-14 02:27:36,188 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 2 xjuncts. [2019-01-14 02:27:36,289 INFO L267 ElimStorePlain]: Start of recursive call 53: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:27:37,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:37,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:37,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:37,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 81 [2019-01-14 02:27:37,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:37,345 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 33 treesize of output 22 [2019-01-14 02:27:37,345 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:37,364 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:37,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:37,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:37,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:37,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:37,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 109 [2019-01-14 02:27:37,692 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 99 [2019-01-14 02:27:37,692 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:37,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:37,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:37,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 73 [2019-01-14 02:27:37,784 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:37,827 INFO L267 ElimStorePlain]: Start of recursive call 57: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:27:37,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:37,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:37,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:37,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 90 [2019-01-14 02:27:37,868 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 83 [2019-01-14 02:27:37,868 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:37,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:37,956 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 51 treesize of output 56 [2019-01-14 02:27:37,957 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:37,997 INFO L267 ElimStorePlain]: Start of recursive call 60: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:27:38,422 INFO L267 ElimStorePlain]: Start of recursive call 46: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 4 xjuncts. [2019-01-14 02:27:38,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:38,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 88 [2019-01-14 02:27:38,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:38,700 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 77 treesize of output 70 [2019-01-14 02:27:38,701 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:38,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:38,788 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 56 treesize of output 61 [2019-01-14 02:27:38,789 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:38,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:38,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 51 [2019-01-14 02:27:38,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:38,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2019-01-14 02:27:38,869 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:38,881 INFO L267 ElimStorePlain]: Start of recursive call 66: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:38,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:38,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:38,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:38,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 80 [2019-01-14 02:27:38,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:38,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2019-01-14 02:27:38,967 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:38,987 INFO L267 ElimStorePlain]: Start of recursive call 68: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:39,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:39,047 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 52 [2019-01-14 02:27:39,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:39,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2019-01-14 02:27:39,053 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:39,062 INFO L267 ElimStorePlain]: Start of recursive call 70: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:39,087 INFO L267 ElimStorePlain]: Start of recursive call 63: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:39,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:39,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 69 [2019-01-14 02:27:39,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:39,099 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 48 treesize of output 38 [2019-01-14 02:27:39,100 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:39,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:39,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2019-01-14 02:27:39,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:39,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 24 [2019-01-14 02:27:39,128 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:39,134 INFO L267 ElimStorePlain]: Start of recursive call 74: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:39,146 INFO L267 ElimStorePlain]: Start of recursive call 72: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:39,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:39,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 99 [2019-01-14 02:27:39,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:39,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 73 [2019-01-14 02:27:39,208 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:40,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:40,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 65 [2019-01-14 02:27:40,337 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:41,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:41,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 70 [2019-01-14 02:27:41,028 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:42,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:42,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:42,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:42,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 98 [2019-01-14 02:27:42,504 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:43,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:43,079 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 60 [2019-01-14 02:27:43,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:43,091 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 33 treesize of output 22 [2019-01-14 02:27:43,091 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:43,105 INFO L267 ElimStorePlain]: Start of recursive call 81: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:43,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:43,301 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 55 [2019-01-14 02:27:43,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:43,305 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 33 treesize of output 22 [2019-01-14 02:27:43,305 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:43,317 INFO L267 ElimStorePlain]: Start of recursive call 83: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:43,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:43,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:43,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:43,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 84 [2019-01-14 02:27:43,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:43,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:43,408 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:27:43,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:43,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:43,438 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 122 [2019-01-14 02:27:43,440 INFO L267 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 2 xjuncts. [2019-01-14 02:27:43,519 INFO L267 ElimStorePlain]: Start of recursive call 85: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:27:43,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:43,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 55 [2019-01-14 02:27:43,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:43,925 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 33 treesize of output 22 [2019-01-14 02:27:43,925 INFO L267 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:43,940 INFO L267 ElimStorePlain]: Start of recursive call 87: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:43,981 INFO L267 ElimStorePlain]: Start of recursive call 76: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:44,089 INFO L267 ElimStorePlain]: Start of recursive call 27: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:27:44,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:27:44,172 INFO L202 ElimStorePlain]: Needed 88 recursive calls to eliminate 5 variables, input treesize:150, output treesize:45 [2019-01-14 02:27:44,196 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-14 02:27:44,196 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2019-01-14 02:27:44,197 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 25 transitions. cyclomatic complexity: 6 Second operand 7 states. [2019-01-14 02:27:44,260 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 25 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 46 states and 53 transitions. Complement of second has 11 states. [2019-01-14 02:27:44,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 02:27:44,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 02:27:44,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2019-01-14 02:27:44,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 9 letters. Loop has 6 letters. [2019-01-14 02:27:44,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:27:44,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 15 letters. Loop has 6 letters. [2019-01-14 02:27:44,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:27:44,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 9 letters. Loop has 12 letters. [2019-01-14 02:27:44,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:27:44,268 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 53 transitions. [2019-01-14 02:27:44,271 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-01-14 02:27:44,272 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 25 states and 29 transitions. [2019-01-14 02:27:44,272 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-01-14 02:27:44,272 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2019-01-14 02:27:44,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 29 transitions. [2019-01-14 02:27:44,272 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:27:44,272 INFO L706 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-01-14 02:27:44,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 29 transitions. [2019-01-14 02:27:44,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 16. [2019-01-14 02:27:44,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-14 02:27:44,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2019-01-14 02:27:44,277 INFO L729 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-01-14 02:27:44,277 INFO L609 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-01-14 02:27:44,277 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 02:27:44,277 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2019-01-14 02:27:44,278 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2019-01-14 02:27:44,278 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:27:44,278 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:27:44,278 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:27:44,278 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1] [2019-01-14 02:27:44,278 INFO L794 eck$LassoCheckResult]: Stem: 1670#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1666#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~nondet13, main_#t~mem14, main_#t~mem15, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~d~0.base, main_~d~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~d~0.base, main_~d~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 1667#L552-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 1675#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 1681#L551-3 main_#t~short9 := main_#t~short7; 1680#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 1679#L551-6 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~short9; 1678#L552 assume 0 != main_#t~nondet10;havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11;call write~int(main_#t~nondet12, main_~d~0.base, main_~d~0.offset, 4);havoc main_#t~nondet12; 1677#L552-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 1676#L551-1 [2019-01-14 02:27:44,279 INFO L796 eck$LassoCheckResult]: Loop: 1676#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 1668#L551-3 main_#t~short9 := main_#t~short7; 1669#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 1671#L551-6 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~short9; 1672#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10;call write~int(main_#t~nondet13, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet13;call main_#t~mem14 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem14 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~d~0.base, main_~d~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~d~0.base, main_~d~0.offset, 4);havoc main_#t~mem15; 1673#L552-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 1675#L551-1 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 1681#L551-3 main_#t~short9 := main_#t~short7; 1680#L551-4 assume main_#t~short9;call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 1679#L551-6 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem5;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~short9; 1678#L552 assume 0 != main_#t~nondet10;havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11;call write~int(main_#t~nondet12, main_~d~0.base, main_~d~0.offset, 4);havoc main_#t~nondet12; 1677#L552-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 1676#L551-1 [2019-01-14 02:27:44,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:27:44,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1211450491, now seen corresponding path program 3 times [2019-01-14 02:27:44,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:27:44,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:27:44,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:27:44,282 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:27:44,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:27:44,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:27:44,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:27:44,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:27:44,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1005496147, now seen corresponding path program 1 times [2019-01-14 02:27:44,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:27:44,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:27:44,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:27:44,319 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:27:44,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:27:44,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:27:44,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:27:44,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:27:44,350 INFO L82 PathProgramCache]: Analyzing trace with hash -588138969, now seen corresponding path program 4 times [2019-01-14 02:27:44,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:27:44,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:27:44,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:27:44,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:27:44,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:27:44,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:27:44,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:27:45,150 WARN L181 SmtUtils]: Spent 737.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 106 [2019-01-14 02:27:45,744 WARN L181 SmtUtils]: Spent 572.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 81 [2019-01-14 02:27:46,219 WARN L181 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 110 [2019-01-14 02:27:47,057 WARN L181 SmtUtils]: Spent 815.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 94 [2019-01-14 02:27:47,061 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:27:47,061 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:27:47,061 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:27:47,061 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:27:47,061 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:27:47,061 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:27:47,062 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:27:47,062 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:27:47,062 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i_Iteration7_Lasso [2019-01-14 02:27:47,062 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:27:47,062 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:27:47,069 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-14 02:27:47,073 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-14 02:27:47,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-14 02:27:47,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-14 02:27:47,080 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-14 02:27:47,082 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-14 02:27:47,084 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-14 02:27:47,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-14 02:27:47,095 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-14 02:27:47,097 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-14 02:27:47,803 WARN L181 SmtUtils]: Spent 593.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2019-01-14 02:27:48,298 WARN L181 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2019-01-14 02:27:48,299 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-14 02:27:48,303 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-14 02:27:48,305 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-14 02:27:48,307 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-14 02:27:48,309 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-14 02:27:48,311 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-14 02:27:49,167 WARN L181 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-01-14 02:27:49,383 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:27:49,385 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:27:49,385 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-14 02:27:49,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:49,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:49,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:49,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:49,386 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:27:49,387 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:27:49,393 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:49,393 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:27:49,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:49,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:49,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:49,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:49,394 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:27:49,394 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:27:49,400 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:49,403 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-14 02:27:49,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:49,404 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:49,404 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:49,404 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:49,404 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:27:49,405 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:27:49,405 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:49,406 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-14 02:27:49,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:49,406 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:27:49,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:49,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:49,407 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:49,408 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:27:49,408 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:27:49,408 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:49,409 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-14 02:27:49,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:49,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:49,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:49,409 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:49,410 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:27:49,410 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:27:49,416 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:49,417 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-14 02:27:49,417 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:49,417 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:27:49,417 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:49,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:49,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:49,418 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:27:49,418 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:27:49,418 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:49,422 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-14 02:27:49,422 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:49,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:49,422 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:49,423 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:49,423 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:27:49,423 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:27:49,424 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:49,425 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:27:49,425 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:49,425 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:27:49,425 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:49,425 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:49,425 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:49,426 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:27:49,426 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:27:49,426 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:49,426 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-14 02:27:49,427 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:49,430 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:27:49,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:49,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:49,430 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:49,430 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:27:49,430 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:27:49,431 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:49,431 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-14 02:27:49,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:49,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:49,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:49,435 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:49,437 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:27:49,437 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:27:49,455 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:49,455 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-14 02:27:49,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:49,459 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2019-01-14 02:27:49,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:49,459 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:49,465 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-01-14 02:27:49,465 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:27:49,496 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:49,496 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-14 02:27:49,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:49,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:49,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:49,501 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:49,502 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:27:49,502 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:27:49,508 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:49,508 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-14 02:27:49,509 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:49,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:49,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:49,509 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:49,516 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:27:49,516 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:27:49,522 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:49,523 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-14 02:27:49,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:49,523 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:27:49,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:49,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:49,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:49,525 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:27:49,525 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:27:49,526 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:27:49,532 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:27:49,532 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:27:49,533 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:27:49,533 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:27:49,533 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:27:49,533 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_6) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_6 Supporting invariants [] [2019-01-14 02:27:49,923 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2019-01-14 02:27:49,928 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:27:49,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:27:49,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:27:49,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:27:49,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:49,970 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 17 treesize of output 29 [2019-01-14 02:27:49,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:49,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:49,991 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 13 [2019-01-14 02:27:49,992 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:49,996 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:50,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:50,002 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2019-01-14 02:27:50,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:27:50,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:27:50,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 86 [2019-01-14 02:27:50,223 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:27:50,223 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:50,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:50,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 65 [2019-01-14 02:27:50,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:50,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2019-01-14 02:27:50,269 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:50,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:50,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 69 [2019-01-14 02:27:50,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:50,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2019-01-14 02:27:50,315 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:50,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:50,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 54 [2019-01-14 02:27:50,375 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 3 xjuncts. [2019-01-14 02:27:50,420 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:27:50,458 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:27:50,493 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:27:50,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:27:50,537 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:154, output treesize:93 [2019-01-14 02:27:50,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:50,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 54 [2019-01-14 02:27:50,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:27:50,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2019-01-14 02:27:50,600 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:50,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2019-01-14 02:27:50,619 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:27:50,619 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:27:50,627 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:50,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:50,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:27:50,647 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:64, output treesize:25 [2019-01-14 02:27:50,648 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 02:27:50,648 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2019-01-14 02:27:50,648 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 4 Second operand 7 states. [2019-01-14 02:27:50,815 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 4. Second operand 7 states. Result 58 states and 69 transitions. Complement of second has 11 states. [2019-01-14 02:27:50,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2019-01-14 02:27:50,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 02:27:50,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2019-01-14 02:27:50,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 9 letters. Loop has 12 letters. [2019-01-14 02:27:50,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:27:50,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 21 letters. Loop has 12 letters. [2019-01-14 02:27:50,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:27:50,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 9 letters. Loop has 24 letters. [2019-01-14 02:27:50,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:27:50,818 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 69 transitions. [2019-01-14 02:27:50,819 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:27:50,819 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 0 states and 0 transitions. [2019-01-14 02:27:50,820 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:27:50,823 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:27:50,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:27:50,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:27:50,824 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:27:50,824 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:27:50,824 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:27:50,824 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-14 02:27:50,824 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:27:50,824 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:27:50,824 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:27:50,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:27:50 BoogieIcfgContainer [2019-01-14 02:27:50,831 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:27:50,832 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:27:50,832 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:27:50,832 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:27:50,833 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:26:28" (3/4) ... [2019-01-14 02:27:50,836 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:27:50,837 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:27:50,838 INFO L168 Benchmark]: Toolchain (without parser) took 84069.21 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 456.7 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -111.5 MB). Peak memory consumption was 345.1 MB. Max. memory is 11.5 GB. [2019-01-14 02:27:50,839 INFO L168 Benchmark]: CDTParser took 0.16 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-14 02:27:50,839 INFO L168 Benchmark]: CACSL2BoogieTranslator took 609.33 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 79.7 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -101.5 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. [2019-01-14 02:27:50,839 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.24 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:27:50,840 INFO L168 Benchmark]: Boogie Preprocessor took 52.50 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:27:50,840 INFO L168 Benchmark]: RCFGBuilder took 540.82 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. [2019-01-14 02:27:50,840 INFO L168 Benchmark]: BuchiAutomizer took 82794.15 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 377.0 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -29.7 MB). Peak memory consumption was 347.2 MB. Max. memory is 11.5 GB. [2019-01-14 02:27:50,841 INFO L168 Benchmark]: Witness Printer took 5.38 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:27:50,844 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.16 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 609.33 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 79.7 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -101.5 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 62.24 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 52.50 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 540.82 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 82794.15 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 377.0 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -29.7 MB). Peak memory consumption was 347.2 MB. Max. memory is 11.5 GB. * Witness Printer took 5.38 ms. Allocated memory is still 1.5 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 - 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 7 terminating modules (1 trivial, 4 deterministic, 2 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 5 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[d][d] and consists of 5 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 7 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 5 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[d][d] and consists of 6 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 82.7s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 26.5s. Construction of modules took 0.4s. Büchi inclusion checks took 55.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 39 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 32 states and ocurred in iteration 3. Nontrivial modules had stage [4, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/6 HoareTripleCheckerStatistics: 67 SDtfs, 147 SDslu, 43 SDs, 0 SdLazy, 184 SolverSat, 73 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso6 LassoPreprocessingBenchmarks: Lassos: inital1234 mio100 ax103 hnf99 lsp80 ukn50 mio100 lsp32 div100 bol103 ite100 ukn100 eq178 hnf88 smp97 dnf306 smp92 tf100 neg92 sie126 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 56ms VariablesStem: 7 VariablesLoop: 6 DisjunctsStem: 8 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 20 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...