./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_42f66fb4-9f11-4922-8175-a9a1d1a88d00/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_42f66fb4-9f11-4922-8175-a9a1d1a88d00/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_42f66fb4-9f11-4922-8175-a9a1d1a88d00/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_42f66fb4-9f11-4922-8175-a9a1d1a88d00/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_42f66fb4-9f11-4922-8175-a9a1d1a88d00/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_42f66fb4-9f11-4922-8175-a9a1d1a88d00/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 0d5c046770a708e0857845f9429def45b08d1347 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 11:25:17,208 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 11:25:17,210 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 11:25:17,218 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 11:25:17,218 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 11:25:17,219 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 11:25:17,220 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 11:25:17,221 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 11:25:17,222 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 11:25:17,222 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 11:25:17,223 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 11:25:17,223 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 11:25:17,224 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 11:25:17,225 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 11:25:17,225 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 11:25:17,226 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 11:25:17,226 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 11:25:17,228 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 11:25:17,229 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 11:25:17,230 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 11:25:17,231 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 11:25:17,232 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 11:25:17,233 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 11:25:17,233 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 11:25:17,234 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 11:25:17,234 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 11:25:17,235 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 11:25:17,235 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 11:25:17,236 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 11:25:17,237 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 11:25:17,237 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 11:25:17,237 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 11:25:17,238 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 11:25:17,238 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 11:25:17,238 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 11:25:17,239 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 11:25:17,239 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_42f66fb4-9f11-4922-8175-a9a1d1a88d00/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 11:25:17,250 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 11:25:17,250 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 11:25:17,251 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 11:25:17,251 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 11:25:17,251 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 11:25:17,251 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 11:25:17,251 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 11:25:17,251 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 11:25:17,251 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 11:25:17,251 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 11:25:17,252 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 11:25:17,252 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 11:25:17,252 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 11:25:17,252 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 11:25:17,252 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 11:25:17,252 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 11:25:17,252 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 11:25:17,253 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 11:25:17,253 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 11:25:17,253 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 11:25:17,253 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 11:25:17,253 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 11:25:17,253 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 11:25:17,253 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 11:25:17,253 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 11:25:17,254 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 11:25:17,254 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 11:25:17,254 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 11:25:17,255 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 11:25:17,255 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_42f66fb4-9f11-4922-8175-a9a1d1a88d00/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0d5c046770a708e0857845f9429def45b08d1347 [2018-11-28 11:25:17,276 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 11:25:17,286 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 11:25:17,288 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 11:25:17,289 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 11:25:17,290 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 11:25:17,290 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_42f66fb4-9f11-4922-8175-a9a1d1a88d00/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i [2018-11-28 11:25:17,333 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_42f66fb4-9f11-4922-8175-a9a1d1a88d00/bin-2019/uautomizer/data/7099fc165/e8b0da7a48ba4e208644ffa5c2e20036/FLAG4e1389449 [2018-11-28 11:25:17,754 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 11:25:17,754 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_42f66fb4-9f11-4922-8175-a9a1d1a88d00/sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i [2018-11-28 11:25:17,761 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_42f66fb4-9f11-4922-8175-a9a1d1a88d00/bin-2019/uautomizer/data/7099fc165/e8b0da7a48ba4e208644ffa5c2e20036/FLAG4e1389449 [2018-11-28 11:25:17,770 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_42f66fb4-9f11-4922-8175-a9a1d1a88d00/bin-2019/uautomizer/data/7099fc165/e8b0da7a48ba4e208644ffa5c2e20036 [2018-11-28 11:25:17,772 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 11:25:17,772 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 11:25:17,773 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 11:25:17,773 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 11:25:17,775 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 11:25:17,775 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:25:17" (1/1) ... [2018-11-28 11:25:17,777 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42171c05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:25:17, skipping insertion in model container [2018-11-28 11:25:17,777 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:25:17" (1/1) ... [2018-11-28 11:25:17,782 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 11:25:17,801 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 11:25:17,965 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:25:17,972 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 11:25:18,043 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:25:18,065 INFO L195 MainTranslator]: Completed translation [2018-11-28 11:25:18,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:25:18 WrapperNode [2018-11-28 11:25:18,066 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 11:25:18,066 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 11:25:18,066 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 11:25:18,067 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 11:25:18,072 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:25:18" (1/1) ... [2018-11-28 11:25:18,081 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:25:18" (1/1) ... [2018-11-28 11:25:18,095 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 11:25:18,096 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 11:25:18,096 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 11:25:18,096 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 11:25:18,101 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:25:18" (1/1) ... [2018-11-28 11:25:18,102 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:25:18" (1/1) ... [2018-11-28 11:25:18,103 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:25:18" (1/1) ... [2018-11-28 11:25:18,103 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:25:18" (1/1) ... [2018-11-28 11:25:18,106 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:25:18" (1/1) ... [2018-11-28 11:25:18,108 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:25:18" (1/1) ... [2018-11-28 11:25:18,109 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:25:18" (1/1) ... [2018-11-28 11:25:18,110 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 11:25:18,110 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 11:25:18,111 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 11:25:18,111 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 11:25:18,111 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:25:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_42f66fb4-9f11-4922-8175-a9a1d1a88d00/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:25:18,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 11:25:18,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 11:25:18,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 11:25:18,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 11:25:18,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 11:25:18,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 11:25:18,306 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 11:25:18,306 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-28 11:25:18,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:25:18 BoogieIcfgContainer [2018-11-28 11:25:18,306 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 11:25:18,307 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 11:25:18,307 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 11:25:18,310 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 11:25:18,311 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:25:18,311 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:25:17" (1/3) ... [2018-11-28 11:25:18,312 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1dae4a81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:25:18, skipping insertion in model container [2018-11-28 11:25:18,312 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:25:18,312 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:25:18" (2/3) ... [2018-11-28 11:25:18,312 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1dae4a81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:25:18, skipping insertion in model container [2018-11-28 11:25:18,312 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:25:18,313 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:25:18" (3/3) ... [2018-11-28 11:25:18,314 INFO L375 chiAutomizerObserver]: Analyzing ICFG CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i [2018-11-28 11:25:18,365 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 11:25:18,366 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 11:25:18,366 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 11:25:18,366 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 11:25:18,366 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 11:25:18,366 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 11:25:18,366 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 11:25:18,366 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 11:25:18,366 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 11:25:18,379 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-11-28 11:25:18,398 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 11:25:18,398 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:25:18,398 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:25:18,404 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 11:25:18,404 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 11:25:18,404 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 11:25:18,404 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-11-28 11:25:18,405 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 11:25:18,405 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:25:18,405 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:25:18,406 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 11:25:18,406 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 11:25:18,412 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.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~d~0.base, main_~d~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 11#L552-2true [2018-11-28 11:25:18,413 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~short7;havoc main_#t~short9;havoc main_#t~mem6;havoc main_#t~mem5;havoc main_#t~mem8; 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 [2018-11-28 11:25:18,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:18,417 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-28 11:25:18,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:25:18,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:25:18,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:18,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:25:18,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:18,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:25:18,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:25:18,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:18,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 1 times [2018-11-28 11:25:18,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:25:18,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:25:18,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:18,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:25:18,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:18,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:25:18,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:25:18,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:18,539 INFO L82 PathProgramCache]: Analyzing trace with hash 177626380, now seen corresponding path program 1 times [2018-11-28 11:25:18,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:25:18,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:25:18,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:18,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:25:18,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:18,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:25:18,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:25:18,772 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 63 [2018-11-28 11:25:18,912 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:25:18,912 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:25:18,913 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:25:18,913 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:25:18,913 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:25:18,913 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:25:18,913 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:25:18,913 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:25:18,913 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i_Iteration1_Lasso [2018-11-28 11:25:18,914 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:25:18,914 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:25:18,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:18,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:18,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:18,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:18,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:18,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:18,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:18,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:18,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:18,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:18,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:18,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:18,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:18,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:18,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:19,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:19,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:19,501 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:25:19,505 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:25:19,507 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:25:19,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:19,508 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:25:19,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:19,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:19,509 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:19,511 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:25:19,511 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:25:19,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:19,512 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:25:19,512 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:19,512 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:25:19,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:19,513 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:25:19,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:19,513 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:25:19,513 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:25:19,516 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:19,517 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:25:19,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:19,517 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:25:19,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:19,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:19,518 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:19,518 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:25:19,518 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:25:19,519 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:19,519 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:25:19,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:19,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:19,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:19,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:19,522 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:25:19,522 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:25:19,525 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:19,525 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:25:19,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:19,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:19,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:19,526 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:19,527 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:25:19,528 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:25:19,531 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:19,532 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:25:19,532 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:19,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:19,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:19,532 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:19,534 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:25:19,534 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:25:19,536 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:19,536 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:25:19,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:19,538 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:25:19,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:19,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:19,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:19,539 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:25:19,539 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:25:19,540 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:19,540 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:25:19,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:19,541 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:25:19,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:19,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:19,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:19,542 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:25:19,542 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:25:19,543 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:19,543 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:25:19,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:19,543 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:25:19,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:19,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:19,544 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:19,544 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:25:19,544 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:25:19,547 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:19,547 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:25:19,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:19,548 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:25:19,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:19,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:19,548 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:19,548 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:25:19,548 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:25:19,549 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:19,549 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:25:19,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:19,550 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:25:19,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:19,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:19,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:19,550 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:25:19,551 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:25:19,551 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:19,552 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:25:19,552 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:19,552 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:25:19,552 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:19,552 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:19,552 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:19,554 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:25:19,554 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:25:19,554 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:19,555 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:25:19,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:19,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:19,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:19,556 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:19,558 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:25:19,558 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:25:19,560 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:19,561 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:25:19,561 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:19,561 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:25:19,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:19,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:19,562 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:19,562 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:25:19,562 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:25:19,563 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:19,563 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:25:19,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:19,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:19,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:19,564 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:19,570 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:25:19,570 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:25:19,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:19,599 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:25:19,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:19,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:19,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:19,602 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:19,604 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:25:19,604 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:25:19,611 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:19,612 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:25:19,612 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:19,612 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:25:19,614 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:19,614 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:19,614 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:19,614 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:25:19,615 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:25:19,617 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:25:19,621 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 11:25:19,621 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 11:25:19,623 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:25:19,623 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 11:25:19,623 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:25:19,624 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 Supporting invariants [] [2018-11-28 11:25:19,675 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-28 11:25:19,689 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 11:25:19,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:19,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:19,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:25:19,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:19,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:25:19,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:25:19,778 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 11:25:19,779 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states. Second operand 4 states. [2018-11-28 11:25:19,856 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. [2018-11-28 11:25:19,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 11:25:19,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 11:25:19,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2018-11-28 11:25:19,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 29 transitions. Stem has 2 letters. Loop has 6 letters. [2018-11-28 11:25:19,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:25:19,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 29 transitions. Stem has 8 letters. Loop has 6 letters. [2018-11-28 11:25:19,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:25:19,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 29 transitions. Stem has 2 letters. Loop has 12 letters. [2018-11-28 11:25:19,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:25:19,861 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 71 transitions. [2018-11-28 11:25:19,866 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-11-28 11:25:19,870 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 31 states and 44 transitions. [2018-11-28 11:25:19,870 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-28 11:25:19,871 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-28 11:25:19,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 44 transitions. [2018-11-28 11:25:19,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:25:19,871 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 44 transitions. [2018-11-28 11:25:19,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 44 transitions. [2018-11-28 11:25:19,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-11-28 11:25:19,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-28 11:25:19,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 42 transitions. [2018-11-28 11:25:19,904 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 42 transitions. [2018-11-28 11:25:19,904 INFO L608 BuchiCegarLoop]: Abstraction has 30 states and 42 transitions. [2018-11-28 11:25:19,904 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 11:25:19,904 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 42 transitions. [2018-11-28 11:25:19,905 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-11-28 11:25:19,905 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:25:19,905 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:25:19,905 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 11:25:19,905 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 11:25:19,905 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.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~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 [2018-11-28 11:25:19,905 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~short7;havoc main_#t~short9;havoc main_#t~mem6;havoc main_#t~mem5;havoc main_#t~mem8; 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 [2018-11-28 11:25:19,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:19,906 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-11-28 11:25:19,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:25:19,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:25:19,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:19,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:25:19,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:19,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:25:19,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:25:19,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:19,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1244514134, now seen corresponding path program 1 times [2018-11-28 11:25:19,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:25:19,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:25:19,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:19,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:25:19,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:19,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:19,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:25:19,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:25:19,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:25:19,941 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 11:25:19,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:25:19,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:25:19,944 INFO L87 Difference]: Start difference. First operand 30 states and 42 transitions. cyclomatic complexity: 15 Second operand 4 states. [2018-11-28 11:25:19,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:25:19,965 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-11-28 11:25:19,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:25:19,966 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 35 transitions. [2018-11-28 11:25:19,966 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 11:25:19,967 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 20 states and 23 transitions. [2018-11-28 11:25:19,967 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-28 11:25:19,967 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-28 11:25:19,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2018-11-28 11:25:19,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:25:19,967 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-28 11:25:19,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2018-11-28 11:25:19,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-28 11:25:19,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-28 11:25:19,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-11-28 11:25:19,969 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-28 11:25:19,969 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-28 11:25:19,969 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 11:25:19,969 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2018-11-28 11:25:19,969 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 11:25:19,969 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:25:19,969 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:25:19,970 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:25:19,970 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 11:25:19,970 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.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~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~short7;havoc main_#t~short9;havoc main_#t~mem6;havoc main_#t~mem5;havoc main_#t~mem8; 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 [2018-11-28 11:25:19,970 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~short7;havoc main_#t~short9;havoc main_#t~mem6;havoc main_#t~mem5;havoc main_#t~mem8; 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 [2018-11-28 11:25:19,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:19,970 INFO L82 PathProgramCache]: Analyzing trace with hash 177626382, now seen corresponding path program 1 times [2018-11-28 11:25:19,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:25:19,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:25:19,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:19,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:25:19,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:19,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:25:19,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:25:19,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:19,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 2 times [2018-11-28 11:25:19,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:25:19,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:25:19,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:19,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:25:19,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:20,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:25:20,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:25:20,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:20,009 INFO L82 PathProgramCache]: Analyzing trace with hash -692497897, now seen corresponding path program 1 times [2018-11-28 11:25:20,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:25:20,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:25:20,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:20,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:25:20,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:20,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:25:20,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:25:20,211 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 63 [2018-11-28 11:25:20,492 WARN L180 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 97 [2018-11-28 11:25:20,558 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:25:20,558 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:25:20,558 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:25:20,558 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:25:20,558 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:25:20,558 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:25:20,558 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:25:20,558 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:25:20,558 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i_Iteration3_Lasso [2018-11-28 11:25:20,558 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:25:20,559 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:25:20,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:20,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:20,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:20,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:20,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:20,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:20,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:20,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:20,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:20,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:20,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:20,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:20,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:20,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:20,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:20,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:20,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:20,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:21,007 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:25:21,008 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:25:21,008 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:25:21,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:21,009 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:25:21,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:21,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:21,009 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:21,009 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:25:21,009 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:25:21,010 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:21,010 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:25:21,011 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:21,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:21,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:21,011 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:21,012 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:25:21,012 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:25:21,013 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:21,013 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:25:21,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:21,014 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:25:21,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:21,014 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:21,014 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:21,014 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:25:21,014 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:25:21,015 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:21,015 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:25:21,015 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:21,015 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:25:21,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:21,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:21,016 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:21,016 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:25:21,016 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:25:21,017 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:21,018 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:25:21,019 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:21,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:21,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:21,019 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:21,020 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:25:21,020 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:25:21,022 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:21,022 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:25:21,022 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:21,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:21,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:21,023 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:21,023 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:25:21,023 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:25:21,024 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:21,025 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:25:21,025 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:21,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:21,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:21,025 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:21,026 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:25:21,026 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:25:21,034 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:21,034 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:25:21,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:21,035 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:25:21,035 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:21,035 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:21,036 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:25:21,036 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:25:21,043 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:21,043 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:25:21,044 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:21,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:21,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:21,044 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:21,045 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:25:21,045 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:25:21,046 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:21,046 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:25:21,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:21,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:21,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:21,047 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:21,048 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:25:21,048 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:25:21,056 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:21,056 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:25:21,057 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:21,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:21,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:21,057 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:21,060 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:25:21,060 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:25:21,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:21,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 [2018-11-28 11:25:21,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:21,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:21,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:21,075 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:21,076 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:25:21,076 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:25:21,079 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:21,080 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:25:21,080 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:21,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:21,080 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:21,080 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:21,081 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:25:21,081 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:25:21,084 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:21,084 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:25:21,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:21,085 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:25:21,085 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:21,085 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:21,086 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:25:21,086 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:25:21,089 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:21,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 [2018-11-28 11:25:21,091 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:21,091 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:25:21,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:21,091 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:21,092 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:25:21,092 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:25:21,095 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:21,096 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:25:21,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:21,096 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:21,096 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:21,096 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:21,097 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:25:21,097 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:25:21,101 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:25:21,103 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 11:25:21,103 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 11:25:21,103 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:25:21,104 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 11:25:21,104 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:25:21,104 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2 Supporting invariants [] [2018-11-28 11:25:21,161 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-28 11:25:21,162 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 11:25:21,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:21,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:21,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:25:21,202 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:21,206 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 [2018-11-28 11:25:21,222 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:21,223 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:21,224 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 [2018-11-28 11:25:21,224 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:21,231 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:21,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:21,235 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-11-28 11:25:21,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:21,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:25:21,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:25:21,275 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 [2018-11-28 11:25:21,275 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 23 transitions. cyclomatic complexity: 5 Second operand 5 states. [2018-11-28 11:25:21,319 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. [2018-11-28 11:25:21,320 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 [2018-11-28 11:25:21,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 11:25:21,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2018-11-28 11:25:21,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 8 letters. Loop has 6 letters. [2018-11-28 11:25:21,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:25:21,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 14 letters. Loop has 6 letters. [2018-11-28 11:25:21,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:25:21,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 8 letters. Loop has 12 letters. [2018-11-28 11:25:21,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:25:21,321 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 37 transitions. [2018-11-28 11:25:21,321 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 11:25:21,322 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 37 transitions. [2018-11-28 11:25:21,322 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-28 11:25:21,322 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-28 11:25:21,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 37 transitions. [2018-11-28 11:25:21,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:25:21,322 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-11-28 11:25:21,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 37 transitions. [2018-11-28 11:25:21,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-28 11:25:21,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-28 11:25:21,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2018-11-28 11:25:21,324 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-11-28 11:25:21,324 INFO L608 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-11-28 11:25:21,324 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 11:25:21,324 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 37 transitions. [2018-11-28 11:25:21,324 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 11:25:21,324 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:25:21,325 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:25:21,325 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1] [2018-11-28 11:25:21,325 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 11:25:21,325 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.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~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~short7;havoc main_#t~short9;havoc main_#t~mem6;havoc main_#t~mem5;havoc main_#t~mem8; 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~short7;havoc main_#t~short9;havoc main_#t~mem6;havoc main_#t~mem5;havoc main_#t~mem8; 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 [2018-11-28 11:25:21,325 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~short7;havoc main_#t~short9;havoc main_#t~mem6;havoc main_#t~mem5;havoc main_#t~mem8; 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 [2018-11-28 11:25:21,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:21,325 INFO L82 PathProgramCache]: Analyzing trace with hash -692497895, now seen corresponding path program 2 times [2018-11-28 11:25:21,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:25:21,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:25:21,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:21,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:25:21,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:21,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:25:21,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:25:21,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:21,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 3 times [2018-11-28 11:25:21,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:25:21,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:25:21,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:21,356 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:25:21,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:21,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:25:21,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:25:21,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:21,367 INFO L82 PathProgramCache]: Analyzing trace with hash 502600418, now seen corresponding path program 2 times [2018-11-28 11:25:21,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:25:21,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:25:21,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:21,368 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:25:21,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:21,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:25:21,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:25:21,564 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 63 [2018-11-28 11:25:22,262 WARN L180 SmtUtils]: Spent 662.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 134 [2018-11-28 11:25:22,388 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2018-11-28 11:25:22,390 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:25:22,390 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:25:22,391 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:25:22,391 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:25:22,391 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:25:22,391 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:25:22,391 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:25:22,391 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:25:22,391 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i_Iteration4_Lasso [2018-11-28 11:25:22,391 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:25:22,391 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:25:22,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:22,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:22,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:22,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:22,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:22,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:22,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:22,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:22,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:22,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:22,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:22,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:22,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:22,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:22,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:22,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:22,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:22,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:22,912 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:25:22,912 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:25:22,912 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:25:22,913 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:22,913 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:25:22,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:22,913 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:22,913 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:22,914 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:25:22,914 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:25:22,915 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:22,915 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:25:22,915 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:22,915 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:25:22,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:22,915 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:22,916 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:25:22,916 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:25:22,925 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:22,926 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:25:22,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:22,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:22,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:22,926 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:22,927 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:25:22,927 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:25:22,930 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:22,930 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:25:22,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:22,930 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:25:22,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:22,931 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:22,931 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:25:22,931 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:25:22,934 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:22,934 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:25:22,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:22,935 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:25:22,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:22,935 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:22,936 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:25:22,936 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:25:22,939 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:22,940 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:25:22,940 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:22,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:22,940 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:22,940 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:22,941 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:25:22,941 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:25:22,942 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:22,942 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:25:22,942 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:22,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:22,943 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:22,943 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:22,943 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:25:22,943 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:25:22,944 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:22,944 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:25:22,949 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:22,949 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:22,949 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:22,949 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:22,950 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:25:22,950 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:25:22,952 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:22,957 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:25:22,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:22,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:22,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:22,957 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:22,958 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:25:22,958 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:25:22,960 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:22,960 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:25:22,961 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:22,961 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:22,961 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:22,961 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:22,961 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:25:22,962 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:25:22,964 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:22,964 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:25:22,965 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:22,965 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:22,965 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:22,965 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:22,968 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:25:22,968 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:25:22,971 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:25:22,973 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 11:25:22,973 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 11:25:22,974 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:25:22,974 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 11:25:22,974 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:25:22,974 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3 Supporting invariants [] [2018-11-28 11:25:23,072 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-28 11:25:23,073 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 11:25:23,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:23,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:23,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:25:23,112 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:23,113 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 [2018-11-28 11:25:23,125 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:23,126 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:23,127 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 [2018-11-28 11:25:23,127 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:23,131 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:23,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:23,135 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-11-28 11:25:23,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:23,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:25:23,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:25:23,172 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 [2018-11-28 11:25:23,172 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 37 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-11-28 11:25:23,206 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. [2018-11-28 11:25:23,207 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 [2018-11-28 11:25:23,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 11:25:23,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2018-11-28 11:25:23,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 14 letters. Loop has 6 letters. [2018-11-28 11:25:23,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:25:23,207 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 11:25:23,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:23,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:23,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:25:23,239 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:23,239 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 [2018-11-28 11:25:23,259 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:23,260 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:23,260 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 [2018-11-28 11:25:23,260 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:23,263 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:23,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:23,267 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-11-28 11:25:23,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:23,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:25:23,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:25:23,298 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 [2018-11-28 11:25:23,298 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 37 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-11-28 11:25:23,328 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. [2018-11-28 11:25:23,328 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 [2018-11-28 11:25:23,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 11:25:23,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2018-11-28 11:25:23,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 14 letters. Loop has 6 letters. [2018-11-28 11:25:23,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:25:23,329 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 11:25:23,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:23,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:23,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:25:23,368 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:23,368 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 [2018-11-28 11:25:23,380 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:23,381 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:23,381 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 [2018-11-28 11:25:23,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:23,384 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:23,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:23,388 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-11-28 11:25:23,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:23,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:25:23,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:25:23,419 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 [2018-11-28 11:25:23,419 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 37 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-11-28 11:25:23,453 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. [2018-11-28 11:25:23,453 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 [2018-11-28 11:25:23,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 11:25:23,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2018-11-28 11:25:23,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 14 letters. Loop has 6 letters. [2018-11-28 11:25:23,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:25:23,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 20 letters. Loop has 6 letters. [2018-11-28 11:25:23,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:25:23,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 14 letters. Loop has 12 letters. [2018-11-28 11:25:23,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:25:23,455 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 56 transitions. [2018-11-28 11:25:23,457 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-28 11:25:23,458 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 38 states and 44 transitions. [2018-11-28 11:25:23,458 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-28 11:25:23,458 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-28 11:25:23,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 44 transitions. [2018-11-28 11:25:23,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:25:23,458 INFO L705 BuchiCegarLoop]: Abstraction has 38 states and 44 transitions. [2018-11-28 11:25:23,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 44 transitions. [2018-11-28 11:25:23,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 14. [2018-11-28 11:25:23,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-28 11:25:23,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-11-28 11:25:23,460 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-11-28 11:25:23,460 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-11-28 11:25:23,460 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 11:25:23,460 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2018-11-28 11:25:23,461 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-28 11:25:23,461 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:25:23,461 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:25:23,461 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 11:25:23,461 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 11:25:23,461 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.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~d~0.base, main_~d~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 1021#L552-2 [2018-11-28 11:25:23,461 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~short7;havoc main_#t~short9;havoc main_#t~mem6;havoc main_#t~mem5;havoc main_#t~mem8; 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 [2018-11-28 11:25:23,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:23,461 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-28 11:25:23,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:25:23,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:25:23,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:23,463 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:25:23,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:23,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:25:23,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:25:23,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:23,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577164, now seen corresponding path program 1 times [2018-11-28 11:25:23,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:25:23,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:25:23,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:23,469 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:25:23,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:23,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:25:23,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:25:23,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:23,479 INFO L82 PathProgramCache]: Analyzing trace with hash 177626382, now seen corresponding path program 3 times [2018-11-28 11:25:23,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:25:23,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:25:23,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:23,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:25:23,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:23,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:25:23,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:25:23,637 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 68 [2018-11-28 11:25:23,724 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:25:23,724 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:25:23,724 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:25:23,724 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:25:23,724 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:25:23,724 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:25:23,724 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:25:23,724 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:25:23,724 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i_Iteration5_Lasso [2018-11-28 11:25:23,724 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:25:23,725 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:25:23,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:23,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:23,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:23,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:23,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:23,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:23,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:23,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:23,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:23,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:23,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:23,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:23,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:23,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:23,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:23,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:23,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:24,150 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:25:24,150 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:25:24,150 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:25:24,150 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:24,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:24,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:24,151 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:24,151 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:25:24,151 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:25:24,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:24,152 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:25:24,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:24,153 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:25:24,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:24,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:24,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:24,153 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:25:24,153 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:25:24,153 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:24,154 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:25:24,154 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:24,154 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:24,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:24,154 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:24,155 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:25:24,155 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:25:24,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:24,156 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:25:24,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:24,156 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:25:24,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:24,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:24,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:24,157 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:25:24,157 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:25:24,157 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:24,157 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:25:24,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:24,158 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:25:24,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:24,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:24,158 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:24,158 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:25:24,158 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:25:24,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:24,159 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:25:24,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:24,159 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:25:24,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:24,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:24,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:24,160 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:25:24,160 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:25:24,161 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:24,162 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:25:24,162 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:24,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:24,162 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:24,162 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:24,163 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:25:24,163 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:25:24,164 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:24,164 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:25:24,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:24,164 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:25:24,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:24,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:24,165 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:25:24,165 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:25:24,168 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:24,168 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:25:24,168 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:24,168 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:25:24,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:24,169 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:24,169 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:25:24,169 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:25:24,171 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:24,172 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:25:24,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:24,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:24,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:24,172 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:24,173 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:25:24,173 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:25:24,176 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:24,176 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:25:24,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:24,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:24,177 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:24,177 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:24,177 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:25:24,177 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:25:24,178 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:24,178 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:25:24,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:24,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:24,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:24,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:24,179 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:25:24,179 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:25:24,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:24,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:25:24,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:24,184 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:25:24,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:24,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:24,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:24,184 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:25:24,184 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:25:24,185 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:25:24,186 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 11:25:24,186 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 11:25:24,186 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:25:24,186 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 11:25:24,186 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:25:24,187 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 [] [2018-11-28 11:25:24,255 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-28 11:25:24,257 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 11:25:24,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:24,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:24,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:25:24,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:24,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:25:24,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:25:24,316 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 11:25:24,316 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 16 transitions. cyclomatic complexity: 3 Second operand 5 states. [2018-11-28 11:25:24,344 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. [2018-11-28 11:25:24,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 11:25:24,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 11:25:24,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 8 transitions. [2018-11-28 11:25:24,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 2 letters. Loop has 6 letters. [2018-11-28 11:25:24,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:25:24,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 8 letters. Loop has 6 letters. [2018-11-28 11:25:24,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:25:24,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 2 letters. Loop has 12 letters. [2018-11-28 11:25:24,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:25:24,345 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 42 transitions. [2018-11-28 11:25:24,345 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-28 11:25:24,346 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 26 states and 30 transitions. [2018-11-28 11:25:24,346 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-28 11:25:24,346 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-28 11:25:24,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 30 transitions. [2018-11-28 11:25:24,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:25:24,346 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-11-28 11:25:24,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 30 transitions. [2018-11-28 11:25:24,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2018-11-28 11:25:24,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-28 11:25:24,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-11-28 11:25:24,347 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-11-28 11:25:24,347 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-11-28 11:25:24,347 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 11:25:24,348 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 25 transitions. [2018-11-28 11:25:24,348 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-28 11:25:24,348 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:25:24,348 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:25:24,348 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:25:24,348 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 11:25:24,348 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.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~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~short7;havoc main_#t~short9;havoc main_#t~mem6;havoc main_#t~mem5;havoc main_#t~mem8; 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 [2018-11-28 11:25:24,348 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~short7;havoc main_#t~short9;havoc main_#t~mem6;havoc main_#t~mem5;havoc main_#t~mem8; 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 [2018-11-28 11:25:24,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:24,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1211450491, now seen corresponding path program 2 times [2018-11-28 11:25:24,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:25:24,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:25:24,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:24,349 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:25:24,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:24,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:25:24,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:25:24,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:24,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1187255894, now seen corresponding path program 2 times [2018-11-28 11:25:24,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:25:24,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:25:24,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:24,366 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:25:24,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:24,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:25:24,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:25:24,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:24,375 INFO L82 PathProgramCache]: Analyzing trace with hash 816748368, now seen corresponding path program 3 times [2018-11-28 11:25:24,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:25:24,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:25:24,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:24,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:25:24,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:24,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:25:24,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:25:24,542 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 75 [2018-11-28 11:25:24,885 WARN L180 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 109 [2018-11-28 11:25:25,279 WARN L180 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 93 [2018-11-28 11:25:25,282 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:25:25,282 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:25:25,282 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:25:25,282 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:25:25,282 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:25:25,282 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:25:25,282 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:25:25,282 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:25:25,282 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i_Iteration6_Lasso [2018-11-28 11:25:25,282 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:25:25,282 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:25:25,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:25,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:25,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:25,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:25,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:25,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:25,616 WARN L180 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2018-11-28 11:25:25,882 WARN L180 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2018-11-28 11:25:25,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:25,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:25,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:25,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:25,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:25,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:25,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:25,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:25,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:25,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:25,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:26,207 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:25:26,207 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:25:26,208 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:25:26,208 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:26,208 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:26,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:26,208 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:26,209 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:25:26,209 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:25:26,210 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:26,210 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:25:26,210 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:26,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:26,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:26,210 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:26,211 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:25:26,211 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:25:26,212 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:26,212 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:25:26,212 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:26,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:26,212 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:26,212 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:26,213 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:25:26,213 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:25:26,214 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:26,214 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:25:26,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:26,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:26,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:26,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:26,215 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:25:26,215 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:25:26,215 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:26,216 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:25:26,216 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:26,216 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:25:26,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:26,216 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:26,216 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:26,216 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:25:26,216 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:25:26,216 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:26,217 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:25:26,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:26,217 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:25:26,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:26,217 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:26,218 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:25:26,218 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:25:26,220 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:26,220 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:25:26,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:26,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:26,221 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:26,221 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:26,222 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:25:26,222 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:25:26,224 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:26,224 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:25:26,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:26,225 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:25:26,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:26,225 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:26,225 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:25:26,226 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:25:26,228 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:25:26,228 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:25:26,228 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:25:26,228 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:25:26,228 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:25:26,229 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:25:26,229 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:25:26,229 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:25:26,232 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:25:26,233 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 11:25:26,233 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 11:25:26,234 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:25:26,234 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 11:25:26,234 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:25:26,235 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 [] [2018-11-28 11:25:26,322 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-28 11:25:26,323 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 11:25:26,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:26,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:26,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:25:26,344 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-28 11:25:26,348 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:26,348 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:26,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 11 treesize of output 4 [2018-11-28 11:25:26,349 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:26,351 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:26,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:26,354 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-11-28 11:25:26,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:26,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:25:26,429 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 [2018-11-28 11:25:26,456 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 [2018-11-28 11:25:26,456 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:26,470 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:26,470 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 [2018-11-28 11:25:26,474 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 [2018-11-28 11:25:26,475 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:26,484 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:26,485 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 [2018-11-28 11:25:26,488 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:26,489 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 [2018-11-28 11:25:26,490 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:26,495 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:26,500 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:26,505 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:26,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, 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 [2018-11-28 11:25:26,555 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 [2018-11-28 11:25:26,555 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:26,589 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:26,589 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 [2018-11-28 11:25:26,592 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:26,593 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 [2018-11-28 11:25:26,593 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:26,603 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:26,604 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 [2018-11-28 11:25:26,608 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:26,609 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 [2018-11-28 11:25:26,610 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:26,617 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:26,622 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:26,626 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:26,628 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 [2018-11-28 11:25:26,631 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:26,632 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 [2018-11-28 11:25:26,632 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:26,646 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:26,650 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 [2018-11-28 11:25:26,652 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:26,652 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 [2018-11-28 11:25:26,653 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:26,657 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:26,664 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:26,673 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:26,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, 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 [2018-11-28 11:25:26,685 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:26,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 77 treesize of output 70 [2018-11-28 11:25:26,686 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:26,745 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:26,745 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 [2018-11-28 11:25:26,746 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:26,785 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:26,787 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:26,787 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:26,790 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:26,791 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 [2018-11-28 11:25:26,794 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:26,794 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:25:26,796 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:26,798 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:26,800 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 [2018-11-28 11:25:26,800 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:26,812 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:26,842 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:26,843 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 [2018-11-28 11:25:26,845 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:26,846 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 [2018-11-28 11:25:26,846 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:26,852 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:26,873 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:26,881 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 [2018-11-28 11:25:26,883 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:26,884 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 [2018-11-28 11:25:26,884 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:26,913 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 [2018-11-28 11:25:26,914 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:26,928 INFO L267 ElimStorePlain]: Start of recursive call 25: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:25:26,938 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:26,955 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 11:25:26,976 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 [2018-11-28 11:25:27,516 WARN L180 SmtUtils]: Spent 537.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 96 [2018-11-28 11:25:27,518 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 [2018-11-28 11:25:27,519 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:27,521 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 [2018-11-28 11:25:27,521 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:27,523 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 [2018-11-28 11:25:27,523 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:27,961 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 [2018-11-28 11:25:27,962 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:28,363 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:28,365 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:28,366 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 [2018-11-28 11:25:28,370 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:28,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 [2018-11-28 11:25:28,374 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:28,390 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:28,391 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:28,392 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:28,392 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 [2018-11-28 11:25:28,404 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 [2018-11-28 11:25:28,407 INFO L267 ElimStorePlain]: Start of recursive call 36: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-28 11:25:28,422 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:28,429 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:28,437 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:28,438 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:28,446 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 [2018-11-28 11:25:28,453 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:28,455 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 [2018-11-28 11:25:28,456 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:28,513 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:28,514 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 [2018-11-28 11:25:28,514 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:28,559 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:28,561 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:28,561 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:28,564 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 [2018-11-28 11:25:28,566 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:28,567 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 [2018-11-28 11:25:28,567 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:28,577 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:28,623 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:28,624 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 [2018-11-28 11:25:28,626 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:28,626 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 [2018-11-28 11:25:28,627 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:28,632 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:28,646 INFO L267 ElimStorePlain]: Start of recursive call 37: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:25:28,658 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:28,659 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:28,677 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 [2018-11-28 11:25:28,685 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-28 11:25:28,685 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:29,364 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:29,365 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 [2018-11-28 11:25:29,366 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:29,858 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:29,859 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 [2018-11-28 11:25:29,859 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:30,406 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:30,412 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 [2018-11-28 11:25:30,412 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 2 xjuncts. [2018-11-28 11:25:31,032 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:31,033 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:31,035 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:31,035 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:31,036 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:31,038 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:31,039 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 [2018-11-28 11:25:31,041 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:31,042 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:25:31,045 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:31,049 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:31,058 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 [2018-11-28 11:25:31,059 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 2 xjuncts. [2018-11-28 11:25:31,096 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:25:31,529 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:31,530 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:31,531 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:31,532 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 [2018-11-28 11:25:31,532 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:31,802 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:31,803 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 [2018-11-28 11:25:31,805 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:31,806 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 [2018-11-28 11:25:31,806 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:31,813 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:32,004 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:32,006 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:32,007 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:32,016 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 [2018-11-28 11:25:32,019 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:32,020 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 [2018-11-28 11:25:32,020 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:32,048 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:25:32,186 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:32,188 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:32,189 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:32,191 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 [2018-11-28 11:25:32,194 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:32,194 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 [2018-11-28 11:25:32,195 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:32,205 INFO L267 ElimStorePlain]: Start of recursive call 56: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:32,305 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:32,309 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:32,309 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:32,310 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:32,318 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 [2018-11-28 11:25:32,322 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 [2018-11-28 11:25:32,322 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:32,363 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:32,364 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:32,366 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 [2018-11-28 11:25:32,366 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:32,385 INFO L267 ElimStorePlain]: Start of recursive call 58: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:25:32,387 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:32,391 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:32,392 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:32,399 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 [2018-11-28 11:25:32,402 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 [2018-11-28 11:25:32,403 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:32,438 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:32,440 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 [2018-11-28 11:25:32,440 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:32,460 INFO L267 ElimStorePlain]: Start of recursive call 61: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:25:32,726 INFO L267 ElimStorePlain]: Start of recursive call 44: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-11-28 11:25:32,991 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:33,006 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 [2018-11-28 11:25:33,012 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-28 11:25:33,012 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:33,594 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:33,594 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 [2018-11-28 11:25:33,595 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:34,072 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:34,073 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 [2018-11-28 11:25:34,073 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:34,558 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:34,566 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 [2018-11-28 11:25:34,566 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:35,045 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:35,047 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 [2018-11-28 11:25:35,049 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:35,049 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 [2018-11-28 11:25:35,050 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:35,056 INFO L267 ElimStorePlain]: Start of recursive call 69: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:35,381 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:35,382 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:35,383 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:35,385 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:35,386 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 [2018-11-28 11:25:35,389 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:35,389 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:25:35,391 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:35,393 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:35,395 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 [2018-11-28 11:25:35,396 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:35,408 INFO L267 ElimStorePlain]: Start of recursive call 71: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:35,537 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:35,537 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:35,538 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:35,539 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 [2018-11-28 11:25:35,541 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:35,543 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:35,543 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:25:35,552 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:35,553 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:35,568 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 [2018-11-28 11:25:35,568 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 2 xjuncts. [2018-11-28 11:25:35,603 INFO L267 ElimStorePlain]: Start of recursive call 73: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:25:35,710 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:35,713 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:35,714 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:35,723 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 [2018-11-28 11:25:35,725 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:35,726 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 [2018-11-28 11:25:35,727 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:35,770 INFO L267 ElimStorePlain]: Start of recursive call 75: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:25:36,163 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:36,164 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 [2018-11-28 11:25:36,166 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:36,167 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 [2018-11-28 11:25:36,167 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:36,173 INFO L267 ElimStorePlain]: Start of recursive call 77: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:36,227 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:36,229 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 [2018-11-28 11:25:36,230 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:36,231 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 [2018-11-28 11:25:36,231 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:36,236 INFO L267 ElimStorePlain]: Start of recursive call 79: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:36,250 INFO L267 ElimStorePlain]: Start of recursive call 64: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:36,252 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:36,254 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 [2018-11-28 11:25:36,256 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:36,257 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 [2018-11-28 11:25:36,257 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:36,267 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:36,269 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 [2018-11-28 11:25:36,271 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:36,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 35 treesize of output 24 [2018-11-28 11:25:36,272 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:36,278 INFO L267 ElimStorePlain]: Start of recursive call 83: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:36,285 INFO L267 ElimStorePlain]: Start of recursive call 81: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:36,294 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:36,304 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 [2018-11-28 11:25:36,308 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:36,309 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 [2018-11-28 11:25:36,309 INFO L267 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:36,357 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:36,358 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 [2018-11-28 11:25:36,358 INFO L267 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:36,398 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:36,399 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 [2018-11-28 11:25:36,405 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:36,406 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 [2018-11-28 11:25:36,406 INFO L267 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:36,414 INFO L267 ElimStorePlain]: Start of recursive call 88: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:36,450 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:36,452 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:36,453 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:36,455 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 [2018-11-28 11:25:36,459 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:36,459 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 [2018-11-28 11:25:36,460 INFO L267 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:36,468 INFO L267 ElimStorePlain]: Start of recursive call 90: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:36,498 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:36,499 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 [2018-11-28 11:25:36,502 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:36,502 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 [2018-11-28 11:25:36,503 INFO L267 ElimStorePlain]: Start of recursive call 93: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:36,508 INFO L267 ElimStorePlain]: Start of recursive call 92: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:36,519 INFO L267 ElimStorePlain]: Start of recursive call 85: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:36,577 INFO L267 ElimStorePlain]: Start of recursive call 28: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 11:25:36,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:25:36,611 INFO L202 ElimStorePlain]: Needed 93 recursive calls to eliminate 5 variables, input treesize:150, output treesize:45 [2018-11-28 11:25:36,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:25:36,623 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-28 11:25:36,623 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 25 transitions. cyclomatic complexity: 6 Second operand 7 states. [2018-11-28 11:25:36,655 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. [2018-11-28 11:25:36,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 11:25:36,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 11:25:36,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 10 transitions. [2018-11-28 11:25:36,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 9 letters. Loop has 6 letters. [2018-11-28 11:25:36,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:25:36,656 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 11:25:36,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:36,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:36,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:25:36,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-28 11:25:36,683 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:36,684 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:36,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 11 treesize of output 4 [2018-11-28 11:25:36,684 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:36,687 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:36,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:36,690 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-11-28 11:25:36,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:36,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:25:36,785 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 [2018-11-28 11:25:36,814 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 [2018-11-28 11:25:36,814 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:36,846 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:36,847 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 [2018-11-28 11:25:36,849 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:36,850 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 [2018-11-28 11:25:36,850 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:36,859 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:36,860 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 [2018-11-28 11:25:36,862 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:36,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 33 treesize of output 22 [2018-11-28 11:25:36,863 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:36,867 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:36,871 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:36,874 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:36,876 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 [2018-11-28 11:25:36,878 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:36,878 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 [2018-11-28 11:25:36,878 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:36,890 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:36,891 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 [2018-11-28 11:25:36,893 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:36,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, 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 [2018-11-28 11:25:36,893 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:36,899 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:36,904 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:36,911 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:36,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, 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 [2018-11-28 11:25:36,929 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:36,930 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 [2018-11-28 11:25:36,931 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:36,986 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:36,986 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 [2018-11-28 11:25:36,987 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:37,024 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:37,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, 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 [2018-11-28 11:25:37,028 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:37,028 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 [2018-11-28 11:25:37,029 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:37,038 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:37,077 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:37,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, 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 [2018-11-28 11:25:37,081 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:37,082 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 [2018-11-28 11:25:37,082 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:37,094 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:37,109 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:37,130 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 11:25:37,157 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 [2018-11-28 11:25:37,750 WARN L180 SmtUtils]: Spent 590.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 96 [2018-11-28 11:25:37,752 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 [2018-11-28 11:25:37,752 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:37,754 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 [2018-11-28 11:25:37,754 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:37,756 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 [2018-11-28 11:25:37,756 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:38,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, 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 [2018-11-28 11:25:38,090 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:38,451 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:38,452 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:38,467 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 [2018-11-28 11:25:38,482 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:38,490 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 [2018-11-28 11:25:38,491 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 2 xjuncts. [2018-11-28 11:25:39,251 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:39,253 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 [2018-11-28 11:25:39,254 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:39,856 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:39,856 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 [2018-11-28 11:25:39,857 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:41,094 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:41,098 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:41,098 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:41,100 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 [2018-11-28 11:25:41,102 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:41,103 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 [2018-11-28 11:25:41,103 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:41,113 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:41,451 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:41,454 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:41,455 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:41,456 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:41,464 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 [2018-11-28 11:25:41,467 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 [2018-11-28 11:25:41,468 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:41,506 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:25:41,985 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:41,986 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:41,986 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:41,988 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:41,988 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:41,989 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:41,991 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 [2018-11-28 11:25:41,994 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:41,995 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:25:41,998 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:42,001 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:42,010 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 [2018-11-28 11:25:42,011 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 2 xjuncts. [2018-11-28 11:25:42,049 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:25:42,260 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:42,260 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:42,261 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:42,262 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 [2018-11-28 11:25:42,265 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:42,266 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:42,267 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:25:42,271 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:42,272 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:42,282 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 [2018-11-28 11:25:42,282 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 2 xjuncts. [2018-11-28 11:25:42,317 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:25:42,507 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:42,509 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:42,510 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:42,512 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 [2018-11-28 11:25:42,514 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:42,515 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 [2018-11-28 11:25:42,515 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:42,528 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:42,833 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:42,835 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 [2018-11-28 11:25:42,837 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:42,837 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 [2018-11-28 11:25:42,837 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:42,844 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:42,951 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:42,954 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:42,955 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:42,963 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 [2018-11-28 11:25:42,965 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 [2018-11-28 11:25:42,966 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:43,004 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:43,005 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 [2018-11-28 11:25:43,006 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:43,024 INFO L267 ElimStorePlain]: Start of recursive call 40: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:25:43,026 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:43,029 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:43,030 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:43,031 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:43,039 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 [2018-11-28 11:25:43,043 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 [2018-11-28 11:25:43,043 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:43,099 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:43,100 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:43,102 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 [2018-11-28 11:25:43,102 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:43,126 INFO L267 ElimStorePlain]: Start of recursive call 43: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:25:43,205 INFO L267 ElimStorePlain]: Start of recursive call 24: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-11-28 11:25:43,212 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:43,213 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:43,221 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 [2018-11-28 11:25:43,224 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:43,226 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 [2018-11-28 11:25:43,227 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:43,278 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:43,279 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 [2018-11-28 11:25:43,279 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:43,319 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:43,321 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:43,322 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:43,324 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 [2018-11-28 11:25:43,326 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:43,326 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 [2018-11-28 11:25:43,326 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:43,335 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:43,374 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:43,375 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 [2018-11-28 11:25:43,378 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:43,378 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 [2018-11-28 11:25:43,379 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:43,384 INFO L267 ElimStorePlain]: Start of recursive call 51: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:43,398 INFO L267 ElimStorePlain]: Start of recursive call 46: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:25:43,401 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:43,402 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:43,403 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 [2018-11-28 11:25:43,405 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:43,408 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 [2018-11-28 11:25:43,408 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:43,422 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:43,423 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:43,424 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:43,424 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 [2018-11-28 11:25:43,435 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 [2018-11-28 11:25:43,437 INFO L267 ElimStorePlain]: Start of recursive call 56: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-28 11:25:43,449 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:43,456 INFO L267 ElimStorePlain]: Start of recursive call 53: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:43,642 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:43,655 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 [2018-11-28 11:25:43,668 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:43,669 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 [2018-11-28 11:25:43,669 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:44,406 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:44,407 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 [2018-11-28 11:25:44,407 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:44,939 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:44,940 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 [2018-11-28 11:25:44,940 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:45,996 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:45,998 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:45,999 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:46,001 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 [2018-11-28 11:25:46,003 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:46,004 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 [2018-11-28 11:25:46,004 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:46,017 INFO L267 ElimStorePlain]: Start of recursive call 61: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:46,368 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:46,370 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 [2018-11-28 11:25:46,372 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:46,372 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 [2018-11-28 11:25:46,372 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:46,379 INFO L267 ElimStorePlain]: Start of recursive call 63: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:46,572 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:46,575 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:46,576 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:46,577 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:46,585 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 [2018-11-28 11:25:46,587 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 [2018-11-28 11:25:46,587 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:46,623 INFO L267 ElimStorePlain]: Start of recursive call 65: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:25:46,848 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:46,848 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:46,849 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:46,850 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 [2018-11-28 11:25:46,852 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:46,853 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:46,854 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:25:46,857 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:46,859 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:46,867 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 [2018-11-28 11:25:46,868 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 2 xjuncts. [2018-11-28 11:25:46,902 INFO L267 ElimStorePlain]: Start of recursive call 67: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:25:46,975 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:46,976 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 [2018-11-28 11:25:46,978 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:46,978 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 [2018-11-28 11:25:46,979 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:46,985 INFO L267 ElimStorePlain]: Start of recursive call 69: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:47,034 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:47,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 2 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 70 [2018-11-28 11:25:47,046 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 [2018-11-28 11:25:47,046 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:47,071 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:47,072 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 [2018-11-28 11:25:47,072 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:47,086 INFO L267 ElimStorePlain]: Start of recursive call 71: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:25:47,099 INFO L267 ElimStorePlain]: Start of recursive call 57: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:47,102 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:47,103 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 [2018-11-28 11:25:47,106 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:47,106 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 [2018-11-28 11:25:47,107 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:47,117 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:47,118 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 [2018-11-28 11:25:47,120 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:47,120 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 [2018-11-28 11:25:47,120 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:47,124 INFO L267 ElimStorePlain]: Start of recursive call 76: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:47,130 INFO L267 ElimStorePlain]: Start of recursive call 74: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:47,137 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:47,144 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 [2018-11-28 11:25:47,147 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:47,148 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 [2018-11-28 11:25:47,148 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:47,197 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:47,198 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 [2018-11-28 11:25:47,198 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:47,238 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:47,239 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 [2018-11-28 11:25:47,241 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:47,241 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 [2018-11-28 11:25:47,241 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:47,248 INFO L267 ElimStorePlain]: Start of recursive call 81: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:47,267 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:47,268 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 [2018-11-28 11:25:47,270 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:47,270 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 [2018-11-28 11:25:47,271 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:47,276 INFO L267 ElimStorePlain]: Start of recursive call 83: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:47,290 INFO L267 ElimStorePlain]: Start of recursive call 78: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:47,347 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 11:25:47,351 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 [2018-11-28 11:25:47,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 11:25:47,380 INFO L267 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:47,392 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:47,393 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 [2018-11-28 11:25:47,395 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 [2018-11-28 11:25:47,395 INFO L267 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:47,404 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:47,406 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 [2018-11-28 11:25:47,408 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:47,409 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 [2018-11-28 11:25:47,409 INFO L267 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:47,414 INFO L267 ElimStorePlain]: Start of recursive call 89: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:47,419 INFO L267 ElimStorePlain]: Start of recursive call 87: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:47,424 INFO L267 ElimStorePlain]: Start of recursive call 85: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:47,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:25:47,459 INFO L202 ElimStorePlain]: Needed 90 recursive calls to eliminate 5 variables, input treesize:150, output treesize:45 [2018-11-28 11:25:47,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:25:47,472 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-28 11:25:47,472 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 25 transitions. cyclomatic complexity: 6 Second operand 7 states. [2018-11-28 11:25:47,507 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. [2018-11-28 11:25:47,508 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 [2018-11-28 11:25:47,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 11:25:47,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2018-11-28 11:25:47,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. Stem has 9 letters. Loop has 6 letters. [2018-11-28 11:25:47,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:25:47,508 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 11:25:47,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:47,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:47,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:25:47,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-28 11:25:47,540 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:47,541 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:47,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 11 treesize of output 4 [2018-11-28 11:25:47,541 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:47,544 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:47,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:47,547 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-11-28 11:25:47,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:47,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:25:47,618 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 [2018-11-28 11:25:47,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 8 treesize of output 7 [2018-11-28 11:25:47,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:47,669 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:47,670 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 [2018-11-28 11:25:47,672 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 [2018-11-28 11:25:47,672 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:47,682 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:47,684 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 [2018-11-28 11:25:47,686 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:47,686 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 [2018-11-28 11:25:47,686 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:47,691 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:47,695 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:47,701 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:47,712 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 [2018-11-28 11:25:47,742 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 [2018-11-28 11:25:47,742 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:47,773 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:47,775 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 [2018-11-28 11:25:47,778 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:47,778 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 [2018-11-28 11:25:47,779 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:47,788 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:47,790 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 [2018-11-28 11:25:47,792 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:47,793 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 [2018-11-28 11:25:47,793 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:47,798 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:47,803 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:47,809 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:47,817 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 [2018-11-28 11:25:47,820 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:47,820 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 [2018-11-28 11:25:47,820 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:47,831 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:47,832 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 [2018-11-28 11:25:47,834 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:47,835 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 [2018-11-28 11:25:47,835 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:47,840 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:47,844 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:47,851 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:47,859 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 [2018-11-28 11:25:47,862 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:47,862 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 [2018-11-28 11:25:47,863 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:47,911 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:47,912 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 [2018-11-28 11:25:47,912 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:47,950 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:47,952 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 [2018-11-28 11:25:47,955 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:47,955 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 [2018-11-28 11:25:47,956 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:47,962 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:47,993 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:47,994 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:47,995 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:47,996 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:47,998 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 [2018-11-28 11:25:48,001 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:48,002 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:25:48,004 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:48,005 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:48,008 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 [2018-11-28 11:25:48,008 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:48,019 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:48,041 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:48,042 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 [2018-11-28 11:25:48,044 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:48,045 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 [2018-11-28 11:25:48,045 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:48,050 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:48,059 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:48,077 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 11:25:48,097 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 [2018-11-28 11:25:48,632 WARN L180 SmtUtils]: Spent 532.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 96 [2018-11-28 11:25:48,634 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 [2018-11-28 11:25:48,634 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:48,636 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 [2018-11-28 11:25:48,637 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:48,638 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 [2018-11-28 11:25:48,639 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:48,972 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 [2018-11-28 11:25:48,973 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:49,299 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:49,300 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:49,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, 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 [2018-11-28 11:25:49,304 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:49,306 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 [2018-11-28 11:25:49,307 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:49,321 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:49,322 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:49,323 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:49,323 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 [2018-11-28 11:25:49,334 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 [2018-11-28 11:25:49,335 INFO L267 ElimStorePlain]: Start of recursive call 35: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-28 11:25:49,348 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:49,355 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:49,362 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:49,363 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:49,371 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 [2018-11-28 11:25:49,378 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:49,380 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 [2018-11-28 11:25:49,382 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:49,387 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 [2018-11-28 11:25:49,388 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 11:25:49,398 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:49,445 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:49,447 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 [2018-11-28 11:25:49,447 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:49,488 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:49,490 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:49,490 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:49,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, 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 [2018-11-28 11:25:49,495 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:49,495 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 [2018-11-28 11:25:49,496 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:49,505 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:49,538 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:49,539 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 [2018-11-28 11:25:49,541 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:49,541 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 [2018-11-28 11:25:49,542 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:49,547 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:49,574 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:49,576 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:49,577 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:49,579 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 [2018-11-28 11:25:49,581 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:49,581 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 [2018-11-28 11:25:49,581 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:49,590 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:49,606 INFO L267 ElimStorePlain]: Start of recursive call 36: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:25:49,615 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:49,615 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:49,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, 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 [2018-11-28 11:25:49,639 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:49,645 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 [2018-11-28 11:25:49,646 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 2 xjuncts. [2018-11-28 11:25:50,445 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:50,445 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 [2018-11-28 11:25:50,445 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:51,615 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:51,616 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 [2018-11-28 11:25:51,616 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:52,168 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:52,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 55 [2018-11-28 11:25:52,171 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:52,171 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 [2018-11-28 11:25:52,172 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:52,178 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:52,553 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:52,554 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:52,555 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:52,556 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 [2018-11-28 11:25:52,556 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:52,813 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:52,813 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:52,814 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:52,816 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:52,816 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:52,817 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:52,819 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 [2018-11-28 11:25:52,822 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:52,822 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:25:52,827 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:52,829 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:52,841 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 [2018-11-28 11:25:52,842 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 2 xjuncts. [2018-11-28 11:25:52,891 INFO L267 ElimStorePlain]: Start of recursive call 53: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:25:53,708 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:53,710 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:53,711 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:53,713 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 [2018-11-28 11:25:53,716 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:53,716 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 [2018-11-28 11:25:53,717 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:53,728 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:53,986 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:53,990 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:53,991 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:53,992 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:54,001 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 [2018-11-28 11:25:54,004 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 [2018-11-28 11:25:54,005 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:54,055 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:54,057 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:54,059 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 [2018-11-28 11:25:54,059 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:54,084 INFO L267 ElimStorePlain]: Start of recursive call 57: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:25:54,086 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:54,090 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:54,092 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:54,101 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 [2018-11-28 11:25:54,104 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 [2018-11-28 11:25:54,104 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:54,146 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:54,147 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 [2018-11-28 11:25:54,148 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:54,170 INFO L267 ElimStorePlain]: Start of recursive call 60: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:25:54,263 INFO L267 ElimStorePlain]: Start of recursive call 46: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-11-28 11:25:54,503 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:54,514 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 [2018-11-28 11:25:54,518 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:54,518 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 [2018-11-28 11:25:54,519 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:54,568 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:54,569 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 [2018-11-28 11:25:54,569 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:54,610 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:54,611 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 [2018-11-28 11:25:54,613 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:54,613 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 [2018-11-28 11:25:54,613 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:54,619 INFO L267 ElimStorePlain]: Start of recursive call 66: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:54,650 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:54,652 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:54,652 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:54,654 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 [2018-11-28 11:25:54,656 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:54,657 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 [2018-11-28 11:25:54,657 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:54,666 INFO L267 ElimStorePlain]: Start of recursive call 68: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:54,691 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:54,692 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 [2018-11-28 11:25:54,695 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:54,696 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 [2018-11-28 11:25:54,696 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:54,701 INFO L267 ElimStorePlain]: Start of recursive call 70: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:54,712 INFO L267 ElimStorePlain]: Start of recursive call 63: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:54,715 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:54,716 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 [2018-11-28 11:25:54,719 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:54,719 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 [2018-11-28 11:25:54,720 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:54,732 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:54,734 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 [2018-11-28 11:25:54,736 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:54,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, 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 [2018-11-28 11:25:54,737 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:54,741 INFO L267 ElimStorePlain]: Start of recursive call 74: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:54,746 INFO L267 ElimStorePlain]: Start of recursive call 72: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:54,754 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:54,769 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 [2018-11-28 11:25:54,776 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:54,777 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 [2018-11-28 11:25:54,777 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:55,610 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:55,611 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 [2018-11-28 11:25:55,611 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:56,119 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:56,119 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 [2018-11-28 11:25:56,119 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:57,111 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:57,112 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:57,113 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:57,113 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 [2018-11-28 11:25:57,114 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:57,508 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:57,509 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 [2018-11-28 11:25:57,511 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:57,512 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 [2018-11-28 11:25:57,512 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:57,519 INFO L267 ElimStorePlain]: Start of recursive call 81: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:57,637 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:57,639 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 [2018-11-28 11:25:57,641 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:57,642 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 [2018-11-28 11:25:57,642 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:57,648 INFO L267 ElimStorePlain]: Start of recursive call 83: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:57,692 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:57,692 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:57,693 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:57,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, 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 [2018-11-28 11:25:57,696 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:57,697 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:57,697 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:25:57,701 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:57,703 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:57,711 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 [2018-11-28 11:25:57,712 INFO L267 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 2 xjuncts. [2018-11-28 11:25:57,746 INFO L267 ElimStorePlain]: Start of recursive call 85: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:25:57,944 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:57,946 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 [2018-11-28 11:25:57,948 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:25:57,948 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 [2018-11-28 11:25:57,949 INFO L267 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2018-11-28 11:25:57,956 INFO L267 ElimStorePlain]: Start of recursive call 87: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:57,976 INFO L267 ElimStorePlain]: Start of recursive call 76: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:25:58,039 INFO L267 ElimStorePlain]: Start of recursive call 27: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 11:25:58,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:25:58,076 INFO L202 ElimStorePlain]: Needed 88 recursive calls to eliminate 5 variables, input treesize:150, output treesize:45 [2018-11-28 11:25:58,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:25:58,089 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-28 11:25:58,089 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 25 transitions. cyclomatic complexity: 6 Second operand 7 states. [2018-11-28 11:25:58,121 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. [2018-11-28 11:25:58,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 11:25:58,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 11:25:58,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2018-11-28 11:25:58,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 9 letters. Loop has 6 letters. [2018-11-28 11:25:58,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:25:58,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 15 letters. Loop has 6 letters. [2018-11-28 11:25:58,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:25:58,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 9 letters. Loop has 12 letters. [2018-11-28 11:25:58,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:25:58,123 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 53 transitions. [2018-11-28 11:25:58,123 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-28 11:25:58,124 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 25 states and 29 transitions. [2018-11-28 11:25:58,124 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2018-11-28 11:25:58,124 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2018-11-28 11:25:58,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 29 transitions. [2018-11-28 11:25:58,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:25:58,124 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2018-11-28 11:25:58,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 29 transitions. [2018-11-28 11:25:58,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 16. [2018-11-28 11:25:58,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-28 11:25:58,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2018-11-28 11:25:58,125 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-11-28 11:25:58,125 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-11-28 11:25:58,125 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 11:25:58,125 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2018-11-28 11:25:58,125 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-28 11:25:58,125 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:25:58,125 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:25:58,126 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:25:58,126 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1] [2018-11-28 11:25:58,126 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.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~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~short7;havoc main_#t~short9;havoc main_#t~mem6;havoc main_#t~mem5;havoc main_#t~mem8; 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 [2018-11-28 11:25:58,126 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~short7;havoc main_#t~short9;havoc main_#t~mem6;havoc main_#t~mem5;havoc main_#t~mem8; 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~short7;havoc main_#t~short9;havoc main_#t~mem6;havoc main_#t~mem5;havoc main_#t~mem8; 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 [2018-11-28 11:25:58,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:58,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1211450491, now seen corresponding path program 3 times [2018-11-28 11:25:58,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:25:58,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:25:58,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:58,127 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:25:58,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:58,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:25:58,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:25:58,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:58,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1005496147, now seen corresponding path program 1 times [2018-11-28 11:25:58,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:25:58,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:25:58,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:58,139 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:25:58,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:58,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:25:58,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:25:58,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:58,150 INFO L82 PathProgramCache]: Analyzing trace with hash -588138969, now seen corresponding path program 4 times [2018-11-28 11:25:58,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:25:58,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:25:58,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:58,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:25:58,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:58,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:25:58,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:25:58,510 WARN L180 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 106 [2018-11-28 11:25:58,860 WARN L180 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 81 [2018-11-28 11:25:59,083 WARN L180 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 106 [2018-11-28 11:25:59,433 WARN L180 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 90 [2018-11-28 11:25:59,435 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:25:59,435 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:25:59,435 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:25:59,435 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:25:59,435 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:25:59,435 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:25:59,435 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:25:59,435 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:25:59,436 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i_Iteration7_Lasso [2018-11-28 11:25:59,436 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:25:59,436 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:25:59,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:59,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:59,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:59,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:59,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:59,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:59,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:59,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:59,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:59,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:59,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:59,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:59,737 WARN L180 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2018-11-28 11:25:59,943 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2018-11-28 11:25:59,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:59,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:59,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:25:59,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:26:00,239 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:26:00,239 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:26:00,239 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:26:00,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:26:00,240 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:26:00,240 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:26:00,240 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:26:00,240 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:26:00,240 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:26:00,241 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:26:00,242 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:26:00,242 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:26:00,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:26:00,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:26:00,242 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:26:00,243 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:26:00,243 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:26:00,243 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:26:00,244 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:26:00,244 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:26:00,244 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:26:00,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:26:00,244 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:26:00,245 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:26:00,245 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:26:00,246 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:26:00,246 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:26:00,246 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:26:00,246 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:26:00,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:26:00,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:26:00,247 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:26:00,247 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:26:00,247 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:26:00,247 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:26:00,248 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:26:00,248 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:26:00,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:26:00,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:26:00,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:26:00,249 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:26:00,249 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:26:00,250 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:26:00,250 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:26:00,251 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:26:00,251 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:26:00,251 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:26:00,251 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:26:00,251 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:26:00,251 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:26:00,252 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:26:00,252 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:26:00,252 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:26:00,253 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:26:00,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:26:00,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:26:00,253 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:26:00,253 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:26:00,253 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:26:00,254 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:26:00,255 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:26:00,255 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:26:00,255 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:26:00,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:26:00,255 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:26:00,255 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:26:00,256 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:26:00,256 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:26:00,256 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:26:00,256 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:26:00,257 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:26:00,257 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:26:00,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:26:00,257 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:26:00,257 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:26:00,257 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:26:00,257 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:26:00,258 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:26:00,258 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:26:00,258 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:26:00,258 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:26:00,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:26:00,259 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:26:00,259 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:26:00,259 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:26:00,260 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:26:00,261 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:26:00,261 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:26:00,261 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:26:00,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:26:00,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:26:00,261 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:26:00,261 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:26:00,262 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:26:00,262 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:26:00,262 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:26:00,263 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:26:00,263 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:26:00,263 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:26:00,263 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:26:00,264 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:26:00,273 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:26:00,281 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:26:00,281 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:26:00,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:26:00,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:26:00,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:26:00,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:26:00,283 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:26:00,283 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:26:00,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:26:00,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 [2018-11-28 11:26:00,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:26:00,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:26:00,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:26:00,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:26:00,287 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:26:00,287 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:26:00,290 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:26:00,290 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:26:00,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:26:00,290 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:26:00,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:26:00,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:26:00,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:26:00,291 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:26:00,291 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:26:00,292 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:26:00,293 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 11:26:00,293 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 11:26:00,294 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:26:00,294 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 11:26:00,294 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:26:00,294 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 [] [2018-11-28 11:26:00,424 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2018-11-28 11:26:00,427 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 11:26:00,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:26:00,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:26:00,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:26:00,451 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:26:00,452 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 [2018-11-28 11:26:00,462 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:26:00,462 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:26:00,463 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 [2018-11-28 11:26:00,463 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:26:00,465 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:26:00,468 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:26:00,468 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-11-28 11:26:00,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:26:00,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:26:00,562 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 [2018-11-28 11:26:00,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 [2018-11-28 11:26:00,590 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:26:00,609 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:26:00,612 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 [2018-11-28 11:26:00,614 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:26:00,614 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 [2018-11-28 11:26:00,614 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:26:00,625 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:26:00,636 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 [2018-11-28 11:26:00,638 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:26:00,639 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 [2018-11-28 11:26:00,639 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 11:26:00,661 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:26:00,668 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 [2018-11-28 11:26:00,669 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 3 xjuncts. [2018-11-28 11:26:00,688 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-28 11:26:00,704 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 11:26:00,721 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 11:26:00,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 11:26:00,740 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:154, output treesize:93 [2018-11-28 11:26:00,764 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:26:00,766 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 [2018-11-28 11:26:00,768 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:26:00,768 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 [2018-11-28 11:26:00,768 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:26:00,776 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 [2018-11-28 11:26:00,777 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 [2018-11-28 11:26:00,777 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:26:00,781 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:26:00,784 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:26:00,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:26:00,789 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:64, output treesize:25 [2018-11-28 11:26:00,789 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 11:26:00,790 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 [2018-11-28 11:26:00,790 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 4 Second operand 7 states. [2018-11-28 11:26:00,848 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. [2018-11-28 11:26:00,849 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 [2018-11-28 11:26:00,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 11:26:00,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2018-11-28 11:26:00,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 9 letters. Loop has 12 letters. [2018-11-28 11:26:00,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:26:00,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 21 letters. Loop has 12 letters. [2018-11-28 11:26:00,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:26:00,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 9 letters. Loop has 24 letters. [2018-11-28 11:26:00,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:26:00,850 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 69 transitions. [2018-11-28 11:26:00,851 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 11:26:00,851 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 0 states and 0 transitions. [2018-11-28 11:26:00,851 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 11:26:00,851 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 11:26:00,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 11:26:00,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:26:00,851 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:26:00,851 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:26:00,851 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:26:00,851 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-28 11:26:00,852 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 11:26:00,852 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 11:26:00,852 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 11:26:00,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:26:00 BoogieIcfgContainer [2018-11-28 11:26:00,857 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 11:26:00,858 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 11:26:00,858 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 11:26:00,858 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 11:26:00,858 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:25:18" (3/4) ... [2018-11-28 11:26:00,861 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 11:26:00,861 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 11:26:00,862 INFO L168 Benchmark]: Toolchain (without parser) took 43089.83 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 556.3 MB). Free memory was 956.0 MB in the beginning and 1.4 GB in the end (delta: -445.2 MB). Peak memory consumption was 111.1 MB. Max. memory is 11.5 GB. [2018-11-28 11:26:00,862 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:26:00,862 INFO L168 Benchmark]: CACSL2BoogieTranslator took 293.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.9 MB). Free memory was 956.0 MB in the beginning and 1.2 GB in the end (delta: -203.0 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2018-11-28 11:26:00,862 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-28 11:26:00,863 INFO L168 Benchmark]: Boogie Preprocessor took 14.51 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:26:00,863 INFO L168 Benchmark]: RCFGBuilder took 195.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 21.3 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. [2018-11-28 11:26:00,863 INFO L168 Benchmark]: BuchiAutomizer took 42550.71 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 385.4 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -266.8 MB). Peak memory consumption was 118.5 MB. Max. memory is 11.5 GB. [2018-11-28 11:26:00,863 INFO L168 Benchmark]: Witness Printer took 3.61 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:26:00,864 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 293.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.9 MB). Free memory was 956.0 MB in the beginning and 1.2 GB in the end (delta: -203.0 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.51 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 195.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 21.3 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 42550.71 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 385.4 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -266.8 MB). Peak memory consumption was 118.5 MB. Max. memory is 11.5 GB. * Witness Printer took 3.61 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 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 42.5s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 9.3s. Construction of modules took 0.1s. Büchi inclusion checks took 32.8s. 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.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso6 LassoPreprocessingBenchmarks: Lassos: inital1222 mio100 ax103 hnf99 lsp80 ukn49 mio100 lsp34 div100 bol103 ite100 ukn100 eq178 hnf88 smp97 dnf124 smp86 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...