./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/BrockschmidtCookFuhs-2013CAV-Fig1-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_942fb0c5-24e1-40d7-b7a4-e3e8821e4994/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_942fb0c5-24e1-40d7-b7a4-e3e8821e4994/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_942fb0c5-24e1-40d7-b7a4-e3e8821e4994/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_942fb0c5-24e1-40d7-b7a4-e3e8821e4994/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/BrockschmidtCookFuhs-2013CAV-Fig1-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_942fb0c5-24e1-40d7-b7a4-e3e8821e4994/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_942fb0c5-24e1-40d7-b7a4-e3e8821e4994/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 a079d984022841e109b79b050a47d1f747be0a48 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 06:12:42,742 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:12:42,743 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:12:42,752 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:12:42,752 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:12:42,753 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:12:42,754 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:12:42,756 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:12:42,757 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:12:42,757 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:12:42,758 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:12:42,758 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:12:42,759 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:12:42,760 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:12:42,761 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:12:42,761 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:12:42,762 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:12:42,767 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:12:42,768 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:12:42,770 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:12:42,772 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:12:42,773 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:12:42,775 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:12:42,775 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:12:42,775 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:12:42,776 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:12:42,777 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:12:42,777 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:12:42,778 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:12:42,779 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:12:42,779 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:12:42,779 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:12:42,780 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:12:42,780 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:12:42,780 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:12:42,781 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:12:42,781 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_942fb0c5-24e1-40d7-b7a4-e3e8821e4994/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-10-27 06:12:42,794 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:12:42,794 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:12:42,795 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:12:42,795 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:12:42,795 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:12:42,795 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:12:42,795 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:12:42,796 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:12:42,796 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:12:42,796 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:12:42,796 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:12:42,796 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:12:42,796 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:12:42,796 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:12:42,797 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:12:42,797 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:12:42,797 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:12:42,797 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:12:42,797 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:12:42,797 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:12:42,797 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:12:42,798 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:12:42,798 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:12:42,798 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:12:42,798 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:12:42,798 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:12:42,798 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:12:42,802 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:12:42,802 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_942fb0c5-24e1-40d7-b7a4-e3e8821e4994/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 -> a079d984022841e109b79b050a47d1f747be0a48 [2018-10-27 06:12:42,835 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:12:42,846 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:12:42,852 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:12:42,853 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:12:42,854 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:12:42,854 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_942fb0c5-24e1-40d7-b7a4-e3e8821e4994/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/BrockschmidtCookFuhs-2013CAV-Fig1-alloca_true-termination.c.i [2018-10-27 06:12:42,904 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_942fb0c5-24e1-40d7-b7a4-e3e8821e4994/bin-2019/uautomizer/data/be4db488e/9bd2ec50261740aaa59662068d4e0bd3/FLAG5b683014a [2018-10-27 06:12:43,310 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:12:43,311 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_942fb0c5-24e1-40d7-b7a4-e3e8821e4994/sv-benchmarks/c/termination-memory-alloca/BrockschmidtCookFuhs-2013CAV-Fig1-alloca_true-termination.c.i [2018-10-27 06:12:43,321 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_942fb0c5-24e1-40d7-b7a4-e3e8821e4994/bin-2019/uautomizer/data/be4db488e/9bd2ec50261740aaa59662068d4e0bd3/FLAG5b683014a [2018-10-27 06:12:43,334 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_942fb0c5-24e1-40d7-b7a4-e3e8821e4994/bin-2019/uautomizer/data/be4db488e/9bd2ec50261740aaa59662068d4e0bd3 [2018-10-27 06:12:43,337 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:12:43,338 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:12:43,339 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:12:43,339 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:12:43,342 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:12:43,343 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:12:43" (1/1) ... [2018-10-27 06:12:43,345 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3493b476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:43, skipping insertion in model container [2018-10-27 06:12:43,346 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:12:43" (1/1) ... [2018-10-27 06:12:43,354 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:12:43,386 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:12:43,596 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:12:43,605 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:12:43,658 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:12:43,699 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:12:43,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:43 WrapperNode [2018-10-27 06:12:43,700 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:12:43,701 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:12:43,701 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:12:43,701 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:12:43,707 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:43" (1/1) ... [2018-10-27 06:12:43,718 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:43" (1/1) ... [2018-10-27 06:12:43,791 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:12:43,792 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:12:43,792 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:12:43,792 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:12:43,798 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:43" (1/1) ... [2018-10-27 06:12:43,798 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:43" (1/1) ... [2018-10-27 06:12:43,801 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:43" (1/1) ... [2018-10-27 06:12:43,801 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:43" (1/1) ... [2018-10-27 06:12:43,804 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:43" (1/1) ... [2018-10-27 06:12:43,813 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:43" (1/1) ... [2018-10-27 06:12:43,814 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:43" (1/1) ... [2018-10-27 06:12:43,816 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:12:43,816 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:12:43,816 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:12:43,816 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:12:43,817 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_942fb0c5-24e1-40d7-b7a4-e3e8821e4994/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-10-27 06:12:43,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-27 06:12:43,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-27 06:12:43,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:12:43,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:12:44,292 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:12:44,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:12:44 BoogieIcfgContainer [2018-10-27 06:12:44,292 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:12:44,293 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:12:44,293 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:12:44,297 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:12:44,297 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:12:44,298 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:12:43" (1/3) ... [2018-10-27 06:12:44,299 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@287dde0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:12:44, skipping insertion in model container [2018-10-27 06:12:44,299 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:12:44,299 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:43" (2/3) ... [2018-10-27 06:12:44,299 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@287dde0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:12:44, skipping insertion in model container [2018-10-27 06:12:44,299 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:12:44,300 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:12:44" (3/3) ... [2018-10-27 06:12:44,301 INFO L375 chiAutomizerObserver]: Analyzing ICFG BrockschmidtCookFuhs-2013CAV-Fig1-alloca_true-termination.c.i [2018-10-27 06:12:44,341 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:12:44,341 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:12:44,341 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:12:44,342 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:12:44,342 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:12:44,342 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:12:44,342 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:12:44,342 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:12:44,342 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:12:44,355 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-10-27 06:12:44,378 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:12:44,378 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:12:44,379 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:12:44,383 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:12:44,383 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:44,383 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:12:44,384 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-10-27 06:12:44,385 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:12:44,385 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:12:44,385 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:12:44,385 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:12:44,386 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:44,392 INFO L793 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~mem9, main_#t~mem7, main_#t~mem8, main_#t~mem10, main_#t~mem5, main_#t~mem6, main_~i~0.base, main_~i~0.offset, main_~j~0.base, main_~j~0.offset, main_~n~0.base, main_~n~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~j~0.base, main_~j~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~n~0.base, main_~n~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 8#L550-5true [2018-10-27 06:12:44,392 INFO L795 eck$LassoCheckResult]: Loop: 8#L550-5true assume true; 23#L550-1true SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L550-1 3#L550-2true SUMMARY for call main_#t~mem6 := read~int(main_~n~0.base, main_~n~0.offset, 4); srcloc: L550-2 5#L550-3true assume !!(main_#t~mem5 < main_#t~mem6);havoc main_#t~mem6;havoc main_#t~mem5; 17#L551true SUMMARY for call write~int(0, main_~j~0.base, main_~j~0.offset, 4); srcloc: L551 4#L552-4true assume !true; 6#L552-5true SUMMARY for call main_#t~mem10 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-5 9#L555true SUMMARY for call write~int(main_#t~mem10 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L555 11#L555-1true havoc main_#t~mem10; 8#L550-5true [2018-10-27 06:12:44,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:44,397 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-10-27 06:12:44,398 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:44,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:44,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:44,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:44,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:44,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:44,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:44,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:44,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1580478326, now seen corresponding path program 1 times [2018-10-27 06:12:44,480 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:44,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:44,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:44,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:44,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:44,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:44,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:44,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:12:44,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 06:12:44,521 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:12:44,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-27 06:12:44,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 06:12:44,537 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2018-10-27 06:12:44,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:12:44,543 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-10-27 06:12:44,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-27 06:12:44,545 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 22 transitions. [2018-10-27 06:12:44,546 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:12:44,551 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 18 transitions. [2018-10-27 06:12:44,552 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-10-27 06:12:44,553 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-10-27 06:12:44,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 18 transitions. [2018-10-27 06:12:44,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:12:44,554 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-10-27 06:12:44,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 18 transitions. [2018-10-27 06:12:44,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-10-27 06:12:44,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-27 06:12:44,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-10-27 06:12:44,577 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-10-27 06:12:44,577 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-10-27 06:12:44,577 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:12:44,577 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 18 transitions. [2018-10-27 06:12:44,578 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:12:44,578 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:12:44,578 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:12:44,578 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:12:44,578 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:44,579 INFO L793 eck$LassoCheckResult]: Stem: 63#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 60#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~mem9, main_#t~mem7, main_#t~mem8, main_#t~mem10, main_#t~mem5, main_#t~mem6, main_~i~0.base, main_~i~0.offset, main_~j~0.base, main_~j~0.offset, main_~n~0.base, main_~n~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~j~0.base, main_~j~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~n~0.base, main_~n~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 57#L550-5 [2018-10-27 06:12:44,579 INFO L795 eck$LassoCheckResult]: Loop: 57#L550-5 assume true; 58#L550-1 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L550-1 50#L550-2 SUMMARY for call main_#t~mem6 := read~int(main_~n~0.base, main_~n~0.offset, 4); srcloc: L550-2 51#L550-3 assume !!(main_#t~mem5 < main_#t~mem6);havoc main_#t~mem6;havoc main_#t~mem5; 54#L551 SUMMARY for call write~int(0, main_~j~0.base, main_~j~0.offset, 4); srcloc: L551 52#L552-4 assume true; 53#L552 SUMMARY for call main_#t~mem7 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L552 64#L552-1 SUMMARY for call main_#t~mem8 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-1 66#L552-2 assume !(main_#t~mem7 <= main_#t~mem8);havoc main_#t~mem8;havoc main_#t~mem7; 55#L552-5 SUMMARY for call main_#t~mem10 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-5 56#L555 SUMMARY for call write~int(main_#t~mem10 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L555 59#L555-1 havoc main_#t~mem10; 57#L550-5 [2018-10-27 06:12:44,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:44,579 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-10-27 06:12:44,579 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:44,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:44,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:44,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:44,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:44,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:44,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:44,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:44,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1635435721, now seen corresponding path program 1 times [2018-10-27 06:12:44,595 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:44,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:44,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:44,597 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:12:44,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:44,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:44,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:44,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:44,632 INFO L82 PathProgramCache]: Analyzing trace with hash -421286919, now seen corresponding path program 1 times [2018-10-27 06:12:44,632 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:44,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:44,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:44,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:44,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:44,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:44,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:44,900 WARN L179 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2018-10-27 06:12:45,038 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-10-27 06:12:45,193 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2018-10-27 06:12:45,304 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:12:45,305 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:12:45,305 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:12:45,305 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:12:45,305 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:12:45,306 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:12:45,306 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:12:45,306 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:12:45,306 INFO L131 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-2013CAV-Fig1-alloca_true-termination.c.i_Iteration2_Lasso [2018-10-27 06:12:45,306 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:12:45,307 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:12:45,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:45,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:45,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:45,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:45,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:45,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:45,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:45,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:45,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:45,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-10-27 06:12:46,090 WARN L179 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 88 [2018-10-27 06:12:46,234 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 75 [2018-10-27 06:12:46,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:46,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:46,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:46,599 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-10-27 06:12:46,870 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:12:46,875 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:12:46,876 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:12:46,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:46,879 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:46,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:46,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:46,880 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:46,881 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:46,881 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:46,884 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:46,884 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:12:46,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:46,885 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:46,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:46,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:46,885 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:46,886 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:46,886 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:46,887 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:46,887 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:12:46,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:46,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:46,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:46,888 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:46,890 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:46,890 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:46,894 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:46,894 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:12:46,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:46,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:46,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:46,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:46,896 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:46,897 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:46,901 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:46,902 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:12:46,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:46,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:46,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:46,902 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:46,904 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:46,904 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:46,907 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:46,907 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:12:46,908 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:46,908 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:46,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:46,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:46,908 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:46,909 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:46,909 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:46,911 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:46,911 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:12:46,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:46,912 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:46,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:46,912 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:46,912 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:46,912 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:46,913 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:46,913 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:46,914 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:12:46,914 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:46,914 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:46,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:46,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:46,915 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:46,915 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:46,915 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:46,916 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:46,916 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:12:46,917 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:46,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:46,917 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:46,917 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:46,918 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:46,918 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:46,921 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:46,922 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:12:46,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:46,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:46,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:46,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:46,924 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:46,925 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:46,937 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:46,937 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:12:46,938 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:46,938 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:46,938 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:46,938 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:46,938 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:46,939 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:46,939 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:46,944 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:12:46,950 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-10-27 06:12:46,955 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-10-27 06:12:46,957 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:12:46,957 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-10-27 06:12:46,957 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:12:46,958 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_1 Supporting invariants [] [2018-10-27 06:12:47,111 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2018-10-27 06:12:47,115 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:12:47,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:47,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:47,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:47,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:47,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:47,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 33 [2018-10-27 06:12:47,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2018-10-27 06:12:47,264 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-27 06:12:47,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-10-27 06:12:47,379 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 06:12:47,395 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:12:47,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:12:47,403 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:21, output treesize:32 [2018-10-27 06:12:47,661 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:12:47,670 INFO L477 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 3 case distinctions, treesize of input 50 treesize of output 62 [2018-10-27 06:12:47,676 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:12:47,677 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:12:47,683 INFO L477 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 48 treesize of output 55 [2018-10-27 06:12:47,685 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:12:47,726 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:12:47,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 44 [2018-10-27 06:12:47,728 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 06:12:47,746 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:12:47,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-10-27 06:12:47,764 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:50, output treesize:61 [2018-10-27 06:12:47,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:47,794 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2018-10-27 06:12:47,795 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 18 transitions. cyclomatic complexity: 2 Second operand 9 states. [2018-10-27 06:12:48,131 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 18 transitions. cyclomatic complexity: 2. Second operand 9 states. Result 46 states and 49 transitions. Complement of second has 15 states. [2018-10-27 06:12:48,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-10-27 06:12:48,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-27 06:12:48,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 17 transitions. [2018-10-27 06:12:48,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 2 letters. Loop has 12 letters. [2018-10-27 06:12:48,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:12:48,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 14 letters. Loop has 12 letters. [2018-10-27 06:12:48,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:12:48,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 2 letters. Loop has 24 letters. [2018-10-27 06:12:48,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:12:48,136 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 49 transitions. [2018-10-27 06:12:48,138 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:12:48,139 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 42 states and 45 transitions. [2018-10-27 06:12:48,139 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-10-27 06:12:48,139 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-10-27 06:12:48,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 45 transitions. [2018-10-27 06:12:48,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:12:48,139 INFO L705 BuchiCegarLoop]: Abstraction has 42 states and 45 transitions. [2018-10-27 06:12:48,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 45 transitions. [2018-10-27 06:12:48,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2018-10-27 06:12:48,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-27 06:12:48,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-10-27 06:12:48,142 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-10-27 06:12:48,142 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-10-27 06:12:48,142 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:12:48,142 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 42 transitions. [2018-10-27 06:12:48,143 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:12:48,143 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:12:48,143 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:12:48,144 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:48,144 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:48,144 INFO L793 eck$LassoCheckResult]: Stem: 321#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 317#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~mem9, main_#t~mem7, main_#t~mem8, main_#t~mem10, main_#t~mem5, main_#t~mem6, main_~i~0.base, main_~i~0.offset, main_~j~0.base, main_~j~0.offset, main_~n~0.base, main_~n~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~j~0.base, main_~j~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~n~0.base, main_~n~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 318#L550-5 assume true; 311#L550-1 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L550-1 300#L550-2 SUMMARY for call main_#t~mem6 := read~int(main_~n~0.base, main_~n~0.offset, 4); srcloc: L550-2 301#L550-3 assume !!(main_#t~mem5 < main_#t~mem6);havoc main_#t~mem6;havoc main_#t~mem5; 308#L551 SUMMARY for call write~int(0, main_~j~0.base, main_~j~0.offset, 4); srcloc: L551 296#L552-4 assume true; 297#L552 SUMMARY for call main_#t~mem7 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L552 323#L552-1 SUMMARY for call main_#t~mem8 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-1 326#L552-2 assume !!(main_#t~mem7 <= main_#t~mem8);havoc main_#t~mem8;havoc main_#t~mem7; 319#L553 [2018-10-27 06:12:48,144 INFO L795 eck$LassoCheckResult]: Loop: 319#L553 SUMMARY for call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L553 320#L553-1 SUMMARY for call write~int(main_#t~mem9 + 1, main_~j~0.base, main_~j~0.offset, 4); srcloc: L553-1 322#L553-2 havoc main_#t~mem9; 325#L552-4 assume true; 330#L552 SUMMARY for call main_#t~mem7 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L552 329#L552-1 SUMMARY for call main_#t~mem8 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-1 328#L552-2 assume !!(main_#t~mem7 <= main_#t~mem8);havoc main_#t~mem8;havoc main_#t~mem7; 319#L553 [2018-10-27 06:12:48,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:48,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1648309300, now seen corresponding path program 1 times [2018-10-27 06:12:48,144 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:48,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:48,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:48,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:48,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:48,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:48,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:48,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:48,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1681647555, now seen corresponding path program 1 times [2018-10-27 06:12:48,172 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:48,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:48,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:48,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:48,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:48,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:48,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:48,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:48,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1130409576, now seen corresponding path program 1 times [2018-10-27 06:12:48,185 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:48,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:48,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:48,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:48,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:48,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:48,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:48,454 WARN L179 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 90 [2018-10-27 06:12:48,517 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:12:48,517 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:12:48,517 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:12:48,517 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:12:48,517 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:12:48,517 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:12:48,518 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:12:48,518 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:12:48,518 INFO L131 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-2013CAV-Fig1-alloca_true-termination.c.i_Iteration3_Lasso [2018-10-27 06:12:48,518 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:12:48,518 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:12:48,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:48,758 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 83 [2018-10-27 06:12:48,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:48,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:48,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:48,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:48,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:48,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:48,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:48,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:48,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:48,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:48,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:48,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:49,228 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:12:49,229 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:12:49,229 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:12:49,229 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:49,230 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:49,230 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:49,230 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:49,231 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:49,231 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:49,234 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:49,234 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:12:49,234 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:49,235 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:49,235 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:49,235 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:49,236 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:49,236 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:49,238 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:49,238 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:49,238 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:49,238 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:12:49,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:49,239 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:49,240 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:12:49,240 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:49,247 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:49,247 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:12:49,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:49,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:49,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:49,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:49,249 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:49,250 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:49,262 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:49,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-10-27 06:12:49,263 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:49,263 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:49,263 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:49,263 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:49,271 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:49,271 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:49,294 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:12:49,299 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-10-27 06:12:49,300 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:12:49,300 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:12:49,301 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:12:49,302 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:12:49,302 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~j~0.base) ULTIMATE.start_main_~j~0.offset)_2, v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~j~0.base) ULTIMATE.start_main_~j~0.offset)_2 + 1*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_2 Supporting invariants [] [2018-10-27 06:12:49,367 INFO L297 tatePredicateManager]: 19 out of 20 supporting invariants were superfluous and have been removed [2018-10-27 06:12:49,368 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:12:49,369 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:12:49,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:49,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:49,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:49,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2018-10-27 06:12:49,402 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 06:12:49,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:12:49,422 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:6 [2018-10-27 06:12:49,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:49,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:49,519 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:12:49,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 39 [2018-10-27 06:12:49,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2018-10-27 06:12:49,545 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:12:49,647 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:12:49,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:12:49,744 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2018-10-27 06:12:49,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:49,801 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-10-27 06:12:49,801 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 42 transitions. cyclomatic complexity: 5 Second operand 7 states. [2018-10-27 06:12:49,911 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 42 transitions. cyclomatic complexity: 5. Second operand 7 states. Result 57 states and 62 transitions. Complement of second has 12 states. [2018-10-27 06:12:49,912 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-10-27 06:12:49,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:12:49,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2018-10-27 06:12:49,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 11 letters. Loop has 7 letters. [2018-10-27 06:12:49,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:12:49,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 18 letters. Loop has 7 letters. [2018-10-27 06:12:49,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:12:49,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 11 letters. Loop has 14 letters. [2018-10-27 06:12:49,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:12:49,915 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 62 transitions. [2018-10-27 06:12:49,916 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:12:49,917 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 55 states and 60 transitions. [2018-10-27 06:12:49,917 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2018-10-27 06:12:49,917 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-10-27 06:12:49,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 60 transitions. [2018-10-27 06:12:49,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:12:49,918 INFO L705 BuchiCegarLoop]: Abstraction has 55 states and 60 transitions. [2018-10-27 06:12:49,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 60 transitions. [2018-10-27 06:12:49,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2018-10-27 06:12:49,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-27 06:12:49,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2018-10-27 06:12:49,921 INFO L728 BuchiCegarLoop]: Abstraction has 53 states and 58 transitions. [2018-10-27 06:12:49,921 INFO L608 BuchiCegarLoop]: Abstraction has 53 states and 58 transitions. [2018-10-27 06:12:49,921 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-10-27 06:12:49,921 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 58 transitions. [2018-10-27 06:12:49,922 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:12:49,922 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:12:49,922 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:12:49,923 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:49,923 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:49,923 INFO L793 eck$LassoCheckResult]: Stem: 594#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 587#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~mem9, main_#t~mem7, main_#t~mem8, main_#t~mem10, main_#t~mem5, main_#t~mem6, main_~i~0.base, main_~i~0.offset, main_~j~0.base, main_~j~0.offset, main_~n~0.base, main_~n~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~j~0.base, main_~j~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~n~0.base, main_~n~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 588#L550-5 assume true; 605#L550-1 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L550-1 615#L550-2 SUMMARY for call main_#t~mem6 := read~int(main_~n~0.base, main_~n~0.offset, 4); srcloc: L550-2 614#L550-3 assume !!(main_#t~mem5 < main_#t~mem6);havoc main_#t~mem6;havoc main_#t~mem5; 613#L551 SUMMARY for call write~int(0, main_~j~0.base, main_~j~0.offset, 4); srcloc: L551 612#L552-4 assume true; 611#L552 SUMMARY for call main_#t~mem7 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L552 610#L552-1 SUMMARY for call main_#t~mem8 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-1 609#L552-2 assume !!(main_#t~mem7 <= main_#t~mem8);havoc main_#t~mem8;havoc main_#t~mem7; 608#L553 SUMMARY for call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L553 593#L553-1 SUMMARY for call write~int(main_#t~mem9 + 1, main_~j~0.base, main_~j~0.offset, 4); srcloc: L553-1 599#L553-2 havoc main_#t~mem9; 566#L552-4 assume true; 567#L552 SUMMARY for call main_#t~mem7 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L552 597#L552-1 SUMMARY for call main_#t~mem8 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-1 601#L552-2 assume !(main_#t~mem7 <= main_#t~mem8);havoc main_#t~mem8;havoc main_#t~mem7; 574#L552-5 [2018-10-27 06:12:49,923 INFO L795 eck$LassoCheckResult]: Loop: 574#L552-5 SUMMARY for call main_#t~mem10 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-5 575#L555 SUMMARY for call write~int(main_#t~mem10 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L555 584#L555-1 havoc main_#t~mem10; 580#L550-5 assume true; 581#L550-1 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L550-1 570#L550-2 SUMMARY for call main_#t~mem6 := read~int(main_~n~0.base, main_~n~0.offset, 4); srcloc: L550-2 571#L550-3 assume !!(main_#t~mem5 < main_#t~mem6);havoc main_#t~mem6;havoc main_#t~mem5; 578#L551 SUMMARY for call write~int(0, main_~j~0.base, main_~j~0.offset, 4); srcloc: L551 603#L552-4 assume true; 618#L552 SUMMARY for call main_#t~mem7 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L552 617#L552-1 SUMMARY for call main_#t~mem8 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-1 616#L552-2 assume !(main_#t~mem7 <= main_#t~mem8);havoc main_#t~mem8;havoc main_#t~mem7; 574#L552-5 [2018-10-27 06:12:49,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:49,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1130409578, now seen corresponding path program 1 times [2018-10-27 06:12:49,924 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:49,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:49,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:49,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:49,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:49,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:49,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:49,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:49,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1462737419, now seen corresponding path program 2 times [2018-10-27 06:12:49,948 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:49,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:49,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:49,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:49,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:49,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:49,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:49,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:49,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1688220704, now seen corresponding path program 1 times [2018-10-27 06:12:49,965 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:49,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:49,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:49,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:12:49,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:49,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:50,280 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:50,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:12:50,280 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_942fb0c5-24e1-40d7-b7a4-e3e8821e4994/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:12:50,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:50,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:50,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:50,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2018-10-27 06:12:50,343 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 06:12:50,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:12:50,347 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2018-10-27 06:12:50,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 8 [2018-10-27 06:12:50,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 06:12:50,363 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:12:50,365 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:12:50,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:12:50,370 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-10-27 06:12:50,449 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 29 [2018-10-27 06:12:50,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2018-10-27 06:12:50,454 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:12:50,458 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:12:50,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:12:50,462 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:12 [2018-10-27 06:12:50,503 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:12:50,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 29 [2018-10-27 06:12:50,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-10-27 06:12:50,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:12:50,514 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:12:50,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:12:50,517 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:12 [2018-10-27 06:12:50,522 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-10-27 06:12:50,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 06:12:50,531 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:12:50,535 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:12:50,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:12:50,538 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-10-27 06:12:50,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 29 treesize of output 25 [2018-10-27 06:12:50,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 3 [2018-10-27 06:12:50,566 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:12:50,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-10-27 06:12:50,572 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 06:12:50,576 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:12:50,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:12:50,581 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:33, output treesize:7 [2018-10-27 06:12:50,599 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:50,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:12:50,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 19 [2018-10-27 06:12:50,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-27 06:12:50,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2018-10-27 06:12:50,695 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. cyclomatic complexity: 8 Second operand 20 states. [2018-10-27 06:12:51,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:12:51,165 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2018-10-27 06:12:51,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-27 06:12:51,165 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 76 transitions. [2018-10-27 06:12:51,166 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2018-10-27 06:12:51,167 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 71 states and 76 transitions. [2018-10-27 06:12:51,167 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2018-10-27 06:12:51,167 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2018-10-27 06:12:51,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 76 transitions. [2018-10-27 06:12:51,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:12:51,168 INFO L705 BuchiCegarLoop]: Abstraction has 71 states and 76 transitions. [2018-10-27 06:12:51,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 76 transitions. [2018-10-27 06:12:51,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 57. [2018-10-27 06:12:51,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-27 06:12:51,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2018-10-27 06:12:51,173 INFO L728 BuchiCegarLoop]: Abstraction has 57 states and 62 transitions. [2018-10-27 06:12:51,173 INFO L608 BuchiCegarLoop]: Abstraction has 57 states and 62 transitions. [2018-10-27 06:12:51,173 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-10-27 06:12:51,173 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 62 transitions. [2018-10-27 06:12:51,174 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2018-10-27 06:12:51,174 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:12:51,174 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:12:51,175 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:51,175 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:51,175 INFO L793 eck$LassoCheckResult]: Stem: 848#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 841#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~mem9, main_#t~mem7, main_#t~mem8, main_#t~mem10, main_#t~mem5, main_#t~mem6, main_~i~0.base, main_~i~0.offset, main_~j~0.base, main_~j~0.offset, main_~n~0.base, main_~n~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~j~0.base, main_~j~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~n~0.base, main_~n~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 842#L550-5 assume true; 835#L550-1 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L550-1 820#L550-2 SUMMARY for call main_#t~mem6 := read~int(main_~n~0.base, main_~n~0.offset, 4); srcloc: L550-2 821#L550-3 assume !!(main_#t~mem5 < main_#t~mem6);havoc main_#t~mem6;havoc main_#t~mem5; 828#L551 SUMMARY for call write~int(0, main_~j~0.base, main_~j~0.offset, 4); srcloc: L551 866#L552-4 assume true; 865#L552 SUMMARY for call main_#t~mem7 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L552 864#L552-1 SUMMARY for call main_#t~mem8 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-1 863#L552-2 assume !!(main_#t~mem7 <= main_#t~mem8);havoc main_#t~mem8;havoc main_#t~mem7; 862#L553 SUMMARY for call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L553 847#L553-1 SUMMARY for call write~int(main_#t~mem9 + 1, main_~j~0.base, main_~j~0.offset, 4); srcloc: L553-1 874#L553-2 havoc main_#t~mem9; 873#L552-4 assume true; 872#L552 SUMMARY for call main_#t~mem7 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L552 871#L552-1 SUMMARY for call main_#t~mem8 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-1 858#L552-2 assume !(main_#t~mem7 <= main_#t~mem8);havoc main_#t~mem8;havoc main_#t~mem7; 830#L552-5 [2018-10-27 06:12:51,175 INFO L795 eck$LassoCheckResult]: Loop: 830#L552-5 SUMMARY for call main_#t~mem10 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-5 831#L555 SUMMARY for call write~int(main_#t~mem10 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L555 838#L555-1 havoc main_#t~mem10; 840#L550-5 assume true; 870#L550-1 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L550-1 869#L550-2 SUMMARY for call main_#t~mem6 := read~int(main_~n~0.base, main_~n~0.offset, 4); srcloc: L550-2 868#L550-3 assume !!(main_#t~mem5 < main_#t~mem6);havoc main_#t~mem6;havoc main_#t~mem5; 855#L551 SUMMARY for call write~int(0, main_~j~0.base, main_~j~0.offset, 4); srcloc: L551 856#L552-4 assume true; 876#L552 SUMMARY for call main_#t~mem7 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L552 875#L552-1 SUMMARY for call main_#t~mem8 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-1 867#L552-2 assume !!(main_#t~mem7 <= main_#t~mem8);havoc main_#t~mem8;havoc main_#t~mem7; 843#L553 SUMMARY for call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L553 844#L553-1 SUMMARY for call write~int(main_#t~mem9 + 1, main_~j~0.base, main_~j~0.offset, 4); srcloc: L553-1 851#L553-2 havoc main_#t~mem9; 824#L552-4 assume true; 825#L552 SUMMARY for call main_#t~mem7 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L552 849#L552-1 SUMMARY for call main_#t~mem8 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-1 853#L552-2 assume !(main_#t~mem7 <= main_#t~mem8);havoc main_#t~mem8;havoc main_#t~mem7; 830#L552-5 [2018-10-27 06:12:51,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:51,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1130409578, now seen corresponding path program 2 times [2018-10-27 06:12:51,176 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:51,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:51,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:51,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:51,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:51,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:51,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:51,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:51,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1111939019, now seen corresponding path program 1 times [2018-10-27 06:12:51,206 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:51,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:51,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:51,207 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:12:51,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:51,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:51,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:51,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:51,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1396704128, now seen corresponding path program 2 times [2018-10-27 06:12:51,223 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:51,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:51,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:51,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:51,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:51,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:51,474 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:51,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:12:51,475 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_942fb0c5-24e1-40d7-b7a4-e3e8821e4994/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:12:51,481 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 06:12:51,526 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-27 06:12:51,526 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:12:51,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:51,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2018-10-27 06:12:51,534 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 06:12:51,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:12:51,539 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2018-10-27 06:12:51,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 8 [2018-10-27 06:12:51,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 06:12:51,549 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:12:51,550 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:12:51,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:12:51,553 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-10-27 06:12:51,604 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 29 [2018-10-27 06:12:51,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2018-10-27 06:12:51,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:12:51,616 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:12:51,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:12:51,620 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:12 [2018-10-27 06:12:51,647 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:12:51,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 29 [2018-10-27 06:12:51,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-10-27 06:12:51,650 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:12:51,653 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:12:51,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:12:51,657 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:12 [2018-10-27 06:12:51,662 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-10-27 06:12:51,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 06:12:51,665 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:12:51,710 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:12:51,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:12:51,714 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-10-27 06:12:51,737 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-10-27 06:12:51,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-10-27 06:12:51,740 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:12:51,745 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:12:51,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:12:51,750 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:19 [2018-10-27 06:12:51,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 29 treesize of output 25 [2018-10-27 06:12:51,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-10-27 06:12:51,788 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:12:51,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-10-27 06:12:51,794 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 06:12:51,796 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:12:51,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:12:51,800 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:33, output treesize:7 [2018-10-27 06:12:51,814 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 16 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:51,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:12:51,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 24 [2018-10-27 06:12:51,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-27 06:12:51,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2018-10-27 06:12:51,930 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. cyclomatic complexity: 8 Second operand 25 states. [2018-10-27 06:12:52,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:12:52,560 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2018-10-27 06:12:52,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-27 06:12:52,561 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 83 transitions. [2018-10-27 06:12:52,562 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2018-10-27 06:12:52,564 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 78 states and 83 transitions. [2018-10-27 06:12:52,564 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2018-10-27 06:12:52,565 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2018-10-27 06:12:52,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 83 transitions. [2018-10-27 06:12:52,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:12:52,565 INFO L705 BuchiCegarLoop]: Abstraction has 78 states and 83 transitions. [2018-10-27 06:12:52,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 83 transitions. [2018-10-27 06:12:52,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 64. [2018-10-27 06:12:52,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-10-27 06:12:52,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2018-10-27 06:12:52,570 INFO L728 BuchiCegarLoop]: Abstraction has 64 states and 69 transitions. [2018-10-27 06:12:52,570 INFO L608 BuchiCegarLoop]: Abstraction has 64 states and 69 transitions. [2018-10-27 06:12:52,570 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-10-27 06:12:52,570 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 69 transitions. [2018-10-27 06:12:52,571 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2018-10-27 06:12:52,571 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:12:52,571 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:12:52,572 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:52,572 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:52,572 INFO L793 eck$LassoCheckResult]: Stem: 1147#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1140#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~mem9, main_#t~mem7, main_#t~mem8, main_#t~mem10, main_#t~mem5, main_#t~mem6, main_~i~0.base, main_~i~0.offset, main_~j~0.base, main_~j~0.offset, main_~n~0.base, main_~n~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~j~0.base, main_~j~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~n~0.base, main_~n~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 1141#L550-5 assume true; 1175#L550-1 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L550-1 1172#L550-2 SUMMARY for call main_#t~mem6 := read~int(main_~n~0.base, main_~n~0.offset, 4); srcloc: L550-2 1169#L550-3 assume !!(main_#t~mem5 < main_#t~mem6);havoc main_#t~mem6;havoc main_#t~mem5; 1167#L551 SUMMARY for call write~int(0, main_~j~0.base, main_~j~0.offset, 4); srcloc: L551 1166#L552-4 assume true; 1165#L552 SUMMARY for call main_#t~mem7 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L552 1164#L552-1 SUMMARY for call main_#t~mem8 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-1 1163#L552-2 assume !!(main_#t~mem7 <= main_#t~mem8);havoc main_#t~mem8;havoc main_#t~mem7; 1162#L553 SUMMARY for call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L553 1146#L553-1 SUMMARY for call write~int(main_#t~mem9 + 1, main_~j~0.base, main_~j~0.offset, 4); srcloc: L553-1 1177#L553-2 havoc main_#t~mem9; 1176#L552-4 assume true; 1173#L552 SUMMARY for call main_#t~mem7 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L552 1174#L552-1 SUMMARY for call main_#t~mem8 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-1 1168#L552-2 assume !(main_#t~mem7 <= main_#t~mem8);havoc main_#t~mem8;havoc main_#t~mem7; 1127#L552-5 [2018-10-27 06:12:52,572 INFO L795 eck$LassoCheckResult]: Loop: 1127#L552-5 SUMMARY for call main_#t~mem10 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-5 1128#L555 SUMMARY for call write~int(main_#t~mem10 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L555 1137#L555-1 havoc main_#t~mem10; 1133#L550-5 assume true; 1134#L550-1 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L550-1 1123#L550-2 SUMMARY for call main_#t~mem6 := read~int(main_~n~0.base, main_~n~0.offset, 4); srcloc: L550-2 1124#L550-3 assume !!(main_#t~mem5 < main_#t~mem6);havoc main_#t~mem6;havoc main_#t~mem5; 1131#L551 SUMMARY for call write~int(0, main_~j~0.base, main_~j~0.offset, 4); srcloc: L551 1154#L552-4 assume true; 1148#L552 SUMMARY for call main_#t~mem7 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L552 1149#L552-1 SUMMARY for call main_#t~mem8 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-1 1155#L552-2 assume !!(main_#t~mem7 <= main_#t~mem8);havoc main_#t~mem8;havoc main_#t~mem7; 1179#L553 SUMMARY for call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L553 1151#L553-1 SUMMARY for call write~int(main_#t~mem9 + 1, main_~j~0.base, main_~j~0.offset, 4); srcloc: L553-1 1152#L553-2 havoc main_#t~mem9; 1119#L552-4 assume true; 1120#L552 SUMMARY for call main_#t~mem7 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L552 1180#L552-1 SUMMARY for call main_#t~mem8 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-1 1158#L552-2 assume !!(main_#t~mem7 <= main_#t~mem8);havoc main_#t~mem8;havoc main_#t~mem7; 1142#L553 SUMMARY for call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L553 1143#L553-1 SUMMARY for call write~int(main_#t~mem9 + 1, main_~j~0.base, main_~j~0.offset, 4); srcloc: L553-1 1178#L553-2 havoc main_#t~mem9; 1182#L552-4 assume true; 1181#L552 SUMMARY for call main_#t~mem7 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L552 1170#L552-1 SUMMARY for call main_#t~mem8 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-1 1171#L552-2 assume !(main_#t~mem7 <= main_#t~mem8);havoc main_#t~mem8;havoc main_#t~mem7; 1127#L552-5 [2018-10-27 06:12:52,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:52,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1130409578, now seen corresponding path program 3 times [2018-10-27 06:12:52,572 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:52,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:52,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:52,573 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:12:52,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:52,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:52,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:52,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:52,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1931135285, now seen corresponding path program 2 times [2018-10-27 06:12:52,596 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:52,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:52,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:52,597 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:12:52,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:52,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:52,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:52,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:52,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1287649248, now seen corresponding path program 3 times [2018-10-27 06:12:52,642 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:52,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:52,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:52,643 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:12:52,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:52,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:52,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:53,026 WARN L179 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 95 [2018-10-27 06:12:53,255 WARN L179 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 110 [2018-10-27 06:12:53,317 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:12:53,317 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:12:53,317 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:12:53,317 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:12:53,317 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:12:53,317 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:12:53,317 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:12:53,317 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:12:53,318 INFO L131 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-2013CAV-Fig1-alloca_true-termination.c.i_Iteration6_Lasso [2018-10-27 06:12:53,318 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:12:53,318 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:12:53,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:53,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:53,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:53,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:53,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:53,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:53,554 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 92 [2018-10-27 06:12:53,663 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 77 [2018-10-27 06:12:53,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-10-27 06:12:53,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-10-27 06:12:53,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-10-27 06:12:53,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-10-27 06:12:53,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-10-27 06:12:53,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-10-27 06:12:53,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-10-27 06:12:53,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:54,124 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:12:54,124 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:12:54,124 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:12:54,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:54,125 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:54,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:54,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:54,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:54,125 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:54,125 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:54,126 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:54,127 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:12:54,127 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:54,127 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:12:54,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:54,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:54,127 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:54,128 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:12:54,128 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:12:54,128 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:54,128 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:12:54,129 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:54,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:54,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:54,129 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:54,130 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:54,130 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:54,133 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:54,133 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:12:54,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:54,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:54,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:54,134 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:54,134 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:54,135 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:54,136 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:54,136 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:12:54,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:54,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:54,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:54,137 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:54,138 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:54,138 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:54,151 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:12:54,151 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:12:54,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:12:54,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:12:54,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:12:54,152 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:12:54,153 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:12:54,153 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:12:54,172 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:12:54,194 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-10-27 06:12:54,194 INFO L444 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-10-27 06:12:54,194 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:12:54,195 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:12:54,195 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:12:54,195 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_3) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_3 + 1 Supporting invariants [] [2018-10-27 06:12:54,826 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2018-10-27 06:12:54,836 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:12:55,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:55,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:55,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:55,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:55,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:55,092 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:12:55,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 32 treesize of output 33 [2018-10-27 06:12:55,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2018-10-27 06:12:55,100 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:12:55,105 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:12:55,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:12:55,109 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:17 [2018-10-27 06:12:55,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 33 [2018-10-27 06:12:55,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-10-27 06:12:55,140 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:12:55,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2018-10-27 06:12:55,159 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-10-27 06:12:55,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:12:55,200 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-10-27 06:12:55,201 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:28, output treesize:46 [2018-10-27 06:12:55,432 WARN L179 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-10-27 06:12:55,672 WARN L179 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-10-27 06:12:55,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-10-27 06:12:55,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-10-27 06:12:55,722 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:12:55,728 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:12:55,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 52 [2018-10-27 06:12:55,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 33 [2018-10-27 06:12:55,809 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 06:12:55,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 47 [2018-10-27 06:12:55,921 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2018-10-27 06:12:55,956 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 06:12:55,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-10-27 06:12:55,987 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:86, output treesize:107 [2018-10-27 06:12:57,046 WARN L179 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 53 DAG size of output: 31 [2018-10-27 06:12:57,369 WARN L179 SmtUtils]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-10-27 06:12:57,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 52 [2018-10-27 06:12:57,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2018-10-27 06:12:57,388 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:12:57,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 50 [2018-10-27 06:12:57,429 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-10-27 06:12:57,497 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 06:12:57,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-10-27 06:12:57,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-10-27 06:12:57,536 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 06:12:57,542 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:12:57,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-10-27 06:12:57,572 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:86, output treesize:105 [2018-10-27 06:12:58,290 WARN L179 SmtUtils]: Spent 699.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 31 [2018-10-27 06:12:58,646 WARN L179 SmtUtils]: Spent 334.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-10-27 06:12:59,057 WARN L179 SmtUtils]: Spent 396.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-10-27 06:12:59,057 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:59,057 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 10 loop predicates [2018-10-27 06:12:59,058 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 69 transitions. cyclomatic complexity: 8 Second operand 11 states. [2018-10-27 06:13:00,315 WARN L179 SmtUtils]: Spent 999.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2018-10-27 06:13:01,393 WARN L179 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2018-10-27 06:13:02,314 WARN L179 SmtUtils]: Spent 817.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2018-10-27 06:13:03,224 WARN L179 SmtUtils]: Spent 882.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2018-10-27 06:13:04,100 WARN L179 SmtUtils]: Spent 820.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 41 [2018-10-27 06:13:04,945 WARN L179 SmtUtils]: Spent 819.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2018-10-27 06:13:04,954 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 64 states and 69 transitions. cyclomatic complexity: 8. Second operand 11 states. Result 227 states and 238 transitions. Complement of second has 29 states. [2018-10-27 06:13:04,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 1 stem states 13 non-accepting loop states 1 accepting loop states [2018-10-27 06:13:04,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-10-27 06:13:04,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 45 transitions. [2018-10-27 06:13:04,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 45 transitions. Stem has 18 letters. Loop has 26 letters. [2018-10-27 06:13:04,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:13:04,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 45 transitions. Stem has 44 letters. Loop has 26 letters. [2018-10-27 06:13:04,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:13:04,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 45 transitions. Stem has 18 letters. Loop has 52 letters. [2018-10-27 06:13:04,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:13:04,957 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 227 states and 238 transitions. [2018-10-27 06:13:04,960 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2018-10-27 06:13:04,961 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 227 states to 195 states and 206 transitions. [2018-10-27 06:13:04,961 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 89 [2018-10-27 06:13:04,961 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2018-10-27 06:13:04,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 195 states and 206 transitions. [2018-10-27 06:13:04,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:13:04,962 INFO L705 BuchiCegarLoop]: Abstraction has 195 states and 206 transitions. [2018-10-27 06:13:04,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states and 206 transitions. [2018-10-27 06:13:04,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 146. [2018-10-27 06:13:04,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-10-27 06:13:04,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 156 transitions. [2018-10-27 06:13:04,974 INFO L728 BuchiCegarLoop]: Abstraction has 146 states and 156 transitions. [2018-10-27 06:13:04,974 INFO L608 BuchiCegarLoop]: Abstraction has 146 states and 156 transitions. [2018-10-27 06:13:04,974 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-10-27 06:13:04,974 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 146 states and 156 transitions. [2018-10-27 06:13:04,975 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2018-10-27 06:13:04,975 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:13:04,975 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:13:04,976 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-27 06:13:04,976 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:13:04,976 INFO L793 eck$LassoCheckResult]: Stem: 1741#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1735#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~mem9, main_#t~mem7, main_#t~mem8, main_#t~mem10, main_#t~mem5, main_#t~mem6, main_~i~0.base, main_~i~0.offset, main_~j~0.base, main_~j~0.offset, main_~n~0.base, main_~n~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~j~0.base, main_~j~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~n~0.base, main_~n~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 1736#L550-5 assume true; 1782#L550-1 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L550-1 1781#L550-2 SUMMARY for call main_#t~mem6 := read~int(main_~n~0.base, main_~n~0.offset, 4); srcloc: L550-2 1780#L550-3 assume !!(main_#t~mem5 < main_#t~mem6);havoc main_#t~mem6;havoc main_#t~mem5; 1778#L551 SUMMARY for call write~int(0, main_~j~0.base, main_~j~0.offset, 4); srcloc: L551 1776#L552-4 assume true; 1774#L552 SUMMARY for call main_#t~mem7 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L552 1772#L552-1 SUMMARY for call main_#t~mem8 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-1 1770#L552-2 assume !!(main_#t~mem7 <= main_#t~mem8);havoc main_#t~mem8;havoc main_#t~mem7; 1767#L553 SUMMARY for call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L553 1766#L553-1 SUMMARY for call write~int(main_#t~mem9 + 1, main_~j~0.base, main_~j~0.offset, 4); srcloc: L553-1 1765#L553-2 havoc main_#t~mem9; 1764#L552-4 assume true; 1763#L552 SUMMARY for call main_#t~mem7 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L552 1762#L552-1 SUMMARY for call main_#t~mem8 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-1 1759#L552-2 assume !(main_#t~mem7 <= main_#t~mem8);havoc main_#t~mem8;havoc main_#t~mem7; 1760#L552-5 SUMMARY for call main_#t~mem10 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-5 1724#L555 SUMMARY for call write~int(main_#t~mem10 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L555 1732#L555-1 havoc main_#t~mem10; 1733#L550-5 assume true; 1788#L550-1 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L550-1 1816#L550-2 SUMMARY for call main_#t~mem6 := read~int(main_~n~0.base, main_~n~0.offset, 4); srcloc: L550-2 1815#L550-3 assume !!(main_#t~mem5 < main_#t~mem6);havoc main_#t~mem6;havoc main_#t~mem5; 1814#L551 SUMMARY for call write~int(0, main_~j~0.base, main_~j~0.offset, 4); srcloc: L551 1813#L552-4 assume true; 1811#L552 SUMMARY for call main_#t~mem7 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L552 1809#L552-1 SUMMARY for call main_#t~mem8 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-1 1807#L552-2 assume !!(main_#t~mem7 <= main_#t~mem8);havoc main_#t~mem8;havoc main_#t~mem7; 1805#L553 SUMMARY for call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L553 1803#L553-1 SUMMARY for call write~int(main_#t~mem9 + 1, main_~j~0.base, main_~j~0.offset, 4); srcloc: L553-1 1802#L553-2 havoc main_#t~mem9; 1800#L552-4 [2018-10-27 06:13:04,976 INFO L795 eck$LassoCheckResult]: Loop: 1800#L552-4 assume true; 1798#L552 SUMMARY for call main_#t~mem7 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L552 1796#L552-1 SUMMARY for call main_#t~mem8 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-1 1794#L552-2 assume !!(main_#t~mem7 <= main_#t~mem8);havoc main_#t~mem8;havoc main_#t~mem7; 1792#L553 SUMMARY for call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L553 1742#L553-1 SUMMARY for call write~int(main_#t~mem9 + 1, main_~j~0.base, main_~j~0.offset, 4); srcloc: L553-1 1743#L553-2 havoc main_#t~mem9; 1713#L552-4 assume true; 1714#L552 SUMMARY for call main_#t~mem7 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L552 1745#L552-1 SUMMARY for call main_#t~mem8 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-1 1751#L552-2 assume !!(main_#t~mem7 <= main_#t~mem8);havoc main_#t~mem8;havoc main_#t~mem7; 1737#L553 SUMMARY for call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L553 1738#L553-1 SUMMARY for call write~int(main_#t~mem9 + 1, main_~j~0.base, main_~j~0.offset, 4); srcloc: L553-1 1787#L553-2 havoc main_#t~mem9; 1786#L552-4 assume true; 1785#L552 SUMMARY for call main_#t~mem7 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L552 1783#L552-1 SUMMARY for call main_#t~mem8 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-1 1784#L552-2 assume !(main_#t~mem7 <= main_#t~mem8);havoc main_#t~mem8;havoc main_#t~mem7; 1720#L552-5 SUMMARY for call main_#t~mem10 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-5 1721#L555 SUMMARY for call write~int(main_#t~mem10 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L555 1729#L555-1 havoc main_#t~mem10; 1817#L550-5 assume true; 1754#L550-1 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L550-1 1709#L550-2 SUMMARY for call main_#t~mem6 := read~int(main_~n~0.base, main_~n~0.offset, 4); srcloc: L550-2 1710#L550-3 assume !!(main_#t~mem5 < main_#t~mem6);havoc main_#t~mem6;havoc main_#t~mem5; 1717#L551 SUMMARY for call write~int(0, main_~j~0.base, main_~j~0.offset, 4); srcloc: L551 1800#L552-4 [2018-10-27 06:13:04,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:04,977 INFO L82 PathProgramCache]: Analyzing trace with hash -283955877, now seen corresponding path program 4 times [2018-10-27 06:13:04,977 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:04,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:04,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:04,978 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:13:04,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:04,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:05,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:05,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:05,017 INFO L82 PathProgramCache]: Analyzing trace with hash -102944501, now seen corresponding path program 3 times [2018-10-27 06:13:05,017 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:05,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:05,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:05,018 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:13:05,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:05,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:05,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:05,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:05,044 INFO L82 PathProgramCache]: Analyzing trace with hash -845020699, now seen corresponding path program 5 times [2018-10-27 06:13:05,046 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:05,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:05,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:05,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:13:05,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:05,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:13:05,528 WARN L179 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 13 [2018-10-27 06:13:05,818 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 56 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:13:05,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:13:05,819 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_942fb0c5-24e1-40d7-b7a4-e3e8821e4994/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:13:05,838 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-27 06:13:05,881 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-10-27 06:13:05,881 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:13:05,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:13:05,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-27 06:13:05,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 06:13:05,899 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:05,901 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:05,902 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:05,902 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-10-27 06:13:05,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2018-10-27 06:13:05,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-10-27 06:13:05,935 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:05,939 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:05,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:05,942 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:7 [2018-10-27 06:13:06,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 47 [2018-10-27 06:13:06,117 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:06,118 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:06,120 INFO L477 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 33 treesize of output 44 [2018-10-27 06:13:06,121 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:06,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2018-10-27 06:13:06,146 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:06,161 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:13:06,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:13:06,174 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:41, output treesize:50 [2018-10-27 06:13:06,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2018-10-27 06:13:06,208 INFO L477 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 21 treesize of output 22 [2018-10-27 06:13:06,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:06,212 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:06,230 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-10-27 06:13:06,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-27 06:13:06,233 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:06,237 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:06,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:13:06,247 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:72, output treesize:42 [2018-10-27 06:13:06,302 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:06,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 42 treesize of output 41 [2018-10-27 06:13:06,307 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2018-10-27 06:13:06,307 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:06,314 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:06,330 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:06,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 40 [2018-10-27 06:13:06,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2018-10-27 06:13:06,335 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:06,340 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:06,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:13:06,352 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:82, output treesize:42 [2018-10-27 06:13:06,404 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:06,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 42 treesize of output 41 [2018-10-27 06:13:06,410 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:06,410 INFO L477 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 34 treesize of output 43 [2018-10-27 06:13:06,411 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:06,418 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:06,434 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:06,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 40 [2018-10-27 06:13:06,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-10-27 06:13:06,438 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:06,443 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:06,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:13:06,454 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:82, output treesize:38 [2018-10-27 06:13:06,534 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 58 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:13:06,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:13:06,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 17] total 37 [2018-10-27 06:13:06,722 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 93 [2018-10-27 06:13:06,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-27 06:13:06,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1192, Unknown=0, NotChecked=0, Total=1332 [2018-10-27 06:13:06,814 INFO L87 Difference]: Start difference. First operand 146 states and 156 transitions. cyclomatic complexity: 15 Second operand 37 states. [2018-10-27 06:13:08,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:13:08,489 INFO L93 Difference]: Finished difference Result 249 states and 259 transitions. [2018-10-27 06:13:08,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-27 06:13:08,497 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 249 states and 259 transitions. [2018-10-27 06:13:08,499 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2018-10-27 06:13:08,502 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 249 states to 193 states and 202 transitions. [2018-10-27 06:13:08,502 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 82 [2018-10-27 06:13:08,503 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 82 [2018-10-27 06:13:08,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 193 states and 202 transitions. [2018-10-27 06:13:08,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:13:08,503 INFO L705 BuchiCegarLoop]: Abstraction has 193 states and 202 transitions. [2018-10-27 06:13:08,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states and 202 transitions. [2018-10-27 06:13:08,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 128. [2018-10-27 06:13:08,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-10-27 06:13:08,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 135 transitions. [2018-10-27 06:13:08,511 INFO L728 BuchiCegarLoop]: Abstraction has 128 states and 135 transitions. [2018-10-27 06:13:08,511 INFO L608 BuchiCegarLoop]: Abstraction has 128 states and 135 transitions. [2018-10-27 06:13:08,511 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-10-27 06:13:08,511 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 128 states and 135 transitions. [2018-10-27 06:13:08,512 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2018-10-27 06:13:08,512 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:13:08,512 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:13:08,513 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-27 06:13:08,513 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:13:08,513 INFO L793 eck$LassoCheckResult]: Stem: 2421#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2414#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~mem9, main_#t~mem7, main_#t~mem8, main_#t~mem10, main_#t~mem5, main_#t~mem6, main_~i~0.base, main_~i~0.offset, main_~j~0.base, main_~j~0.offset, main_~n~0.base, main_~n~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~j~0.base, main_~j~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~n~0.base, main_~n~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 2415#L550-5 assume true; 2451#L550-1 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L550-1 2450#L550-2 SUMMARY for call main_#t~mem6 := read~int(main_~n~0.base, main_~n~0.offset, 4); srcloc: L550-2 2449#L550-3 assume !!(main_#t~mem5 < main_#t~mem6);havoc main_#t~mem6;havoc main_#t~mem5; 2448#L551 SUMMARY for call write~int(0, main_~j~0.base, main_~j~0.offset, 4); srcloc: L551 2447#L552-4 assume true; 2446#L552 SUMMARY for call main_#t~mem7 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L552 2445#L552-1 SUMMARY for call main_#t~mem8 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-1 2444#L552-2 assume !!(main_#t~mem7 <= main_#t~mem8);havoc main_#t~mem8;havoc main_#t~mem7; 2443#L553 SUMMARY for call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L553 2420#L553-1 SUMMARY for call write~int(main_#t~mem9 + 1, main_~j~0.base, main_~j~0.offset, 4); srcloc: L553-1 2426#L553-2 havoc main_#t~mem9; 2397#L552-4 assume true; 2398#L552 SUMMARY for call main_#t~mem7 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L552 2423#L552-1 SUMMARY for call main_#t~mem8 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-1 2431#L552-2 assume !!(main_#t~mem7 <= main_#t~mem8);havoc main_#t~mem8;havoc main_#t~mem7; 2418#L553 SUMMARY for call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L553 2419#L553-1 SUMMARY for call write~int(main_#t~mem9 + 1, main_~j~0.base, main_~j~0.offset, 4); srcloc: L553-1 2493#L553-2 havoc main_#t~mem9; 2494#L552-4 assume true; 2485#L552 SUMMARY for call main_#t~mem7 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L552 2486#L552-1 SUMMARY for call main_#t~mem8 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-1 2478#L552-2 assume !(main_#t~mem7 <= main_#t~mem8);havoc main_#t~mem8;havoc main_#t~mem7; 2434#L552-5 SUMMARY for call main_#t~mem10 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-5 2435#L555 SUMMARY for call write~int(main_#t~mem10 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L555 2412#L555-1 havoc main_#t~mem10; 2413#L550-5 assume true; 2432#L550-1 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L550-1 2433#L550-2 SUMMARY for call main_#t~mem6 := read~int(main_~n~0.base, main_~n~0.offset, 4); srcloc: L550-2 2399#L550-3 assume !!(main_#t~mem5 < main_#t~mem6);havoc main_#t~mem6;havoc main_#t~mem5; 2400#L551 SUMMARY for call write~int(0, main_~j~0.base, main_~j~0.offset, 4); srcloc: L551 2518#L552-4 assume true; 2517#L552 SUMMARY for call main_#t~mem7 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L552 2516#L552-1 SUMMARY for call main_#t~mem8 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-1 2515#L552-2 assume !!(main_#t~mem7 <= main_#t~mem8);havoc main_#t~mem8;havoc main_#t~mem7; 2514#L553 SUMMARY for call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L553 2513#L553-1 SUMMARY for call write~int(main_#t~mem9 + 1, main_~j~0.base, main_~j~0.offset, 4); srcloc: L553-1 2512#L553-2 havoc main_#t~mem9; 2428#L552-4 [2018-10-27 06:13:08,514 INFO L795 eck$LassoCheckResult]: Loop: 2428#L552-4 assume true; 2511#L552 SUMMARY for call main_#t~mem7 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L552 2509#L552-1 SUMMARY for call main_#t~mem8 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-1 2508#L552-2 assume !!(main_#t~mem7 <= main_#t~mem8);havoc main_#t~mem8;havoc main_#t~mem7; 2507#L553 SUMMARY for call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L553 2424#L553-1 SUMMARY for call write~int(main_#t~mem9 + 1, main_~j~0.base, main_~j~0.offset, 4); srcloc: L553-1 2425#L553-2 havoc main_#t~mem9; 2395#L552-4 assume true; 2396#L552 SUMMARY for call main_#t~mem7 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L552 2422#L552-1 SUMMARY for call main_#t~mem8 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-1 2430#L552-2 assume !!(main_#t~mem7 <= main_#t~mem8);havoc main_#t~mem8;havoc main_#t~mem7; 2416#L553 SUMMARY for call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L553 2417#L553-1 SUMMARY for call write~int(main_#t~mem9 + 1, main_~j~0.base, main_~j~0.offset, 4); srcloc: L553-1 2496#L553-2 havoc main_#t~mem9; 2489#L552-4 assume true; 2490#L552 SUMMARY for call main_#t~mem7 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L552 2481#L552-1 SUMMARY for call main_#t~mem8 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-1 2482#L552-2 assume !(main_#t~mem7 <= main_#t~mem8);havoc main_#t~mem8;havoc main_#t~mem7; 2510#L552-5 SUMMARY for call main_#t~mem10 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-5 2409#L555 SUMMARY for call write~int(main_#t~mem10 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L555 2410#L555-1 havoc main_#t~mem10; 2455#L550-5 assume true; 2456#L550-1 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L550-1 2391#L550-2 SUMMARY for call main_#t~mem6 := read~int(main_~n~0.base, main_~n~0.offset, 4); srcloc: L550-2 2392#L550-3 assume !!(main_#t~mem5 < main_#t~mem6);havoc main_#t~mem6;havoc main_#t~mem5; 2427#L551 SUMMARY for call write~int(0, main_~j~0.base, main_~j~0.offset, 4); srcloc: L551 2428#L552-4 [2018-10-27 06:13:08,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:08,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1469452839, now seen corresponding path program 6 times [2018-10-27 06:13:08,514 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:08,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:08,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:08,526 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:13:08,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:08,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:08,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:08,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:08,550 INFO L82 PathProgramCache]: Analyzing trace with hash -102944501, now seen corresponding path program 4 times [2018-10-27 06:13:08,550 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:08,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:08,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:08,553 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:13:08,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:08,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:08,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:08,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:08,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1758904399, now seen corresponding path program 7 times [2018-10-27 06:13:08,569 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:08,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:08,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:08,570 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:13:08,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:08,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:08,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:08,854 WARN L179 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 93 [2018-10-27 06:13:09,650 WARN L179 SmtUtils]: Spent 756.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 163 [2018-10-27 06:13:09,775 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2018-10-27 06:13:09,778 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:13:09,778 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:13:09,778 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:13:09,778 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:13:09,778 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:13:09,778 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:13:09,778 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:13:09,778 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:13:09,778 INFO L131 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-2013CAV-Fig1-alloca_true-termination.c.i_Iteration8_Lasso [2018-10-27 06:13:09,778 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:13:09,778 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:13:09,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:09,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:09,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:09,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:09,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:09,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:09,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:09,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:09,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:09,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:10,040 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 95 [2018-10-27 06:13:10,164 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 80 [2018-10-27 06:13:10,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:10,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:10,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:10,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:10,360 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2018-10-27 06:13:10,706 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:13:10,706 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:13:10,706 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:13:10,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:10,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:10,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:10,707 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:10,708 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:13:10,708 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:10,709 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:10,709 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:13:10,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:10,710 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:10,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:10,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:10,710 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:10,718 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:13:10,719 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:10,719 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:10,719 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:13:10,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:10,720 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:10,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:10,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:10,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:10,720 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:13:10,720 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:10,721 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:10,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:13:10,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:10,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:10,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:10,721 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:10,722 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:13:10,722 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:10,723 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:10,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:13:10,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:10,724 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:10,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:10,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:10,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:10,724 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:13:10,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:10,725 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:10,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:13:10,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:10,725 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:10,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:10,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:10,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:10,726 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:13:10,726 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:10,726 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:10,727 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:13:10,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:10,727 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:10,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:10,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:10,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:10,728 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:13:10,728 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:10,728 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:10,728 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:13:10,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:10,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:10,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:10,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:10,729 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:13:10,729 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:10,751 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:10,751 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:13:10,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:10,752 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:10,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:10,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:10,752 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:10,753 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:13:10,753 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:10,753 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:10,754 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:13:10,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:10,754 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:13:10,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:10,754 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:10,758 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:13:10,758 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:10,762 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:10,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:13:10,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:10,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:10,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:10,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:10,768 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:13:10,768 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:10,769 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:10,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:13:10,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:10,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:10,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:10,770 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:10,777 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:13:10,777 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:10,779 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:10,779 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:13:10,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:10,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:10,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:10,780 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:10,781 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:13:10,781 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:10,782 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:10,789 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:13:10,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:10,789 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:10,789 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:10,789 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:10,790 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:13:10,790 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:10,791 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:10,791 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:13:10,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:10,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:10,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:10,792 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:10,793 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:13:10,793 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:10,807 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:10,808 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:13:10,808 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:10,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:10,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:10,809 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:10,811 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:13:10,811 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:10,828 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:10,828 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:13:10,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:10,829 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:13:10,829 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:10,829 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:10,829 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:13:10,829 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:10,837 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:10,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:13:10,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:10,838 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:13:10,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:10,838 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:10,843 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:13:10,843 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:10,846 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:10,846 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:13:10,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:10,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:10,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:10,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:10,852 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:13:10,852 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:10,858 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:10,858 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:13:10,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:10,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:10,859 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:10,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:10,859 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:13:10,859 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:10,862 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:10,862 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:13:10,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:10,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:10,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:10,869 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:10,870 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:13:10,870 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:10,881 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:13:10,888 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-10-27 06:13:10,888 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-10-27 06:13:10,889 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:13:10,889 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-10-27 06:13:10,889 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:13:10,890 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~j~0.base) ULTIMATE.start_main_~j~0.offset)_4, v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_4) = 2*v_rep(select (select #memory_int ULTIMATE.start_main_~j~0.base) ULTIMATE.start_main_~j~0.offset)_4 - 2*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_4 + 3 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_4 - 1 >= 0] [2018-10-27 06:13:11,013 INFO L297 tatePredicateManager]: 24 out of 25 supporting invariants were superfluous and have been removed [2018-10-27 06:13:11,015 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:13:11,015 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:13:11,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:11,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:13:11,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:13:11,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2018-10-27 06:13:11,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:11,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:11,082 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:6 [2018-10-27 06:13:11,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 8 [2018-10-27 06:13:11,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 06:13:11,115 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:11,117 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:11,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:11,121 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-27 06:13:11,143 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:11,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 29 [2018-10-27 06:13:11,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2018-10-27 06:13:11,146 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:11,150 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:11,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:11,155 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:13 [2018-10-27 06:13:11,305 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 29 [2018-10-27 06:13:11,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-10-27 06:13:11,309 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:11,313 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:11,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:11,317 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:13 [2018-10-27 06:13:11,345 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:11,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 29 [2018-10-27 06:13:11,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-10-27 06:13:11,348 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:11,357 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:11,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:11,362 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:13 [2018-10-27 06:13:11,388 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-10-27 06:13:11,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 06:13:11,390 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:11,393 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:11,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:11,398 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-10-27 06:13:11,430 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-10-27 06:13:11,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-10-27 06:13:11,433 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:11,437 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:11,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:11,442 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:9 [2018-10-27 06:13:11,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:13:11,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:13:11,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 53 [2018-10-27 06:13:11,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 39 [2018-10-27 06:13:11,758 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:13:11,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 49 [2018-10-27 06:13:11,794 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-10-27 06:13:11,836 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-10-27 06:13:11,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 5 xjuncts. [2018-10-27 06:13:11,876 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:47, output treesize:159 [2018-10-27 06:13:12,028 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 49 [2018-10-27 06:13:12,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-27 06:13:12,032 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:12,038 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:12,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2018-10-27 06:13:12,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-10-27 06:13:12,071 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:12,075 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:12,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 48 [2018-10-27 06:13:12,105 INFO L477 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 41 treesize of output 44 [2018-10-27 06:13:12,105 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:12,112 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:12,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-10-27 06:13:12,133 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:146, output treesize:86 [2018-10-27 06:13:12,845 WARN L179 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 27 [2018-10-27 06:13:13,331 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-10-27 06:13:13,463 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:13,464 INFO L303 Elim1Store]: Index analysis took 130 ms [2018-10-27 06:13:13,671 INFO L477 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 3 case distinctions, treesize of input 65 treesize of output 75 [2018-10-27 06:13:13,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 55 [2018-10-27 06:13:13,684 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:13:13,878 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:13,879 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:13,881 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:13,882 INFO L477 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 53 treesize of output 66 [2018-10-27 06:13:13,883 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:13:13,920 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-10-27 06:13:13,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-10-27 06:13:13,954 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:65, output treesize:160 [2018-10-27 06:13:14,039 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:13:14,043 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.13 stem predicates 10 loop predicates [2018-10-27 06:13:14,043 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 128 states and 135 transitions. cyclomatic complexity: 11 Second operand 24 states. [2018-10-27 06:13:14,480 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 128 states and 135 transitions. cyclomatic complexity: 11. Second operand 24 states. Result 135 states and 142 transitions. Complement of second has 7 states. [2018-10-27 06:13:14,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 5 stem states 0 non-accepting loop states 1 accepting loop states [2018-10-27 06:13:14,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-27 06:13:14,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2018-10-27 06:13:14,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 40 letters. Loop has 26 letters. [2018-10-27 06:13:14,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:13:14,483 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:13:14,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:14,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:13:14,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:13:14,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2018-10-27 06:13:14,524 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:14,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:14,526 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:6 [2018-10-27 06:13:14,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 8 [2018-10-27 06:13:14,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 06:13:14,538 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:14,539 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:14,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:14,543 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-27 06:13:14,566 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:14,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 29 [2018-10-27 06:13:14,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2018-10-27 06:13:14,568 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:14,573 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:14,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:14,578 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:13 [2018-10-27 06:13:14,633 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 29 [2018-10-27 06:13:14,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-10-27 06:13:14,636 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:14,641 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:14,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:14,646 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:13 [2018-10-27 06:13:14,674 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:14,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 29 [2018-10-27 06:13:14,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-10-27 06:13:14,677 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:14,680 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:14,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:14,685 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:13 [2018-10-27 06:13:14,703 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-10-27 06:13:14,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 06:13:14,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:14,761 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:14,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:14,766 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-10-27 06:13:14,848 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-10-27 06:13:14,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-10-27 06:13:14,851 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:14,857 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:14,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:14,862 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:9 [2018-10-27 06:13:14,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:13:14,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:13:14,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 53 [2018-10-27 06:13:14,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 39 [2018-10-27 06:13:14,932 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:13:14,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 49 [2018-10-27 06:13:14,968 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-10-27 06:13:15,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-10-27 06:13:15,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 5 xjuncts. [2018-10-27 06:13:15,049 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:47, output treesize:159 [2018-10-27 06:13:15,215 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 49 [2018-10-27 06:13:15,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-27 06:13:15,217 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:15,224 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:15,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2018-10-27 06:13:15,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-10-27 06:13:15,275 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:15,279 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:15,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 48 [2018-10-27 06:13:15,309 INFO L477 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 41 treesize of output 44 [2018-10-27 06:13:15,309 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:15,316 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:15,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-10-27 06:13:15,337 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:146, output treesize:86 [2018-10-27 06:13:15,583 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:15,592 INFO L477 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 3 case distinctions, treesize of input 65 treesize of output 75 [2018-10-27 06:13:15,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 55 [2018-10-27 06:13:15,598 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:13:15,635 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:15,636 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:15,638 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:15,638 INFO L477 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 53 treesize of output 66 [2018-10-27 06:13:15,639 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:13:15,675 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-10-27 06:13:15,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-10-27 06:13:15,707 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:65, output treesize:160 [2018-10-27 06:13:15,786 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:13:15,786 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.13 stem predicates 10 loop predicates [2018-10-27 06:13:15,786 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 128 states and 135 transitions. cyclomatic complexity: 11 Second operand 24 states. [2018-10-27 06:13:15,871 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 128 states and 135 transitions. cyclomatic complexity: 11. Second operand 24 states. Result 135 states and 142 transitions. Complement of second has 7 states. [2018-10-27 06:13:15,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 5 stem states 0 non-accepting loop states 1 accepting loop states [2018-10-27 06:13:15,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-27 06:13:15,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2018-10-27 06:13:15,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 40 letters. Loop has 26 letters. [2018-10-27 06:13:15,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:13:15,873 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:13:15,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:15,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:13:15,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:13:15,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2018-10-27 06:13:15,925 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:15,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:15,928 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:6 [2018-10-27 06:13:15,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 8 [2018-10-27 06:13:15,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 06:13:15,989 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:16,014 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:16,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:16,018 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-27 06:13:16,059 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:16,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 29 [2018-10-27 06:13:16,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2018-10-27 06:13:16,062 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:16,066 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:16,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:16,070 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:13 [2018-10-27 06:13:16,124 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 29 [2018-10-27 06:13:16,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-10-27 06:13:16,128 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:16,132 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:16,137 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:16,137 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:13 [2018-10-27 06:13:16,166 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:16,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 29 [2018-10-27 06:13:16,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-10-27 06:13:16,171 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:16,175 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:16,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:16,180 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:13 [2018-10-27 06:13:16,197 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-10-27 06:13:16,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 06:13:16,199 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:16,203 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:16,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:16,207 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-10-27 06:13:16,228 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-10-27 06:13:16,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-10-27 06:13:16,230 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:16,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:16,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:16,239 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:9 [2018-10-27 06:13:16,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:13:16,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:13:16,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 53 [2018-10-27 06:13:16,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 39 [2018-10-27 06:13:16,295 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:13:16,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 49 [2018-10-27 06:13:16,332 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-10-27 06:13:16,371 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-10-27 06:13:16,410 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 5 xjuncts. [2018-10-27 06:13:16,410 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:47, output treesize:159 [2018-10-27 06:13:16,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 48 [2018-10-27 06:13:16,529 INFO L477 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 41 treesize of output 44 [2018-10-27 06:13:16,529 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:16,536 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:16,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2018-10-27 06:13:16,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-10-27 06:13:16,570 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:16,575 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:16,618 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 49 [2018-10-27 06:13:16,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-27 06:13:16,622 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:16,628 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:16,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-10-27 06:13:16,650 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:146, output treesize:86 [2018-10-27 06:13:16,906 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:16,937 INFO L477 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 3 case distinctions, treesize of input 65 treesize of output 75 [2018-10-27 06:13:16,940 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:16,941 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:16,943 INFO L477 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 61 treesize of output 66 [2018-10-27 06:13:16,943 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:13:16,984 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:16,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 55 [2018-10-27 06:13:16,985 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:13:17,020 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-10-27 06:13:17,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-10-27 06:13:17,053 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:65, output treesize:160 [2018-10-27 06:13:17,250 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:13:17,250 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.13 stem predicates 10 loop predicates [2018-10-27 06:13:17,251 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 128 states and 135 transitions. cyclomatic complexity: 11 Second operand 24 states. [2018-10-27 06:13:19,185 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 128 states and 135 transitions. cyclomatic complexity: 11. Second operand 24 states. Result 660 states and 694 transitions. Complement of second has 184 states. [2018-10-27 06:13:19,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 39 states 18 stem states 19 non-accepting loop states 2 accepting loop states [2018-10-27 06:13:19,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-27 06:13:19,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 126 transitions. [2018-10-27 06:13:19,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 126 transitions. Stem has 40 letters. Loop has 26 letters. [2018-10-27 06:13:19,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:13:19,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 126 transitions. Stem has 66 letters. Loop has 26 letters. [2018-10-27 06:13:19,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:13:19,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 126 transitions. Stem has 40 letters. Loop has 52 letters. [2018-10-27 06:13:19,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:13:19,190 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 660 states and 694 transitions. [2018-10-27 06:13:19,197 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2018-10-27 06:13:19,200 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 660 states to 407 states and 429 transitions. [2018-10-27 06:13:19,202 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 80 [2018-10-27 06:13:19,202 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 135 [2018-10-27 06:13:19,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 407 states and 429 transitions. [2018-10-27 06:13:19,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:13:19,203 INFO L705 BuchiCegarLoop]: Abstraction has 407 states and 429 transitions. [2018-10-27 06:13:19,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states and 429 transitions. [2018-10-27 06:13:19,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 151. [2018-10-27 06:13:19,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-10-27 06:13:19,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 161 transitions. [2018-10-27 06:13:19,214 INFO L728 BuchiCegarLoop]: Abstraction has 151 states and 161 transitions. [2018-10-27 06:13:19,214 INFO L608 BuchiCegarLoop]: Abstraction has 151 states and 161 transitions. [2018-10-27 06:13:19,214 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-10-27 06:13:19,214 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 151 states and 161 transitions. [2018-10-27 06:13:19,215 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2018-10-27 06:13:19,215 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:13:19,215 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:13:19,215 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-27 06:13:19,216 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:13:19,216 INFO L793 eck$LassoCheckResult]: Stem: 4515#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4509#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~mem9, main_#t~mem7, main_#t~mem8, main_#t~mem10, main_#t~mem5, main_#t~mem6, main_~i~0.base, main_~i~0.offset, main_~j~0.base, main_~j~0.offset, main_~n~0.base, main_~n~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~j~0.base, main_~j~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~n~0.base, main_~n~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 4510#L550-5 assume true; 4540#L550-1 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L550-1 4539#L550-2 SUMMARY for call main_#t~mem6 := read~int(main_~n~0.base, main_~n~0.offset, 4); srcloc: L550-2 4538#L550-3 assume !!(main_#t~mem5 < main_#t~mem6);havoc main_#t~mem6;havoc main_#t~mem5; 4537#L551 SUMMARY for call write~int(0, main_~j~0.base, main_~j~0.offset, 4); srcloc: L551 4536#L552-4 assume true; 4535#L552 SUMMARY for call main_#t~mem7 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L552 4534#L552-1 SUMMARY for call main_#t~mem8 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-1 4533#L552-2 assume !!(main_#t~mem7 <= main_#t~mem8);havoc main_#t~mem8;havoc main_#t~mem7; 4531#L553 SUMMARY for call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L553 4532#L553-1 SUMMARY for call write~int(main_#t~mem9 + 1, main_~j~0.base, main_~j~0.offset, 4); srcloc: L553-1 4595#L553-2 havoc main_#t~mem9; 4594#L552-4 assume true; 4593#L552 SUMMARY for call main_#t~mem7 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L552 4592#L552-1 SUMMARY for call main_#t~mem8 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-1 4591#L552-2 assume !!(main_#t~mem7 <= main_#t~mem8);havoc main_#t~mem8;havoc main_#t~mem7; 4589#L553 SUMMARY for call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L553 4588#L553-1 SUMMARY for call write~int(main_#t~mem9 + 1, main_~j~0.base, main_~j~0.offset, 4); srcloc: L553-1 4587#L553-2 havoc main_#t~mem9; 4586#L552-4 assume true; 4583#L552 SUMMARY for call main_#t~mem7 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L552 4581#L552-1 SUMMARY for call main_#t~mem8 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-1 4554#L552-2 assume !(main_#t~mem7 <= main_#t~mem8);havoc main_#t~mem8;havoc main_#t~mem7; 4553#L552-5 SUMMARY for call main_#t~mem10 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-5 4505#L555 SUMMARY for call write~int(main_#t~mem10 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L555 4506#L555-1 havoc main_#t~mem10; 4508#L550-5 assume true; 4524#L550-1 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L550-1 4488#L550-2 SUMMARY for call main_#t~mem6 := read~int(main_~n~0.base, main_~n~0.offset, 4); srcloc: L550-2 4489#L550-3 assume !!(main_#t~mem5 < main_#t~mem6);havoc main_#t~mem6;havoc main_#t~mem5; 4499#L551 SUMMARY for call write~int(0, main_~j~0.base, main_~j~0.offset, 4); srcloc: L551 4492#L552-4 assume true; 4493#L552 [2018-10-27 06:13:19,216 INFO L795 eck$LassoCheckResult]: Loop: 4493#L552 SUMMARY for call main_#t~mem7 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L552 4518#L552-1 SUMMARY for call main_#t~mem8 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-1 4522#L552-2 assume !!(main_#t~mem7 <= main_#t~mem8);havoc main_#t~mem8;havoc main_#t~mem7; 4511#L553 SUMMARY for call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L553 4512#L553-1 SUMMARY for call write~int(main_#t~mem9 + 1, main_~j~0.base, main_~j~0.offset, 4); srcloc: L553-1 4516#L553-2 havoc main_#t~mem9; 4520#L552-4 assume true; 4493#L552 [2018-10-27 06:13:19,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:19,216 INFO L82 PathProgramCache]: Analyzing trace with hash -258484156, now seen corresponding path program 8 times [2018-10-27 06:13:19,216 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:19,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:19,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:19,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:13:19,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:19,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:19,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:19,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:19,245 INFO L82 PathProgramCache]: Analyzing trace with hash -438809489, now seen corresponding path program 2 times [2018-10-27 06:13:19,245 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:19,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:19,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:19,246 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:13:19,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:19,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:19,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:19,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:19,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1691602228, now seen corresponding path program 9 times [2018-10-27 06:13:19,252 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:19,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:19,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:19,253 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:13:19,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:19,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:19,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:20,145 WARN L179 SmtUtils]: Spent 742.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 148 [2018-10-27 06:13:20,267 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2018-10-27 06:13:20,269 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:13:20,269 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:13:20,269 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:13:20,269 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:13:20,270 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:13:20,270 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:13:20,270 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:13:20,270 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:13:20,270 INFO L131 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-2013CAV-Fig1-alloca_true-termination.c.i_Iteration9_Lasso [2018-10-27 06:13:20,270 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:13:20,270 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:13:20,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:20,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:20,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:20,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:20,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-10-27 06:13:20,556 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 87 [2018-10-27 06:13:20,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:20,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:20,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:20,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:20,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:20,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:20,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:20,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:20,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:20,992 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:13:20,993 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:13:20,993 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:13:20,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:20,993 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:20,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:20,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:20,993 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:20,994 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:13:20,994 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:20,994 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:20,994 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:13:20,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:20,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:20,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:20,994 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:20,995 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:13:20,995 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:20,996 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:20,996 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:13:20,996 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:20,996 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:20,996 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:20,997 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:20,997 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:13:20,997 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:20,998 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:20,998 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:13:20,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:20,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:20,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:20,999 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:20,999 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:13:20,999 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:21,000 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:21,001 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:13:21,001 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:21,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:21,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:21,001 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:21,002 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:13:21,002 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:21,003 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:21,003 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:13:21,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:21,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:21,004 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:21,004 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:21,004 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:13:21,004 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:21,007 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:21,007 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:13:21,007 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:21,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:21,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:21,007 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:21,008 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:13:21,008 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:21,009 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:21,009 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:13:21,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:21,009 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:13:21,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:21,009 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:21,010 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:13:21,010 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:21,012 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13: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-10-27 06:13:21,013 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:21,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:21,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:21,013 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:21,014 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:13:21,014 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:21,017 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:21,017 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:13:21,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:21,018 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:21,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:21,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:21,018 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:21,018 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:13:21,026 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:21,027 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:21,027 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:13:21,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:21,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:21,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:21,028 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:21,028 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:13:21,028 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:21,029 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:21,030 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:13:21,030 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:21,030 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:13:21,030 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:21,030 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:21,031 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:13:21,031 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:21,034 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13: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-10-27 06:13:21,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:21,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:21,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:21,043 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:21,044 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:13:21,044 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:21,047 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:13:21,048 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:13:21,048 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-10-27 06:13:21,049 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:13:21,049 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:13:21,049 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:13:21,049 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_5, v_rep(select (select #memory_int ULTIMATE.start_main_~j~0.base) ULTIMATE.start_main_~j~0.offset)_5) = 2*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_5 - 2*v_rep(select (select #memory_int ULTIMATE.start_main_~j~0.base) ULTIMATE.start_main_~j~0.offset)_5 + 1 Supporting invariants [] [2018-10-27 06:13:21,217 INFO L297 tatePredicateManager]: 22 out of 23 supporting invariants were superfluous and have been removed [2018-10-27 06:13:21,218 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:13:21,218 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:13:21,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:21,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:13:21,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:13:21,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2018-10-27 06:13:21,273 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:21,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:21,276 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:6 [2018-10-27 06:13:21,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:13:21,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:13:21,329 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:21,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 54 [2018-10-27 06:13:21,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 41 [2018-10-27 06:13:21,332 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:13:21,339 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:13:21,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:13:21,346 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:36 [2018-10-27 06:13:21,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:13:21,361 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2018-10-27 06:13:21,362 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 151 states and 161 transitions. cyclomatic complexity: 14 Second operand 8 states. [2018-10-27 06:13:21,572 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 151 states and 161 transitions. cyclomatic complexity: 14. Second operand 8 states. Result 220 states and 236 transitions. Complement of second has 14 states. [2018-10-27 06:13:21,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-10-27 06:13:21,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-27 06:13:21,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 18 transitions. [2018-10-27 06:13:21,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 18 transitions. Stem has 34 letters. Loop has 7 letters. [2018-10-27 06:13:21,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:13:21,575 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:13:21,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:21,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:13:21,605 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:13:21,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2018-10-27 06:13:21,610 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:21,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:21,613 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:6 [2018-10-27 06:13:21,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:13:21,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:13:21,719 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:21,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 54 [2018-10-27 06:13:21,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 41 [2018-10-27 06:13:21,723 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:13:21,730 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:13:21,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:13:21,737 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:36 [2018-10-27 06:13:21,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:13:21,753 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 6 loop predicates [2018-10-27 06:13:21,754 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 151 states and 161 transitions. cyclomatic complexity: 14 Second operand 8 states. [2018-10-27 06:13:21,866 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 151 states and 161 transitions. cyclomatic complexity: 14. Second operand 8 states. Result 220 states and 234 transitions. Complement of second has 16 states. [2018-10-27 06:13:21,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2018-10-27 06:13:21,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-27 06:13:21,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 17 transitions. [2018-10-27 06:13:21,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 17 transitions. Stem has 34 letters. Loop has 7 letters. [2018-10-27 06:13:21,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:13:21,868 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:13:21,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:21,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:13:21,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:13:21,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2018-10-27 06:13:21,933 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:21,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:21,939 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:6 [2018-10-27 06:13:21,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:13:21,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:13:22,144 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:22,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 54 [2018-10-27 06:13:22,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 41 [2018-10-27 06:13:22,148 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:13:22,156 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:13:22,163 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:13:22,163 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:36 [2018-10-27 06:13:22,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:13:22,179 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 6 loop predicates [2018-10-27 06:13:22,179 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 151 states and 161 transitions. cyclomatic complexity: 14 Second operand 8 states. [2018-10-27 06:13:22,241 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 151 states and 161 transitions. cyclomatic complexity: 14. Second operand 8 states. Result 275 states and 294 transitions. Complement of second has 15 states. [2018-10-27 06:13:22,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-10-27 06:13:22,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-27 06:13:22,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2018-10-27 06:13:22,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 29 transitions. Stem has 34 letters. Loop has 7 letters. [2018-10-27 06:13:22,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:13:22,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 29 transitions. Stem has 41 letters. Loop has 7 letters. [2018-10-27 06:13:22,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:13:22,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 29 transitions. Stem has 34 letters. Loop has 14 letters. [2018-10-27 06:13:22,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:13:22,245 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 275 states and 294 transitions. [2018-10-27 06:13:22,246 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 48 [2018-10-27 06:13:22,255 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 275 states to 168 states and 178 transitions. [2018-10-27 06:13:22,255 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-10-27 06:13:22,255 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-10-27 06:13:22,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 168 states and 178 transitions. [2018-10-27 06:13:22,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:13:22,255 INFO L705 BuchiCegarLoop]: Abstraction has 168 states and 178 transitions. [2018-10-27 06:13:22,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states and 178 transitions. [2018-10-27 06:13:22,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 137. [2018-10-27 06:13:22,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-10-27 06:13:22,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 147 transitions. [2018-10-27 06:13:22,259 INFO L728 BuchiCegarLoop]: Abstraction has 137 states and 147 transitions. [2018-10-27 06:13:22,259 INFO L608 BuchiCegarLoop]: Abstraction has 137 states and 147 transitions. [2018-10-27 06:13:22,259 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-10-27 06:13:22,259 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 137 states and 147 transitions. [2018-10-27 06:13:22,260 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2018-10-27 06:13:22,260 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:13:22,260 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:13:22,260 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-27 06:13:22,261 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:13:22,261 INFO L793 eck$LassoCheckResult]: Stem: 5940#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5936#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~mem9, main_#t~mem7, main_#t~mem8, main_#t~mem10, main_#t~mem5, main_#t~mem6, main_~i~0.base, main_~i~0.offset, main_~j~0.base, main_~j~0.offset, main_~n~0.base, main_~n~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~j~0.base, main_~j~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~n~0.base, main_~n~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 5937#L550-5 assume true; 5952#L550-1 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L550-1 5953#L550-2 SUMMARY for call main_#t~mem6 := read~int(main_~n~0.base, main_~n~0.offset, 4); srcloc: L550-2 5964#L550-3 assume !!(main_#t~mem5 < main_#t~mem6);havoc main_#t~mem6;havoc main_#t~mem5; 5962#L551 SUMMARY for call write~int(0, main_~j~0.base, main_~j~0.offset, 4); srcloc: L551 5961#L552-4 assume true; 5960#L552 SUMMARY for call main_#t~mem7 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L552 5959#L552-1 SUMMARY for call main_#t~mem8 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-1 5957#L552-2 assume !!(main_#t~mem7 <= main_#t~mem8);havoc main_#t~mem8;havoc main_#t~mem7; 5955#L553 SUMMARY for call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L553 5956#L553-1 SUMMARY for call write~int(main_#t~mem9 + 1, main_~j~0.base, main_~j~0.offset, 4); srcloc: L553-1 6046#L553-2 havoc main_#t~mem9; 6045#L552-4 assume true; 6043#L552 SUMMARY for call main_#t~mem7 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L552 6041#L552-1 SUMMARY for call main_#t~mem8 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-1 6039#L552-2 assume !!(main_#t~mem7 <= main_#t~mem8);havoc main_#t~mem8;havoc main_#t~mem7; 6036#L553 SUMMARY for call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L553 6028#L553-1 SUMMARY for call write~int(main_#t~mem9 + 1, main_~j~0.base, main_~j~0.offset, 4); srcloc: L553-1 6027#L553-2 havoc main_#t~mem9; 5969#L552-4 assume true; 5966#L552 SUMMARY for call main_#t~mem7 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L552 5965#L552-1 SUMMARY for call main_#t~mem8 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-1 5963#L552-2 assume !(main_#t~mem7 <= main_#t~mem8);havoc main_#t~mem8;havoc main_#t~mem7; 5954#L552-5 SUMMARY for call main_#t~mem10 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-5 5932#L555 SUMMARY for call write~int(main_#t~mem10 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L555 5933#L555-1 havoc main_#t~mem10; 5935#L550-5 assume true; 5967#L550-1 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L550-1 5915#L550-2 SUMMARY for call main_#t~mem6 := read~int(main_~n~0.base, main_~n~0.offset, 4); srcloc: L550-2 5916#L550-3 assume !!(main_#t~mem5 < main_#t~mem6);havoc main_#t~mem6;havoc main_#t~mem5; 5923#L551 SUMMARY for call write~int(0, main_~j~0.base, main_~j~0.offset, 4); srcloc: L551 5919#L552-4 assume true; 5920#L552 [2018-10-27 06:13:22,261 INFO L795 eck$LassoCheckResult]: Loop: 5920#L552 SUMMARY for call main_#t~mem7 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L552 5941#L552-1 SUMMARY for call main_#t~mem8 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-1 6026#L552-2 assume !!(main_#t~mem7 <= main_#t~mem8);havoc main_#t~mem8;havoc main_#t~mem7; 6025#L553 SUMMARY for call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L553 6024#L553-1 SUMMARY for call write~int(main_#t~mem9 + 1, main_~j~0.base, main_~j~0.offset, 4); srcloc: L553-1 6023#L553-2 havoc main_#t~mem9; 6021#L552-4 assume true; 5973#L552 SUMMARY for call main_#t~mem7 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L552 6020#L552-1 SUMMARY for call main_#t~mem8 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-1 6019#L552-2 assume !!(main_#t~mem7 <= main_#t~mem8);havoc main_#t~mem8;havoc main_#t~mem7; 6018#L553 SUMMARY for call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L553 6017#L553-1 SUMMARY for call write~int(main_#t~mem9 + 1, main_~j~0.base, main_~j~0.offset, 4); srcloc: L553-1 6016#L553-2 havoc main_#t~mem9; 6015#L552-4 assume true; 6014#L552 SUMMARY for call main_#t~mem7 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L552 6013#L552-1 SUMMARY for call main_#t~mem8 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-1 6012#L552-2 assume !!(main_#t~mem7 <= main_#t~mem8);havoc main_#t~mem8;havoc main_#t~mem7; 6011#L553 SUMMARY for call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L553 6010#L553-1 SUMMARY for call write~int(main_#t~mem9 + 1, main_~j~0.base, main_~j~0.offset, 4); srcloc: L553-1 6009#L553-2 havoc main_#t~mem9; 5998#L552-4 assume true; 5996#L552 SUMMARY for call main_#t~mem7 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L552 5994#L552-1 SUMMARY for call main_#t~mem8 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-1 5992#L552-2 assume !(main_#t~mem7 <= main_#t~mem8);havoc main_#t~mem8;havoc main_#t~mem7; 5989#L552-5 SUMMARY for call main_#t~mem10 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-5 5987#L555 SUMMARY for call write~int(main_#t~mem10 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L555 5985#L555-1 havoc main_#t~mem10; 5983#L550-5 assume true; 5981#L550-1 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L550-1 5979#L550-2 SUMMARY for call main_#t~mem6 := read~int(main_~n~0.base, main_~n~0.offset, 4); srcloc: L550-2 5977#L550-3 assume !!(main_#t~mem5 < main_#t~mem6);havoc main_#t~mem6;havoc main_#t~mem5; 5975#L551 SUMMARY for call write~int(0, main_~j~0.base, main_~j~0.offset, 4); srcloc: L551 5972#L552-4 assume true; 5920#L552 [2018-10-27 06:13:22,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:22,261 INFO L82 PathProgramCache]: Analyzing trace with hash -258484156, now seen corresponding path program 10 times [2018-10-27 06:13:22,261 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:22,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:22,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:22,262 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:13:22,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:22,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:22,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:22,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:22,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1024771483, now seen corresponding path program 5 times [2018-10-27 06:13:22,291 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:22,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:22,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:22,292 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:13:22,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:22,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:22,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:22,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:22,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1308538498, now seen corresponding path program 11 times [2018-10-27 06:13:22,309 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:22,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:22,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:22,310 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:13:22,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:22,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:22,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:23,071 WARN L179 SmtUtils]: Spent 724.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 108 [2018-10-27 06:13:23,645 WARN L179 SmtUtils]: Spent 539.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 148 [2018-10-27 06:13:23,764 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2018-10-27 06:13:23,767 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:13:23,768 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:13:23,768 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:13:23,768 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:13:23,768 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:13:23,768 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:13:23,768 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:13:23,768 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:13:23,768 INFO L131 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-2013CAV-Fig1-alloca_true-termination.c.i_Iteration10_Lasso [2018-10-27 06:13:23,768 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:13:23,768 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:13:23,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-10-27 06:13:23,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-10-27 06:13:23,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:23,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-10-27 06:13:23,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-10-27 06:13:23,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:23,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:23,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:24,230 WARN L179 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 95 [2018-10-27 06:13:24,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:24,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:24,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:24,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:24,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:24,698 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:13:24,699 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:13:24,699 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:13:24,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:24,699 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:24,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:24,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:24,700 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:24,700 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:13:24,700 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:24,700 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:24,700 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:13:24,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:24,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:24,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:24,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:24,701 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:13:24,701 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:24,702 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:24,702 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:13:24,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:24,711 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:24,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:24,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:24,711 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:24,711 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:13:24,711 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:24,712 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:24,712 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:13:24,712 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:24,712 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:24,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:24,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:24,712 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:24,713 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:13:24,713 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:24,713 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:24,713 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:13:24,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:24,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:24,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:24,714 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:24,714 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:13:24,714 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:24,715 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:24,716 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:13:24,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:24,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:24,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:24,716 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:24,716 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:13:24,717 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:24,717 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:24,717 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:13:24,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:24,718 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:24,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:24,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:24,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:24,718 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:13:24,730 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:24,731 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:24,731 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:13:24,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:24,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:24,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:24,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:24,732 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:13:24,732 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:24,734 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:24,734 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:13:24,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:24,734 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:13:24,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:24,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:24,735 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:13:24,735 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:24,738 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:24,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:13:24,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:24,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:24,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:24,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:24,740 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:13:24,740 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:24,755 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:24,755 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:13:24,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:24,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:24,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:24,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:24,757 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:13:24,757 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:24,758 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:24,758 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:13:24,758 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:24,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:24,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:24,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:24,763 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:13:24,763 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:24,786 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:24,786 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:13:24,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:24,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:24,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:24,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:24,787 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:13:24,787 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:24,788 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:24,788 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:13:24,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:24,789 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:24,789 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:24,789 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:24,789 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:13:24,789 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:24,791 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:24,791 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:13:24,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:24,791 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:24,791 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:24,791 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:24,792 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:13:24,792 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:24,807 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:24,808 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:13:24,808 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:24,808 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:13:24,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:24,808 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:24,809 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:13:24,809 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:24,811 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:24,811 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:13:24,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:24,811 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:13:24,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:24,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:24,812 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:13:24,812 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:24,814 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:24,823 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:13:24,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:24,823 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:24,823 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:24,823 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:24,824 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:13:24,824 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:24,867 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:13:24,875 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:13:24,875 INFO L444 ModelExtractionUtils]: 9 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:13:24,875 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:13:24,876 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:13:24,876 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:13:24,876 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset)_6, v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_6) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset)_6 - 1*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_6 Supporting invariants [] [2018-10-27 06:13:25,136 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2018-10-27 06:13:25,138 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:13:25,138 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:13:25,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:25,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:13:25,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:13:25,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:13:25,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:13:25,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 27 treesize of output 54 [2018-10-27 06:13:25,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-10-27 06:13:25,206 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:25,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 37 [2018-10-27 06:13:25,269 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-10-27 06:13:25,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 51 [2018-10-27 06:13:25,326 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 8 xjuncts. [2018-10-27 06:13:25,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 37 [2018-10-27 06:13:25,383 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-10-27 06:13:25,414 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-10-27 06:13:25,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-10-27 06:13:25,440 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:27, output treesize:58 [2018-10-27 06:13:25,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 24 treesize of output 21 [2018-10-27 06:13:25,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-27 06:13:25,466 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:25,471 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:25,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 24 treesize of output 21 [2018-10-27 06:13:25,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-27 06:13:25,520 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:25,527 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:25,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 27 treesize of output 54 [2018-10-27 06:13:25,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-10-27 06:13:25,592 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:25,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 51 [2018-10-27 06:13:25,659 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 8 xjuncts. [2018-10-27 06:13:25,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 37 [2018-10-27 06:13:25,750 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-10-27 06:13:25,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 37 [2018-10-27 06:13:25,801 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-10-27 06:13:25,834 INFO L267 ElimStorePlain]: Start of recursive call 6: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-10-27 06:13:25,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 21 [2018-10-27 06:13:25,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-27 06:13:25,895 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:25,901 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:25,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 21 [2018-10-27 06:13:25,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-27 06:13:25,957 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:25,963 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:26,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 5 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-10-27 06:13:26,010 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 10 variables, input treesize:124, output treesize:58 [2018-10-27 06:13:26,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 45 treesize of output 66 [2018-10-27 06:13:26,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 51 [2018-10-27 06:13:26,224 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-10-27 06:13:26,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 55 [2018-10-27 06:13:26,338 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-10-27 06:13:26,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 38 treesize of output 65 [2018-10-27 06:13:26,447 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 9 xjuncts. [2018-10-27 06:13:26,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2018-10-27 06:13:26,546 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:26,597 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-10-27 06:13:26,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2018-10-27 06:13:26,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-10-27 06:13:26,720 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:26,725 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:26,822 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 35 [2018-10-27 06:13:26,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-10-27 06:13:26,825 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:26,832 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:26,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 50 [2018-10-27 06:13:26,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 34 [2018-10-27 06:13:26,927 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:26,960 INFO L477 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 36 treesize of output 37 [2018-10-27 06:13:26,960 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:26,982 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:13:27,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 31 treesize of output 26 [2018-10-27 06:13:27,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-10-27 06:13:27,057 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:27,062 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:27,123 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 5 dim-2 vars, End of recursive call: and 8 xjuncts. [2018-10-27 06:13:27,123 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 10 variables, input treesize:214, output treesize:188 [2018-10-27 06:13:27,354 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:27,361 INFO L477 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 3 case distinctions, treesize of input 53 treesize of output 65 [2018-10-27 06:13:27,364 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:27,365 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:27,367 INFO L477 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 51 treesize of output 58 [2018-10-27 06:13:27,368 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:27,399 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:27,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 47 [2018-10-27 06:13:27,400 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:27,420 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:13:27,454 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:27,470 INFO L477 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 7 case distinctions, treesize of input 60 treesize of output 85 [2018-10-27 06:13:27,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 54 [2018-10-27 06:13:27,504 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:27,700 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:27,709 INFO L477 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 68 [2018-10-27 06:13:27,711 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 3 xjuncts. [2018-10-27 06:13:27,775 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:27,776 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:27,778 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:27,779 INFO L477 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 52 treesize of output 65 [2018-10-27 06:13:27,780 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:27,819 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:27,822 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:27,826 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:27,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 49 treesize of output 79 [2018-10-27 06:13:27,837 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 3 xjuncts. [2018-10-27 06:13:27,884 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-10-27 06:13:27,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-10-27 06:13:27,939 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:114, output treesize:166 [2018-10-27 06:13:28,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 57 [2018-10-27 06:13:28,204 INFO L477 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 47 [2018-10-27 06:13:28,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:28,231 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:28,232 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:28,234 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:28,236 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:28,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 43 treesize of output 74 [2018-10-27 06:13:28,239 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-10-27 06:13:28,265 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:13:28,304 INFO L477 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 61 [2018-10-27 06:13:28,307 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:28,309 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:28,311 INFO L477 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 47 treesize of output 58 [2018-10-27 06:13:28,311 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-10-27 06:13:28,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 47 [2018-10-27 06:13:28,346 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:28,366 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:13:28,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 4 xjuncts. [2018-10-27 06:13:28,401 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:111, output treesize:180 [2018-10-27 06:13:28,460 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-27 06:13:28,460 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 16 loop predicates [2018-10-27 06:13:28,460 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 137 states and 147 transitions. cyclomatic complexity: 14 Second operand 18 states. [2018-10-27 06:13:29,018 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 137 states and 147 transitions. cyclomatic complexity: 14. Second operand 18 states. Result 331 states and 353 transitions. Complement of second has 39 states. [2018-10-27 06:13:29,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 20 states 1 stem states 18 non-accepting loop states 1 accepting loop states [2018-10-27 06:13:29,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-27 06:13:29,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 35 transitions. [2018-10-27 06:13:29,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 35 transitions. Stem has 34 letters. Loop has 33 letters. [2018-10-27 06:13:29,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:13:29,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 35 transitions. Stem has 67 letters. Loop has 33 letters. [2018-10-27 06:13:29,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:13:29,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 35 transitions. Stem has 34 letters. Loop has 66 letters. [2018-10-27 06:13:29,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:13:29,021 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 331 states and 353 transitions. [2018-10-27 06:13:29,022 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2018-10-27 06:13:29,023 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 331 states to 110 states and 114 transitions. [2018-10-27 06:13:29,023 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-10-27 06:13:29,023 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-10-27 06:13:29,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 110 states and 114 transitions. [2018-10-27 06:13:29,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:13:29,023 INFO L705 BuchiCegarLoop]: Abstraction has 110 states and 114 transitions. [2018-10-27 06:13:29,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states and 114 transitions. [2018-10-27 06:13:29,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 100. [2018-10-27 06:13:29,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-10-27 06:13:29,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 104 transitions. [2018-10-27 06:13:29,025 INFO L728 BuchiCegarLoop]: Abstraction has 100 states and 104 transitions. [2018-10-27 06:13:29,025 INFO L608 BuchiCegarLoop]: Abstraction has 100 states and 104 transitions. [2018-10-27 06:13:29,025 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-10-27 06:13:29,026 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 100 states and 104 transitions. [2018-10-27 06:13:29,026 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2018-10-27 06:13:29,026 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:13:29,026 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:13:29,027 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1] [2018-10-27 06:13:29,027 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:13:29,027 INFO L793 eck$LassoCheckResult]: Stem: 6796#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6793#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~mem9, main_#t~mem7, main_#t~mem8, main_#t~mem10, main_#t~mem5, main_#t~mem6, main_~i~0.base, main_~i~0.offset, main_~j~0.base, main_~j~0.offset, main_~n~0.base, main_~n~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~j~0.base, main_~j~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~n~0.base, main_~n~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 6784#L550-5 assume true; 6785#L550-1 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L550-1 6778#L550-2 SUMMARY for call main_#t~mem6 := read~int(main_~n~0.base, main_~n~0.offset, 4); srcloc: L550-2 6779#L550-3 assume !!(main_#t~mem5 < main_#t~mem6);havoc main_#t~mem6;havoc main_#t~mem5; 6783#L551 SUMMARY for call write~int(0, main_~j~0.base, main_~j~0.offset, 4); srcloc: L551 6774#L552-4 assume true; 6775#L552 SUMMARY for call main_#t~mem7 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L552 6800#L552-1 SUMMARY for call main_#t~mem8 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-1 6801#L552-2 assume !(main_#t~mem7 <= main_#t~mem8);havoc main_#t~mem8;havoc main_#t~mem7; 6780#L552-5 SUMMARY for call main_#t~mem10 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-5 6781#L555 SUMMARY for call write~int(main_#t~mem10 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L555 6849#L555-1 havoc main_#t~mem10; 6850#L550-5 assume true; 6870#L550-1 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L550-1 6868#L550-2 SUMMARY for call main_#t~mem6 := read~int(main_~n~0.base, main_~n~0.offset, 4); srcloc: L550-2 6866#L550-3 assume !!(main_#t~mem5 < main_#t~mem6);havoc main_#t~mem6;havoc main_#t~mem5; 6864#L551 SUMMARY for call write~int(0, main_~j~0.base, main_~j~0.offset, 4); srcloc: L551 6863#L552-4 assume true; 6862#L552 SUMMARY for call main_#t~mem7 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L552 6861#L552-1 SUMMARY for call main_#t~mem8 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-1 6860#L552-2 assume !!(main_#t~mem7 <= main_#t~mem8);havoc main_#t~mem8;havoc main_#t~mem7; 6858#L553 SUMMARY for call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L553 6797#L553-1 SUMMARY for call write~int(main_#t~mem9 + 1, main_~j~0.base, main_~j~0.offset, 4); srcloc: L553-1 6798#L553-2 havoc main_#t~mem9; 6802#L552-4 assume true; 6871#L552 SUMMARY for call main_#t~mem7 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L552 6869#L552-1 SUMMARY for call main_#t~mem8 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-1 6867#L552-2 assume !(main_#t~mem7 <= main_#t~mem8);havoc main_#t~mem8;havoc main_#t~mem7; 6865#L552-5 SUMMARY for call main_#t~mem10 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-5 6789#L555 SUMMARY for call write~int(main_#t~mem10 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L555 6790#L555-1 havoc main_#t~mem10; 6792#L550-5 assume true; 6846#L550-1 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L550-1 6844#L550-2 SUMMARY for call main_#t~mem6 := read~int(main_~n~0.base, main_~n~0.offset, 4); srcloc: L550-2 6842#L550-3 assume !!(main_#t~mem5 < main_#t~mem6);havoc main_#t~mem6;havoc main_#t~mem5; 6840#L551 SUMMARY for call write~int(0, main_~j~0.base, main_~j~0.offset, 4); srcloc: L551 6838#L552-4 assume true; 6836#L552 SUMMARY for call main_#t~mem7 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L552 6834#L552-1 SUMMARY for call main_#t~mem8 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-1 6832#L552-2 assume !!(main_#t~mem7 <= main_#t~mem8);havoc main_#t~mem8;havoc main_#t~mem7; 6830#L553 SUMMARY for call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L553 6828#L553-1 SUMMARY for call write~int(main_#t~mem9 + 1, main_~j~0.base, main_~j~0.offset, 4); srcloc: L553-1 6826#L553-2 havoc main_#t~mem9; 6824#L552-4 assume true; 6822#L552 SUMMARY for call main_#t~mem7 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L552 6820#L552-1 SUMMARY for call main_#t~mem8 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-1 6818#L552-2 assume !!(main_#t~mem7 <= main_#t~mem8);havoc main_#t~mem8;havoc main_#t~mem7; 6816#L553 SUMMARY for call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L553 6814#L553-1 SUMMARY for call write~int(main_#t~mem9 + 1, main_~j~0.base, main_~j~0.offset, 4); srcloc: L553-1 6812#L553-2 havoc main_#t~mem9; 6810#L552-4 assume true; 6807#L552 SUMMARY for call main_#t~mem7 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L552 6806#L552-1 SUMMARY for call main_#t~mem8 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-1 6805#L552-2 assume !(main_#t~mem7 <= main_#t~mem8);havoc main_#t~mem8;havoc main_#t~mem7; 6804#L552-5 SUMMARY for call main_#t~mem10 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-5 6787#L555 SUMMARY for call write~int(main_#t~mem10 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L555 6788#L555-1 havoc main_#t~mem10; 6791#L550-5 assume true; 6803#L550-1 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L550-1 6776#L550-2 SUMMARY for call main_#t~mem6 := read~int(main_~n~0.base, main_~n~0.offset, 4); srcloc: L550-2 6777#L550-3 assume !!(main_#t~mem5 < main_#t~mem6);havoc main_#t~mem6;havoc main_#t~mem5; 6782#L551 SUMMARY for call write~int(0, main_~j~0.base, main_~j~0.offset, 4); srcloc: L551 6772#L552-4 assume true; 6773#L552 [2018-10-27 06:13:29,027 INFO L795 eck$LassoCheckResult]: Loop: 6773#L552 SUMMARY for call main_#t~mem7 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L552 6799#L552-1 SUMMARY for call main_#t~mem8 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-1 6859#L552-2 assume !!(main_#t~mem7 <= main_#t~mem8);havoc main_#t~mem8;havoc main_#t~mem7; 6794#L553 SUMMARY for call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L553 6795#L553-1 SUMMARY for call write~int(main_#t~mem9 + 1, main_~j~0.base, main_~j~0.offset, 4); srcloc: L553-1 6857#L553-2 havoc main_#t~mem9; 6855#L552-4 assume true; 6809#L552 SUMMARY for call main_#t~mem7 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L552 6854#L552-1 SUMMARY for call main_#t~mem8 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-1 6853#L552-2 assume !!(main_#t~mem7 <= main_#t~mem8);havoc main_#t~mem8;havoc main_#t~mem7; 6852#L553 SUMMARY for call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L553 6851#L553-1 SUMMARY for call write~int(main_#t~mem9 + 1, main_~j~0.base, main_~j~0.offset, 4); srcloc: L553-1 6848#L553-2 havoc main_#t~mem9; 6847#L552-4 assume true; 6845#L552 SUMMARY for call main_#t~mem7 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L552 6843#L552-1 SUMMARY for call main_#t~mem8 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-1 6841#L552-2 assume !!(main_#t~mem7 <= main_#t~mem8);havoc main_#t~mem8;havoc main_#t~mem7; 6839#L553 SUMMARY for call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L553 6837#L553-1 SUMMARY for call write~int(main_#t~mem9 + 1, main_~j~0.base, main_~j~0.offset, 4); srcloc: L553-1 6835#L553-2 havoc main_#t~mem9; 6833#L552-4 assume true; 6831#L552 SUMMARY for call main_#t~mem7 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L552 6829#L552-1 SUMMARY for call main_#t~mem8 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-1 6827#L552-2 assume !(main_#t~mem7 <= main_#t~mem8);havoc main_#t~mem8;havoc main_#t~mem7; 6825#L552-5 SUMMARY for call main_#t~mem10 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-5 6823#L555 SUMMARY for call write~int(main_#t~mem10 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L555 6821#L555-1 havoc main_#t~mem10; 6819#L550-5 assume true; 6817#L550-1 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L550-1 6815#L550-2 SUMMARY for call main_#t~mem6 := read~int(main_~n~0.base, main_~n~0.offset, 4); srcloc: L550-2 6813#L550-3 assume !!(main_#t~mem5 < main_#t~mem6);havoc main_#t~mem6;havoc main_#t~mem5; 6811#L551 SUMMARY for call write~int(0, main_~j~0.base, main_~j~0.offset, 4); srcloc: L551 6808#L552-4 assume true; 6773#L552 [2018-10-27 06:13:29,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:29,028 INFO L82 PathProgramCache]: Analyzing trace with hash 916805432, now seen corresponding path program 12 times [2018-10-27 06:13:29,028 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:29,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:29,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:29,028 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:13:29,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:29,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:29,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:29,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:29,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1024771483, now seen corresponding path program 6 times [2018-10-27 06:13:29,057 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:29,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:29,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:29,057 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:13:29,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:29,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:29,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:29,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:29,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1570773490, now seen corresponding path program 13 times [2018-10-27 06:13:29,069 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:29,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:29,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:29,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:13:29,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:29,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:29,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:29,490 WARN L179 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 108 [2018-10-27 06:13:33,125 WARN L179 SmtUtils]: Spent 3.60 s on a formula simplification. DAG size of input: 240 DAG size of output: 224 [2018-10-27 06:13:33,667 WARN L179 SmtUtils]: Spent 539.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2018-10-27 06:13:33,670 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:13:33,670 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:13:33,670 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:13:33,670 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:13:33,671 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:13:33,671 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:13:33,671 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:13:33,671 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:13:33,671 INFO L131 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-2013CAV-Fig1-alloca_true-termination.c.i_Iteration11_Lasso [2018-10-27 06:13:33,671 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:13:33,671 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:13:33,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-10-27 06:13:33,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:33,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:33,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:33,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:33,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:33,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:33,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:33,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:33,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:34,475 WARN L179 SmtUtils]: Spent 632.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 100 [2018-10-27 06:13:34,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:34,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:34,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:34,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:34,957 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:13:34,957 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:13:34,958 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:13:34,958 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:34,958 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:34,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:34,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:34,958 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:34,958 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:13:34,958 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:34,959 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:34,959 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:13:34,959 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:34,959 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:34,959 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:34,959 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:34,960 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:13:34,960 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:34,960 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:34,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-10-27 06:13:34,961 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:34,961 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:34,961 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:34,961 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:34,961 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:13:34,961 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:34,962 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:34,962 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:13:34,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:34,963 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:34,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:34,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:34,963 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:34,963 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:13:34,963 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:34,963 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:34,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-10-27 06:13:34,964 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:34,964 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:34,964 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:34,964 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:34,964 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:13:34,964 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:34,965 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:34,965 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:13:34,966 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:34,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:34,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:34,966 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:34,966 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:13:34,966 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:34,967 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:34,967 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:13:34,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:34,967 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:34,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:34,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:34,968 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:34,968 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:13:34,968 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:34,968 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:34,968 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:13:34,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:34,969 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:34,969 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:34,969 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:34,969 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:34,969 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:13:34,969 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:34,969 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:34,970 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:13:34,970 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:34,970 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:34,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:34,970 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:34,971 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:13:34,971 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:34,971 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:34,972 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:13:34,972 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:34,972 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:13:34,972 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:34,972 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:34,973 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:13:34,973 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:34,975 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:34,975 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:13:34,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:34,975 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:34,975 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:34,975 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:34,976 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:13:34,976 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:34,977 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:34,977 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:13:34,977 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:34,978 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:13:34,978 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:34,978 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:34,978 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:13:34,978 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:34,980 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:34,980 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:13:34,981 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:34,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:34,981 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:34,981 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:34,983 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:13:34,983 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:34,991 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:34,992 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:13:34,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:34,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:34,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:34,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:34,993 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:13:34,993 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:34,996 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:34,996 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-27 06:13:34,996 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:34,996 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:34,996 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:34,997 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:34,997 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:13:34,997 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:35,002 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:13:35,008 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-10-27 06:13:35,009 INFO L444 ModelExtractionUtils]: 4 out of 13 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-10-27 06:13:35,009 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:13:35,009 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:13:35,009 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:13:35,009 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset)_7, v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_7) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset)_7 - 1*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_7 Supporting invariants [] [2018-10-27 06:13:35,232 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2018-10-27 06:13:35,234 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:13:35,234 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:13:35,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:35,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:13:35,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:13:35,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:13:35,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:13:35,325 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:35,360 INFO L477 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 7 case distinctions, treesize of input 34 treesize of output 67 [2018-10-27 06:13:35,373 INFO L477 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 54 [2018-10-27 06:13:35,374 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-10-27 06:13:35,470 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:35,479 INFO L477 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 54 [2018-10-27 06:13:35,480 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-10-27 06:13:35,554 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:35,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 7 case distinctions, treesize of input 31 treesize of output 68 [2018-10-27 06:13:35,574 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 9 xjuncts. [2018-10-27 06:13:35,679 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:35,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 36 [2018-10-27 06:13:35,680 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:35,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-10-27 06:13:35,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-10-27 06:13:35,758 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:34, output treesize:94 [2018-10-27 06:13:35,826 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:35,835 INFO L477 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 3 case distinctions, treesize of input 42 treesize of output 58 [2018-10-27 06:13:35,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 40 [2018-10-27 06:13:35,838 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:35,860 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:35,869 INFO L477 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 54 [2018-10-27 06:13:35,870 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-10-27 06:13:35,895 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 06:13:36,010 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:36,020 INFO L477 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 3 case distinctions, treesize of input 41 treesize of output 57 [2018-10-27 06:13:36,024 INFO L477 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 46 treesize of output 43 [2018-10-27 06:13:36,024 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:36,049 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:36,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 35 treesize of output 57 [2018-10-27 06:13:36,062 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 3 xjuncts. [2018-10-27 06:13:36,087 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 06:13:36,186 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:36,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 30 treesize of output 33 [2018-10-27 06:13:36,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-10-27 06:13:36,188 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:36,193 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:36,275 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:36,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 56 [2018-10-27 06:13:36,299 INFO L477 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 54 [2018-10-27 06:13:36,300 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 3 xjuncts. [2018-10-27 06:13:36,334 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:36,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 36 [2018-10-27 06:13:36,335 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:36,351 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:13:36,423 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:36,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 31 treesize of output 34 [2018-10-27 06:13:36,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-10-27 06:13:36,426 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:36,431 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:36,492 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:36,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 31 treesize of output 34 [2018-10-27 06:13:36,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-10-27 06:13:36,495 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:36,500 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:36,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-2 vars, End of recursive call: and 8 xjuncts. [2018-10-27 06:13:36,553 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 12 variables, input treesize:214, output treesize:124 [2018-10-27 06:13:36,788 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:36,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 64 [2018-10-27 06:13:36,802 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:36,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 44 [2018-10-27 06:13:36,803 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:36,824 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:36,833 INFO L477 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 58 [2018-10-27 06:13:36,834 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-10-27 06:13:36,857 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 06:13:36,965 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:36,974 INFO L477 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 3 case distinctions, treesize of input 38 treesize of output 56 [2018-10-27 06:13:36,976 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:36,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-10-27 06:13:36,977 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:36,999 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:37,008 INFO L477 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 50 [2018-10-27 06:13:37,009 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 3 xjuncts. [2018-10-27 06:13:37,021 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:37,111 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:37,129 INFO L477 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 7 case distinctions, treesize of input 44 treesize of output 75 [2018-10-27 06:13:37,134 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:37,166 INFO L477 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 56 [2018-10-27 06:13:37,167 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 3 xjuncts. [2018-10-27 06:13:37,253 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:37,262 INFO L477 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 56 [2018-10-27 06:13:37,263 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 3 xjuncts. [2018-10-27 06:13:37,372 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:37,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2018-10-27 06:13:37,373 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:37,413 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:37,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 7 case distinctions, treesize of input 37 treesize of output 70 [2018-10-27 06:13:37,433 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 9 xjuncts. [2018-10-27 06:13:37,481 INFO L267 ElimStorePlain]: Start of recursive call 8: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-10-27 06:13:37,562 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:37,570 INFO L477 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 3 case distinctions, treesize of input 39 treesize of output 57 [2018-10-27 06:13:37,573 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:37,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 37 [2018-10-27 06:13:37,574 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:37,596 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:37,598 INFO L477 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 33 treesize of output 36 [2018-10-27 06:13:37,598 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:37,768 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:13:37,827 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:37,837 INFO L477 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 63 [2018-10-27 06:13:37,840 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:37,842 INFO L477 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 47 [2018-10-27 06:13:37,843 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:37,868 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:37,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 39 treesize of output 61 [2018-10-27 06:13:37,880 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 3 xjuncts. [2018-10-27 06:13:37,902 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:13:37,958 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:37,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 42 [2018-10-27 06:13:37,962 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:37,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2018-10-27 06:13:37,963 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:37,969 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:38,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-10-27 06:13:38,002 INFO L202 ElimStorePlain]: Needed 20 recursive calls to eliminate 6 variables, input treesize:256, output treesize:166 [2018-10-27 06:13:38,240 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:38,257 INFO L477 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 7 case distinctions, treesize of input 60 treesize of output 85 [2018-10-27 06:13:38,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 54 [2018-10-27 06:13:38,262 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:38,363 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:38,372 INFO L477 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 68 [2018-10-27 06:13:38,373 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-10-27 06:13:38,436 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:38,437 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:38,439 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:38,440 INFO L477 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 52 treesize of output 65 [2018-10-27 06:13:38,440 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:38,478 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:38,481 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:38,484 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:38,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 49 treesize of output 79 [2018-10-27 06:13:38,495 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2018-10-27 06:13:38,539 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-27 06:13:38,588 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:38,596 INFO L477 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 3 case distinctions, treesize of input 53 treesize of output 65 [2018-10-27 06:13:38,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 47 [2018-10-27 06:13:38,599 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:38,622 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:38,623 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:38,625 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:38,626 INFO L477 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 43 treesize of output 58 [2018-10-27 06:13:38,626 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:38,642 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:13:38,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-10-27 06:13:38,691 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:114, output treesize:166 [2018-10-27 06:13:38,977 INFO L477 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 61 [2018-10-27 06:13:38,980 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:38,982 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:38,985 INFO L477 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 47 treesize of output 58 [2018-10-27 06:13:38,985 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-27 06:13:39,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 47 [2018-10-27 06:13:39,022 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:39,042 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:13:39,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 57 [2018-10-27 06:13:39,084 INFO L477 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 47 [2018-10-27 06:13:39,084 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:39,111 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:39,112 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:39,114 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:39,116 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:39,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 43 treesize of output 74 [2018-10-27 06:13:39,120 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-10-27 06:13:39,160 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:13:39,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 4 xjuncts. [2018-10-27 06:13:39,195 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:111, output treesize:180 [2018-10-27 06:13:39,258 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 16 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:13:39,258 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 19 loop predicates [2018-10-27 06:13:39,260 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 100 states and 104 transitions. cyclomatic complexity: 7 Second operand 21 states. [2018-10-27 06:13:39,283 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 100 states and 104 transitions. cyclomatic complexity: 7. Second operand 21 states. Result 114 states and 118 transitions. Complement of second has 5 states. [2018-10-27 06:13:39,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-10-27 06:13:39,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-27 06:13:39,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2018-10-27 06:13:39,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 65 letters. Loop has 33 letters. [2018-10-27 06:13:39,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:13:39,285 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:13:39,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:39,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:13:39,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:13:39,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:13:39,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:13:39,347 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:39,366 INFO L477 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 7 case distinctions, treesize of input 34 treesize of output 67 [2018-10-27 06:13:39,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 40 [2018-10-27 06:13:39,370 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:39,441 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:39,450 INFO L477 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 54 [2018-10-27 06:13:39,451 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-10-27 06:13:39,524 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:39,533 INFO L477 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 54 [2018-10-27 06:13:39,534 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 3 xjuncts. [2018-10-27 06:13:39,580 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:39,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 7 case distinctions, treesize of input 31 treesize of output 68 [2018-10-27 06:13:39,599 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 9 xjuncts. [2018-10-27 06:13:39,667 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 8 xjuncts. [2018-10-27 06:13:39,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-10-27 06:13:39,703 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:34, output treesize:94 [2018-10-27 06:13:39,788 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:39,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 30 treesize of output 33 [2018-10-27 06:13:39,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-10-27 06:13:39,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:39,797 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:39,892 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:39,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 56 [2018-10-27 06:13:39,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 40 [2018-10-27 06:13:39,906 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:39,928 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:39,938 INFO L477 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 54 [2018-10-27 06:13:39,938 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2018-10-27 06:13:39,961 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 06:13:40,048 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:40,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 31 treesize of output 34 [2018-10-27 06:13:40,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-10-27 06:13:40,052 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:40,057 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:40,122 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:40,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 31 treesize of output 34 [2018-10-27 06:13:40,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-10-27 06:13:40,126 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:40,132 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:40,200 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:40,210 INFO L477 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 3 case distinctions, treesize of input 41 treesize of output 57 [2018-10-27 06:13:40,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 43 treesize of output 57 [2018-10-27 06:13:40,229 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 3 xjuncts. [2018-10-27 06:13:40,286 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:40,288 INFO L477 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 34 treesize of output 39 [2018-10-27 06:13:40,288 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:40,308 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:13:40,363 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:40,372 INFO L477 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 3 case distinctions, treesize of input 42 treesize of output 58 [2018-10-27 06:13:40,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 40 [2018-10-27 06:13:40,383 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:40,407 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:40,415 INFO L477 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 54 [2018-10-27 06:13:40,416 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 3 xjuncts. [2018-10-27 06:13:40,437 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:13:40,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-2 vars, End of recursive call: and 8 xjuncts. [2018-10-27 06:13:40,492 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 12 variables, input treesize:214, output treesize:124 [2018-10-27 06:13:40,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 49 [2018-10-27 06:13:40,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2018-10-27 06:13:40,738 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:40,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 47 [2018-10-27 06:13:40,779 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-10-27 06:13:40,802 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:13:40,912 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 35 [2018-10-27 06:13:40,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-10-27 06:13:40,916 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:40,922 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:41,020 INFO L477 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 57 [2018-10-27 06:13:41,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 55 [2018-10-27 06:13:41,034 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 3 xjuncts. [2018-10-27 06:13:41,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2018-10-27 06:13:41,079 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:41,101 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:13:41,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 47 treesize of output 68 [2018-10-27 06:13:41,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 53 [2018-10-27 06:13:41,246 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 3 xjuncts. [2018-10-27 06:13:41,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 35 [2018-10-27 06:13:41,342 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:41,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 40 treesize of output 67 [2018-10-27 06:13:41,435 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 9 xjuncts. [2018-10-27 06:13:41,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 49 [2018-10-27 06:13:41,543 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 3 xjuncts. [2018-10-27 06:13:41,586 INFO L267 ElimStorePlain]: Start of recursive call 10: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-10-27 06:13:41,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 50 [2018-10-27 06:13:41,715 INFO L477 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 36 treesize of output 33 [2018-10-27 06:13:41,715 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:41,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2018-10-27 06:13:41,746 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:41,760 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:41,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 52 treesize of output 56 [2018-10-27 06:13:41,868 INFO L477 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 45 treesize of output 44 [2018-10-27 06:13:41,869 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:41,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 58 [2018-10-27 06:13:41,916 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 3 xjuncts. [2018-10-27 06:13:41,943 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:13:42,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-2 vars, End of recursive call: and 12 xjuncts. [2018-10-27 06:13:42,036 INFO L202 ElimStorePlain]: Needed 20 recursive calls to eliminate 12 variables, input treesize:274, output treesize:330 [2018-10-27 06:13:42,282 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:42,290 INFO L477 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 3 case distinctions, treesize of input 53 treesize of output 65 [2018-10-27 06:13:42,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 47 [2018-10-27 06:13:42,293 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:42,316 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:42,317 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:42,320 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:42,320 INFO L477 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 43 treesize of output 58 [2018-10-27 06:13:42,321 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:42,336 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:13:42,371 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:42,388 INFO L477 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 7 case distinctions, treesize of input 60 treesize of output 85 [2018-10-27 06:13:42,402 INFO L477 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 68 [2018-10-27 06:13:42,404 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2018-10-27 06:13:42,563 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:42,564 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:42,566 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:42,567 INFO L477 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 52 treesize of output 65 [2018-10-27 06:13:42,567 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:42,651 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:42,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 50 [2018-10-27 06:13:42,652 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:42,697 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:42,701 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:42,704 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:42,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 49 treesize of output 79 [2018-10-27 06:13:42,716 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 3 xjuncts. [2018-10-27 06:13:42,774 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-10-27 06:13:42,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-10-27 06:13:42,828 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:114, output treesize:166 [2018-10-27 06:13:43,108 INFO L477 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 61 [2018-10-27 06:13:43,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 47 [2018-10-27 06:13:43,111 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:43,138 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:43,139 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:43,142 INFO L477 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 47 treesize of output 58 [2018-10-27 06:13:43,143 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-10-27 06:13:43,167 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:13:43,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 57 [2018-10-27 06:13:43,208 INFO L477 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 47 [2018-10-27 06:13:43,209 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:43,236 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:43,237 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:43,239 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:43,241 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:43,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 43 treesize of output 74 [2018-10-27 06:13:43,244 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-10-27 06:13:43,274 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:13:43,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 4 xjuncts. [2018-10-27 06:13:43,308 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:111, output treesize:180 [2018-10-27 06:13:43,371 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:13:43,371 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 19 loop predicates [2018-10-27 06:13:43,371 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 100 states and 104 transitions. cyclomatic complexity: 7 Second operand 21 states. [2018-10-27 06:13:43,394 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 100 states and 104 transitions. cyclomatic complexity: 7. Second operand 21 states. Result 114 states and 118 transitions. Complement of second has 5 states. [2018-10-27 06:13:43,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-10-27 06:13:43,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-27 06:13:43,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2018-10-27 06:13:43,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 65 letters. Loop has 33 letters. [2018-10-27 06:13:43,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:13:43,395 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:13:43,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:43,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:13:43,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:13:43,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:13:43,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:13:43,551 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:43,569 INFO L477 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 7 case distinctions, treesize of input 34 treesize of output 67 [2018-10-27 06:13:43,595 INFO L477 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 54 [2018-10-27 06:13:43,596 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-10-27 06:13:43,691 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:43,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 7 case distinctions, treesize of input 31 treesize of output 68 [2018-10-27 06:13:43,711 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 9 xjuncts. [2018-10-27 06:13:43,824 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:43,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 36 [2018-10-27 06:13:43,825 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:43,893 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:43,901 INFO L477 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 50 [2018-10-27 06:13:43,902 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2018-10-27 06:13:43,945 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-10-27 06:13:43,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-10-27 06:13:43,978 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:34, output treesize:94 [2018-10-27 06:13:44,067 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:44,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 56 [2018-10-27 06:13:44,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 40 [2018-10-27 06:13:44,082 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:44,104 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:44,113 INFO L477 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 54 [2018-10-27 06:13:44,114 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-10-27 06:13:44,132 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:13:44,242 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:44,251 INFO L477 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 3 case distinctions, treesize of input 41 treesize of output 57 [2018-10-27 06:13:44,255 INFO L477 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 46 treesize of output 43 [2018-10-27 06:13:44,256 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:44,282 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:44,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 35 treesize of output 57 [2018-10-27 06:13:44,293 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 3 xjuncts. [2018-10-27 06:13:44,319 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 06:13:44,413 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:44,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 31 treesize of output 34 [2018-10-27 06:13:44,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-10-27 06:13:44,418 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:44,424 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:44,499 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:44,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 30 treesize of output 33 [2018-10-27 06:13:44,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-10-27 06:13:44,502 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:44,507 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:44,570 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:44,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 31 treesize of output 34 [2018-10-27 06:13:44,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-10-27 06:13:44,572 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:44,578 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:44,633 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:44,642 INFO L477 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 3 case distinctions, treesize of input 42 treesize of output 58 [2018-10-27 06:13:44,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 40 [2018-10-27 06:13:44,656 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:44,680 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:44,689 INFO L477 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 54 [2018-10-27 06:13:44,690 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 3 xjuncts. [2018-10-27 06:13:44,716 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 06:13:44,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-2 vars, End of recursive call: and 8 xjuncts. [2018-10-27 06:13:44,775 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 12 variables, input treesize:214, output treesize:124 [2018-10-27 06:13:45,008 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:45,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 42 [2018-10-27 06:13:45,013 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:45,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2018-10-27 06:13:45,014 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:45,020 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:45,108 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:45,117 INFO L477 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 3 case distinctions, treesize of input 39 treesize of output 57 [2018-10-27 06:13:45,121 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:45,122 INFO L477 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 43 treesize of output 36 [2018-10-27 06:13:45,122 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:45,150 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:45,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-10-27 06:13:45,151 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:45,162 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:45,238 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:45,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 64 [2018-10-27 06:13:45,252 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:45,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 44 [2018-10-27 06:13:45,253 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:45,275 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:45,283 INFO L477 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 58 [2018-10-27 06:13:45,284 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 3 xjuncts. [2018-10-27 06:13:45,308 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 06:13:45,376 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:45,385 INFO L477 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 3 case distinctions, treesize of input 38 treesize of output 56 [2018-10-27 06:13:45,388 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:45,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-10-27 06:13:45,389 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:45,424 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:45,433 INFO L477 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 50 [2018-10-27 06:13:45,434 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 3 xjuncts. [2018-10-27 06:13:45,446 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:45,499 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:45,530 INFO L477 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 7 case distinctions, treesize of input 44 treesize of output 75 [2018-10-27 06:13:45,534 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:45,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 42 [2018-10-27 06:13:45,535 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:45,606 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:45,615 INFO L477 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 56 [2018-10-27 06:13:45,616 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 3 xjuncts. [2018-10-27 06:13:45,664 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:45,673 INFO L477 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 56 [2018-10-27 06:13:45,674 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 3 xjuncts. [2018-10-27 06:13:45,714 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:45,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 7 case distinctions, treesize of input 37 treesize of output 70 [2018-10-27 06:13:45,735 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 9 xjuncts. [2018-10-27 06:13:45,787 INFO L267 ElimStorePlain]: Start of recursive call 13: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-27 06:13:45,834 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:45,844 INFO L477 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 63 [2018-10-27 06:13:45,849 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:45,851 INFO L477 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 47 [2018-10-27 06:13:45,851 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:45,875 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:45,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 39 treesize of output 61 [2018-10-27 06:13:45,887 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 3 xjuncts. [2018-10-27 06:13:45,909 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:13:45,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-10-27 06:13:45,943 INFO L202 ElimStorePlain]: Needed 20 recursive calls to eliminate 6 variables, input treesize:256, output treesize:166 [2018-10-27 06:13:46,216 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:46,224 INFO L477 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 3 case distinctions, treesize of input 53 treesize of output 65 [2018-10-27 06:13:46,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 47 [2018-10-27 06:13:46,227 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:46,251 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:46,253 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:46,255 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:46,255 INFO L477 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 43 treesize of output 58 [2018-10-27 06:13:46,256 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:46,272 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:13:46,308 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:46,325 INFO L477 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 7 case distinctions, treesize of input 60 treesize of output 85 [2018-10-27 06:13:46,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 54 [2018-10-27 06:13:46,330 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:46,436 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:46,445 INFO L477 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 68 [2018-10-27 06:13:46,447 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 3 xjuncts. [2018-10-27 06:13:46,521 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:46,525 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:46,529 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:46,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 49 treesize of output 79 [2018-10-27 06:13:46,540 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 3 xjuncts. [2018-10-27 06:13:46,615 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:46,616 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:46,618 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:46,619 INFO L477 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 48 treesize of output 61 [2018-10-27 06:13:46,620 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:46,663 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-27 06:13:46,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-10-27 06:13:46,715 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:114, output treesize:166 [2018-10-27 06:13:47,010 INFO L477 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 61 [2018-10-27 06:13:47,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 47 [2018-10-27 06:13:47,014 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:47,043 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:47,045 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:47,047 INFO L477 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 47 treesize of output 58 [2018-10-27 06:13:47,048 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-10-27 06:13:47,074 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:13:47,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 57 [2018-10-27 06:13:47,118 INFO L477 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 47 [2018-10-27 06:13:47,119 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:47,147 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:47,148 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:47,151 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:47,153 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:47,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 43 treesize of output 74 [2018-10-27 06:13:47,156 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-10-27 06:13:47,184 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:13:47,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 4 xjuncts. [2018-10-27 06:13:47,220 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:111, output treesize:180 [2018-10-27 06:13:47,286 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 16 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:13:47,286 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 19 loop predicates [2018-10-27 06:13:47,286 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 100 states and 104 transitions. cyclomatic complexity: 7 Second operand 21 states. [2018-10-27 06:13:47,681 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 41 [2018-10-27 06:13:47,856 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 44 [2018-10-27 06:13:48,608 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 100 states and 104 transitions. cyclomatic complexity: 7. Second operand 21 states. Result 423 states and 439 transitions. Complement of second has 86 states. [2018-10-27 06:13:48,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 21 states 1 stem states 19 non-accepting loop states 1 accepting loop states [2018-10-27 06:13:48,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-27 06:13:48,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 59 transitions. [2018-10-27 06:13:48,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 59 transitions. Stem has 65 letters. Loop has 33 letters. [2018-10-27 06:13:48,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:13:48,610 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:13:48,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:48,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:13:48,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:13:48,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:13:48,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:13:48,696 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:48,714 INFO L477 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 7 case distinctions, treesize of input 34 treesize of output 67 [2018-10-27 06:13:48,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 40 [2018-10-27 06:13:48,734 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:48,806 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:48,815 INFO L477 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 54 [2018-10-27 06:13:48,816 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-10-27 06:13:48,869 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:48,878 INFO L477 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 54 [2018-10-27 06:13:48,879 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 3 xjuncts. [2018-10-27 06:13:48,928 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:48,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 7 case distinctions, treesize of input 31 treesize of output 68 [2018-10-27 06:13:48,948 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 9 xjuncts. [2018-10-27 06:13:49,018 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 8 xjuncts. [2018-10-27 06:13:49,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-10-27 06:13:49,057 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:34, output treesize:94 [2018-10-27 06:13:49,126 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:49,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 31 treesize of output 34 [2018-10-27 06:13:49,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-10-27 06:13:49,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:49,136 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:49,278 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:49,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 30 treesize of output 33 [2018-10-27 06:13:49,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-10-27 06:13:49,299 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:49,431 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:49,922 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:49,931 INFO L477 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 3 case distinctions, treesize of input 41 treesize of output 57 [2018-10-27 06:13:49,935 INFO L477 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 46 treesize of output 43 [2018-10-27 06:13:49,936 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:49,963 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:49,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 35 treesize of output 57 [2018-10-27 06:13:49,975 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 3 xjuncts. [2018-10-27 06:13:49,996 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:13:50,067 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:50,077 INFO L477 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 3 case distinctions, treesize of input 42 treesize of output 58 [2018-10-27 06:13:50,089 INFO L477 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 54 [2018-10-27 06:13:50,090 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 3 xjuncts. [2018-10-27 06:13:50,133 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:50,134 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2018-10-27 06:13:50,134 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:50,154 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:13:50,221 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:50,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 31 treesize of output 34 [2018-10-27 06:13:50,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-10-27 06:13:50,224 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:50,230 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:50,291 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:50,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 56 [2018-10-27 06:13:50,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 40 [2018-10-27 06:13:50,306 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:50,330 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:50,339 INFO L477 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 54 [2018-10-27 06:13:50,340 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 3 xjuncts. [2018-10-27 06:13:50,362 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 06:13:50,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-2 vars, End of recursive call: and 8 xjuncts. [2018-10-27 06:13:50,422 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 12 variables, input treesize:214, output treesize:124 [2018-10-27 06:13:50,691 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:50,700 INFO L477 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 3 case distinctions, treesize of input 38 treesize of output 56 [2018-10-27 06:13:50,705 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:50,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-10-27 06:13:50,706 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:50,739 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:50,749 INFO L477 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 50 [2018-10-27 06:13:50,750 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-10-27 06:13:50,763 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:50,854 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:50,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 42 [2018-10-27 06:13:50,858 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:50,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2018-10-27 06:13:50,859 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:50,864 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:50,943 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:50,961 INFO L477 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 7 case distinctions, treesize of input 44 treesize of output 75 [2018-10-27 06:13:50,967 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:50,977 INFO L477 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 56 [2018-10-27 06:13:50,978 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 3 xjuncts. [2018-10-27 06:13:51,069 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:51,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2018-10-27 06:13:51,070 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:51,125 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:51,135 INFO L477 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 56 [2018-10-27 06:13:51,136 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 3 xjuncts. [2018-10-27 06:13:51,179 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:51,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 7 case distinctions, treesize of input 37 treesize of output 70 [2018-10-27 06:13:51,200 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 9 xjuncts. [2018-10-27 06:13:51,265 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-10-27 06:13:51,340 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:51,351 INFO L477 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 63 [2018-10-27 06:13:51,358 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:51,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 49 treesize of output 61 [2018-10-27 06:13:51,371 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 3 xjuncts. [2018-10-27 06:13:51,421 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:51,423 INFO L477 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 38 treesize of output 43 [2018-10-27 06:13:51,423 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:51,445 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:13:51,518 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:51,528 INFO L477 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 3 case distinctions, treesize of input 39 treesize of output 57 [2018-10-27 06:13:51,530 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:51,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 37 [2018-10-27 06:13:51,531 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:51,553 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:51,555 INFO L477 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 33 treesize of output 36 [2018-10-27 06:13:51,555 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:51,570 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:13:51,616 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:51,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 64 [2018-10-27 06:13:51,629 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:51,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 44 [2018-10-27 06:13:51,630 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:51,652 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:51,660 INFO L477 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 58 [2018-10-27 06:13:51,661 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 3 xjuncts. [2018-10-27 06:13:51,684 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 06:13:51,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-10-27 06:13:51,719 INFO L202 ElimStorePlain]: Needed 20 recursive calls to eliminate 6 variables, input treesize:256, output treesize:166 [2018-10-27 06:13:51,968 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:51,986 INFO L477 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 7 case distinctions, treesize of input 60 treesize of output 85 [2018-10-27 06:13:52,001 INFO L477 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 68 [2018-10-27 06:13:52,002 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-10-27 06:13:52,137 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:52,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 50 [2018-10-27 06:13:52,138 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:52,204 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:52,208 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:52,211 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:52,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 49 treesize of output 79 [2018-10-27 06:13:52,223 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 3 xjuncts. [2018-10-27 06:13:52,368 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:52,370 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:52,372 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:52,373 INFO L477 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 48 treesize of output 61 [2018-10-27 06:13:52,374 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:52,419 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-27 06:13:52,470 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:52,479 INFO L477 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 3 case distinctions, treesize of input 53 treesize of output 65 [2018-10-27 06:13:52,482 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:52,483 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:52,485 INFO L477 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 51 treesize of output 58 [2018-10-27 06:13:52,485 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:52,519 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:52,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 47 [2018-10-27 06:13:52,520 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:52,541 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:13:52,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-10-27 06:13:52,594 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:114, output treesize:166 [2018-10-27 06:13:52,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 57 [2018-10-27 06:13:52,890 INFO L477 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 47 [2018-10-27 06:13:52,891 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:52,919 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:52,921 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:52,923 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:52,925 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:52,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 43 treesize of output 74 [2018-10-27 06:13:52,928 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-10-27 06:13:52,956 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:13:52,997 INFO L477 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 61 [2018-10-27 06:13:53,000 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:53,001 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:53,003 INFO L477 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 47 treesize of output 58 [2018-10-27 06:13:53,004 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-10-27 06:13:53,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 47 [2018-10-27 06:13:53,041 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:53,062 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:13:53,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 4 xjuncts. [2018-10-27 06:13:53,097 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:111, output treesize:180 [2018-10-27 06:13:53,162 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 16 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:13:53,162 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 19 loop predicates [2018-10-27 06:13:53,163 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 100 states and 104 transitions. cyclomatic complexity: 7 Second operand 21 states. [2018-10-27 06:13:53,883 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 41 [2018-10-27 06:13:54,047 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 44 [2018-10-27 06:13:54,364 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 35 [2018-10-27 06:13:54,838 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2018-10-27 06:13:54,839 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 100 states and 104 transitions. cyclomatic complexity: 7. Second operand 21 states. Result 446 states and 463 transitions. Complement of second has 90 states. [2018-10-27 06:13:54,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 23 states 1 stem states 21 non-accepting loop states 1 accepting loop states [2018-10-27 06:13:54,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-27 06:13:54,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 61 transitions. [2018-10-27 06:13:54,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 61 transitions. Stem has 65 letters. Loop has 33 letters. [2018-10-27 06:13:54,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:13:54,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 61 transitions. Stem has 98 letters. Loop has 33 letters. [2018-10-27 06:13:54,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:13:54,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 61 transitions. Stem has 65 letters. Loop has 66 letters. [2018-10-27 06:13:54,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:13:54,841 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 446 states and 463 transitions. [2018-10-27 06:13:54,844 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 98 [2018-10-27 06:13:54,845 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 446 states to 165 states and 172 transitions. [2018-10-27 06:13:54,845 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-10-27 06:13:54,845 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-10-27 06:13:54,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 165 states and 172 transitions. [2018-10-27 06:13:54,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:13:54,845 INFO L705 BuchiCegarLoop]: Abstraction has 165 states and 172 transitions. [2018-10-27 06:13:54,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states and 172 transitions. [2018-10-27 06:13:54,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 126. [2018-10-27 06:13:54,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-10-27 06:13:54,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 131 transitions. [2018-10-27 06:13:54,855 INFO L728 BuchiCegarLoop]: Abstraction has 126 states and 131 transitions. [2018-10-27 06:13:54,856 INFO L608 BuchiCegarLoop]: Abstraction has 126 states and 131 transitions. [2018-10-27 06:13:54,856 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-10-27 06:13:54,856 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 131 transitions. [2018-10-27 06:13:54,856 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 60 [2018-10-27 06:13:54,856 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:13:54,856 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:13:54,857 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1] [2018-10-27 06:13:54,857 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [7, 7, 7, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2018-10-27 06:13:54,858 INFO L793 eck$LassoCheckResult]: Stem: 9587#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9584#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~mem9, main_#t~mem7, main_#t~mem8, main_#t~mem10, main_#t~mem5, main_#t~mem6, main_~i~0.base, main_~i~0.offset, main_~j~0.base, main_~j~0.offset, main_~n~0.base, main_~n~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~j~0.base, main_~j~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~n~0.base, main_~n~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 9575#L550-5 assume true; 9576#L550-1 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L550-1 9568#L550-2 SUMMARY for call main_#t~mem6 := read~int(main_~n~0.base, main_~n~0.offset, 4); srcloc: L550-2 9569#L550-3 assume !!(main_#t~mem5 < main_#t~mem6);havoc main_#t~mem6;havoc main_#t~mem5; 9662#L551 SUMMARY for call write~int(0, main_~j~0.base, main_~j~0.offset, 4); srcloc: L551 9659#L552-4 assume true; 9656#L552 SUMMARY for call main_#t~mem7 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L552 9653#L552-1 SUMMARY for call main_#t~mem8 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-1 9650#L552-2 assume !(main_#t~mem7 <= main_#t~mem8);havoc main_#t~mem8;havoc main_#t~mem7; 9644#L552-5 SUMMARY for call main_#t~mem10 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-5 9645#L555 SUMMARY for call write~int(main_#t~mem10 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L555 9648#L555-1 havoc main_#t~mem10; 9649#L550-5 assume true; 9666#L550-1 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L550-1 9665#L550-2 SUMMARY for call main_#t~mem6 := read~int(main_~n~0.base, main_~n~0.offset, 4); srcloc: L550-2 9571#L550-3 assume !!(main_#t~mem5 < main_#t~mem6);havoc main_#t~mem6;havoc main_#t~mem5; 9572#L551 SUMMARY for call write~int(0, main_~j~0.base, main_~j~0.offset, 4); srcloc: L551 9590#L552-4 assume true; 9677#L552 SUMMARY for call main_#t~mem7 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L552 9676#L552-1 SUMMARY for call main_#t~mem8 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-1 9675#L552-2 assume !!(main_#t~mem7 <= main_#t~mem8);havoc main_#t~mem8;havoc main_#t~mem7; 9674#L553 SUMMARY for call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L553 9673#L553-1 SUMMARY for call write~int(main_#t~mem9 + 1, main_~j~0.base, main_~j~0.offset, 4); srcloc: L553-1 9672#L553-2 havoc main_#t~mem9; 9671#L552-4 assume true; 9670#L552 SUMMARY for call main_#t~mem7 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L552 9669#L552-1 SUMMARY for call main_#t~mem8 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-1 9668#L552-2 assume !(main_#t~mem7 <= main_#t~mem8);havoc main_#t~mem8;havoc main_#t~mem7; 9573#L552-5 SUMMARY for call main_#t~mem10 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-5 9574#L555 SUMMARY for call write~int(main_#t~mem10 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L555 9643#L555-1 havoc main_#t~mem10; 9641#L550-5 assume true; 9639#L550-1 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L550-1 9637#L550-2 SUMMARY for call main_#t~mem6 := read~int(main_~n~0.base, main_~n~0.offset, 4); srcloc: L550-2 9635#L550-3 assume !!(main_#t~mem5 < main_#t~mem6);havoc main_#t~mem6;havoc main_#t~mem5; 9633#L551 SUMMARY for call write~int(0, main_~j~0.base, main_~j~0.offset, 4); srcloc: L551 9631#L552-4 assume true; 9629#L552 SUMMARY for call main_#t~mem7 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L552 9627#L552-1 SUMMARY for call main_#t~mem8 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-1 9625#L552-2 assume !!(main_#t~mem7 <= main_#t~mem8);havoc main_#t~mem8;havoc main_#t~mem7; 9623#L553 SUMMARY for call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L553 9621#L553-1 SUMMARY for call write~int(main_#t~mem9 + 1, main_~j~0.base, main_~j~0.offset, 4); srcloc: L553-1 9619#L553-2 havoc main_#t~mem9; 9617#L552-4 assume true; 9615#L552 SUMMARY for call main_#t~mem7 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L552 9613#L552-1 SUMMARY for call main_#t~mem8 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-1 9611#L552-2 assume !!(main_#t~mem7 <= main_#t~mem8);havoc main_#t~mem8;havoc main_#t~mem7; 9609#L553 SUMMARY for call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L553 9607#L553-1 SUMMARY for call write~int(main_#t~mem9 + 1, main_~j~0.base, main_~j~0.offset, 4); srcloc: L553-1 9605#L553-2 havoc main_#t~mem9; 9603#L552-4 assume true; 9601#L552 SUMMARY for call main_#t~mem7 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L552 9599#L552-1 SUMMARY for call main_#t~mem8 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-1 9597#L552-2 assume !(main_#t~mem7 <= main_#t~mem8);havoc main_#t~mem8;havoc main_#t~mem7; 9595#L552-5 SUMMARY for call main_#t~mem10 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-5 9578#L555 SUMMARY for call write~int(main_#t~mem10 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L555 9579#L555-1 havoc main_#t~mem10; 9582#L550-5 assume true; 9592#L550-1 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L550-1 9566#L550-2 SUMMARY for call main_#t~mem6 := read~int(main_~n~0.base, main_~n~0.offset, 4); srcloc: L550-2 9567#L550-3 assume !!(main_#t~mem5 < main_#t~mem6);havoc main_#t~mem6;havoc main_#t~mem5; 9570#L551 SUMMARY for call write~int(0, main_~j~0.base, main_~j~0.offset, 4); srcloc: L551 9561#L552-4 assume true; 9562#L552 [2018-10-27 06:13:54,858 INFO L795 eck$LassoCheckResult]: Loop: 9562#L552 SUMMARY for call main_#t~mem7 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L552 9588#L552-1 SUMMARY for call main_#t~mem8 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-1 9591#L552-2 assume !!(main_#t~mem7 <= main_#t~mem8);havoc main_#t~mem8;havoc main_#t~mem7; 9585#L553 SUMMARY for call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L553 9586#L553-1 SUMMARY for call write~int(main_#t~mem9 + 1, main_~j~0.base, main_~j~0.offset, 4); srcloc: L553-1 9589#L553-2 havoc main_#t~mem9; 9563#L552-4 assume true; 9565#L552 SUMMARY for call main_#t~mem7 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L552 9686#L552-1 SUMMARY for call main_#t~mem8 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-1 9685#L552-2 assume !!(main_#t~mem7 <= main_#t~mem8);havoc main_#t~mem8;havoc main_#t~mem7; 9684#L553 SUMMARY for call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L553 9683#L553-1 SUMMARY for call write~int(main_#t~mem9 + 1, main_~j~0.base, main_~j~0.offset, 4); srcloc: L553-1 9682#L553-2 havoc main_#t~mem9; 9681#L552-4 assume true; 9680#L552 SUMMARY for call main_#t~mem7 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L552 9679#L552-1 SUMMARY for call main_#t~mem8 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-1 9678#L552-2 assume !!(main_#t~mem7 <= main_#t~mem8);havoc main_#t~mem8;havoc main_#t~mem7; 9667#L553 SUMMARY for call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L553 9664#L553-1 SUMMARY for call write~int(main_#t~mem9 + 1, main_~j~0.base, main_~j~0.offset, 4); srcloc: L553-1 9661#L553-2 havoc main_#t~mem9; 9658#L552-4 assume true; 9655#L552 SUMMARY for call main_#t~mem7 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L552 9652#L552-1 SUMMARY for call main_#t~mem8 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-1 9646#L552-2 assume !(main_#t~mem7 <= main_#t~mem8);havoc main_#t~mem8;havoc main_#t~mem7; 9647#L552-5 SUMMARY for call main_#t~mem10 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-5 9580#L555 SUMMARY for call write~int(main_#t~mem10 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L555 9581#L555-1 havoc main_#t~mem10; 9583#L550-5 assume true; 9663#L550-1 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L550-1 9660#L550-2 SUMMARY for call main_#t~mem6 := read~int(main_~n~0.base, main_~n~0.offset, 4); srcloc: L550-2 9657#L550-3 assume !!(main_#t~mem5 < main_#t~mem6);havoc main_#t~mem6;havoc main_#t~mem5; 9654#L551 SUMMARY for call write~int(0, main_~j~0.base, main_~j~0.offset, 4); srcloc: L551 9651#L552-4 assume true; 9594#L552 SUMMARY for call main_#t~mem7 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L552 9642#L552-1 SUMMARY for call main_#t~mem8 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-1 9640#L552-2 assume !!(main_#t~mem7 <= main_#t~mem8);havoc main_#t~mem8;havoc main_#t~mem7; 9638#L553 SUMMARY for call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L553 9636#L553-1 SUMMARY for call write~int(main_#t~mem9 + 1, main_~j~0.base, main_~j~0.offset, 4); srcloc: L553-1 9634#L553-2 havoc main_#t~mem9; 9632#L552-4 assume true; 9630#L552 SUMMARY for call main_#t~mem7 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L552 9628#L552-1 SUMMARY for call main_#t~mem8 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-1 9626#L552-2 assume !!(main_#t~mem7 <= main_#t~mem8);havoc main_#t~mem8;havoc main_#t~mem7; 9624#L553 SUMMARY for call main_#t~mem9 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L553 9622#L553-1 SUMMARY for call write~int(main_#t~mem9 + 1, main_~j~0.base, main_~j~0.offset, 4); srcloc: L553-1 9620#L553-2 havoc main_#t~mem9; 9618#L552-4 assume true; 9616#L552 SUMMARY for call main_#t~mem7 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L552 9614#L552-1 SUMMARY for call main_#t~mem8 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-1 9612#L552-2 assume !(main_#t~mem7 <= main_#t~mem8);havoc main_#t~mem8;havoc main_#t~mem7; 9610#L552-5 SUMMARY for call main_#t~mem10 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L552-5 9608#L555 SUMMARY for call write~int(main_#t~mem10 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L555 9606#L555-1 havoc main_#t~mem10; 9604#L550-5 assume true; 9602#L550-1 SUMMARY for call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L550-1 9600#L550-2 SUMMARY for call main_#t~mem6 := read~int(main_~n~0.base, main_~n~0.offset, 4); srcloc: L550-2 9598#L550-3 assume !!(main_#t~mem5 < main_#t~mem6);havoc main_#t~mem6;havoc main_#t~mem5; 9596#L551 SUMMARY for call write~int(0, main_~j~0.base, main_~j~0.offset, 4); srcloc: L551 9593#L552-4 assume true; 9562#L552 [2018-10-27 06:13:54,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:54,858 INFO L82 PathProgramCache]: Analyzing trace with hash 916805432, now seen corresponding path program 14 times [2018-10-27 06:13:54,858 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:54,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:54,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:54,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:13:54,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:54,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:54,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:54,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:54,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1377435429, now seen corresponding path program 7 times [2018-10-27 06:13:54,907 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:54,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:54,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:54,908 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:13:54,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:54,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:54,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:54,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:54,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1628371780, now seen corresponding path program 15 times [2018-10-27 06:13:54,937 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:54,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:54,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:54,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:13:54,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:54,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:13:55,477 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 304 proven. 102 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-10-27 06:13:55,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:13:55,478 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_942fb0c5-24e1-40d7-b7a4-e3e8821e4994/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:13:55,487 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 06:13:55,567 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-27 06:13:55,568 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:13:55,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:13:55,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2018-10-27 06:13:55,599 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:55,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:55,602 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2018-10-27 06:13:55,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 8 [2018-10-27 06:13:55,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 06:13:55,611 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:55,613 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:55,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:55,616 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-10-27 06:13:55,643 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:55,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 29 [2018-10-27 06:13:55,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2018-10-27 06:13:55,646 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:55,650 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:55,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:55,655 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:12 [2018-10-27 06:13:55,677 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:55,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 29 [2018-10-27 06:13:55,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-10-27 06:13:55,680 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:55,689 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:55,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:55,693 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:12 [2018-10-27 06:13:56,150 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-27 06:13:56,227 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 29 [2018-10-27 06:13:56,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-10-27 06:13:56,230 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:56,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:56,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:56,239 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:12 [2018-10-27 06:13:56,262 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:13:56,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 29 [2018-10-27 06:13:56,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-10-27 06:13:56,266 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:56,270 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:56,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:56,275 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:12 [2018-10-27 06:13:56,280 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-10-27 06:13:56,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 06:13:56,282 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:56,287 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:56,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:56,291 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-10-27 06:13:56,319 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-10-27 06:13:56,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-10-27 06:13:56,321 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:56,327 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:56,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:56,331 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:19 [2018-10-27 06:13:56,381 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-10-27 06:13:56,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-10-27 06:13:56,383 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:13:56,389 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:56,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:13:56,394 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:19 [2018-10-27 06:13:56,475 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 303 proven. 103 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-10-27 06:13:56,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:13:56,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 21] total 39 [2018-10-27 06:13:57,914 WARN L179 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 173 DAG size of output: 169 [2018-10-27 06:13:57,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-27 06:13:57,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1280, Unknown=0, NotChecked=0, Total=1482 [2018-10-27 06:13:57,981 INFO L87 Difference]: Start difference. First operand 126 states and 131 transitions. cyclomatic complexity: 8 Second operand 39 states. [2018-10-27 06:13:59,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:13:59,365 INFO L93 Difference]: Finished difference Result 219 states and 227 transitions. [2018-10-27 06:13:59,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-27 06:13:59,367 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 219 states and 227 transitions. [2018-10-27 06:13:59,368 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:13:59,368 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 219 states to 0 states and 0 transitions. [2018-10-27 06:13:59,368 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-10-27 06:13:59,368 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-10-27 06:13:59,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-10-27 06:13:59,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:13:59,368 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:13:59,368 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:13:59,368 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:13:59,368 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-10-27 06:13:59,368 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:13:59,368 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:13:59,368 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-10-27 06:13:59,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:13:59 BoogieIcfgContainer [2018-10-27 06:13:59,374 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:13:59,374 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:13:59,374 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:13:59,374 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:13:59,375 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:12:44" (3/4) ... [2018-10-27 06:13:59,378 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-27 06:13:59,378 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:13:59,379 INFO L168 Benchmark]: Toolchain (without parser) took 76040.74 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 488.1 MB). Free memory was 955.9 MB in the beginning and 1.3 GB in the end (delta: -356.8 MB). Peak memory consumption was 131.3 MB. Max. memory is 11.5 GB. [2018-10-27 06:13:59,379 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:13:59,379 INFO L168 Benchmark]: CACSL2BoogieTranslator took 361.16 ms. Allocated memory is still 1.0 GB. Free memory was 955.9 MB in the beginning and 934.4 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-10-27 06:13:59,380 INFO L168 Benchmark]: Boogie Procedure Inliner took 91.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 934.4 MB in the beginning and 1.2 GB in the end (delta: -222.9 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2018-10-27 06:13:59,380 INFO L168 Benchmark]: Boogie Preprocessor took 24.29 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-10-27 06:13:59,380 INFO L168 Benchmark]: RCFGBuilder took 476.17 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: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. [2018-10-27 06:13:59,380 INFO L168 Benchmark]: BuchiAutomizer took 75081.08 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 330.3 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -178.9 MB). Peak memory consumption was 151.4 MB. Max. memory is 11.5 GB. [2018-10-27 06:13:59,381 INFO L168 Benchmark]: Witness Printer took 3.70 ms. Allocated memory is still 1.5 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:13:59,382 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.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 361.16 ms. Allocated memory is still 1.0 GB. Free memory was 955.9 MB in the beginning and 934.4 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 91.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 934.4 MB in the beginning and 1.2 GB in the end (delta: -222.9 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.29 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 476.17 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: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 75081.08 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 330.3 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -178.9 MB). Peak memory consumption was 151.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.70 ms. Allocated memory is still 1.5 GB. Free memory is still 1.3 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 - 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 12 terminating modules (5 trivial, 4 deterministic, 3 nondeterministic). One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[i][i] and consists of 8 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[j][j] + unknown-#memory_int-unknown[i][i] and consists of 7 locations. One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[i][i] + 1 and consists of 15 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[n][n] + -1 * unknown-#memory_int-unknown[i][i] and consists of 20 locations. One nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[j][j] + -2 * unknown-#memory_int-unknown[i][i] + 3 and consists of 39 locations. One nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[i][i] + -2 * unknown-#memory_int-unknown[j][j] + 1 and consists of 8 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[n][n] + -1 * unknown-#memory_int-unknown[i][i] and consists of 23 locations. 5 modules have a trivial ranking function, the largest among these consists of 39 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 75.0s and 13 iterations. TraceHistogramMax:7. Analysis of lassos took 26.2s. Construction of modules took 4.2s. Büchi inclusion checks took 44.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 10. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 483 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 151 states and ocurred in iteration 8. Nontrivial modules had stage [4, 0, 2, 1, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 33/96 HoareTripleCheckerStatistics: 312 SDtfs, 834 SDslu, 1550 SDs, 0 SdLazy, 4219 SolverSat, 370 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc4 concLT0 SILN0 SILU0 SILI0 SILT0 lasso7 LassoPreprocessingBenchmarks: Lassos: inital1364 mio100 ax104 hnf100 lsp93 ukn58 mio100 lsp39 div100 bol100 ite100 ukn100 eq200 hnf87 smp96 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 3 VariablesLoop: 0 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...