./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_d551851c-dd7a-412a-a664-6b32cbdf8d89/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d551851c-dd7a-412a-a664-6b32cbdf8d89/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d551851c-dd7a-412a-a664-6b32cbdf8d89/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d551851c-dd7a-412a-a664-6b32cbdf8d89/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_d551851c-dd7a-412a-a664-6b32cbdf8d89/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d551851c-dd7a-412a-a664-6b32cbdf8d89/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-11-10 01:49:05,677 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 01:49:05,678 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 01:49:05,684 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 01:49:05,684 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 01:49:05,685 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 01:49:05,686 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 01:49:05,687 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 01:49:05,688 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 01:49:05,688 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 01:49:05,689 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 01:49:05,689 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 01:49:05,690 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 01:49:05,690 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 01:49:05,691 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 01:49:05,691 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 01:49:05,692 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 01:49:05,693 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 01:49:05,694 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 01:49:05,695 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 01:49:05,696 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 01:49:05,697 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 01:49:05,699 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 01:49:05,699 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 01:49:05,699 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 01:49:05,700 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 01:49:05,701 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 01:49:05,701 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 01:49:05,702 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 01:49:05,702 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 01:49:05,702 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 01:49:05,703 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 01:49:05,703 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 01:49:05,703 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 01:49:05,703 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 01:49:05,704 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 01:49:05,704 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d551851c-dd7a-412a-a664-6b32cbdf8d89/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 01:49:05,714 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 01:49:05,715 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 01:49:05,716 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 01:49:05,716 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 01:49:05,716 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 01:49:05,716 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 01:49:05,716 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 01:49:05,716 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 01:49:05,716 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 01:49:05,717 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 01:49:05,717 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 01:49:05,717 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 01:49:05,717 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 01:49:05,717 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 01:49:05,717 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 01:49:05,717 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 01:49:05,717 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 01:49:05,718 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 01:49:05,718 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 01:49:05,718 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 01:49:05,718 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 01:49:05,718 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 01:49:05,718 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 01:49:05,718 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 01:49:05,718 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 01:49:05,719 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 01:49:05,719 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 01:49:05,719 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 01:49:05,720 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_d551851c-dd7a-412a-a664-6b32cbdf8d89/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-11-10 01:49:05,743 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 01:49:05,753 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 01:49:05,755 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 01:49:05,756 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 01:49:05,757 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 01:49:05,757 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d551851c-dd7a-412a-a664-6b32cbdf8d89/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/BrockschmidtCookFuhs-2013CAV-Fig1-alloca_true-termination.c.i [2018-11-10 01:49:05,799 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d551851c-dd7a-412a-a664-6b32cbdf8d89/bin-2019/uautomizer/data/7d4db4dcb/bba6df1ea86e4289a4960ec2e839440f/FLAG127d30846 [2018-11-10 01:49:06,235 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 01:49:06,236 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d551851c-dd7a-412a-a664-6b32cbdf8d89/sv-benchmarks/c/termination-memory-alloca/BrockschmidtCookFuhs-2013CAV-Fig1-alloca_true-termination.c.i [2018-11-10 01:49:06,246 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d551851c-dd7a-412a-a664-6b32cbdf8d89/bin-2019/uautomizer/data/7d4db4dcb/bba6df1ea86e4289a4960ec2e839440f/FLAG127d30846 [2018-11-10 01:49:06,257 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d551851c-dd7a-412a-a664-6b32cbdf8d89/bin-2019/uautomizer/data/7d4db4dcb/bba6df1ea86e4289a4960ec2e839440f [2018-11-10 01:49:06,260 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 01:49:06,261 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 01:49:06,261 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 01:49:06,262 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 01:49:06,264 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 01:49:06,264 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:49:06" (1/1) ... [2018-11-10 01:49:06,266 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9e4a5cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:49:06, skipping insertion in model container [2018-11-10 01:49:06,266 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:49:06" (1/1) ... [2018-11-10 01:49:06,272 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 01:49:06,299 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 01:49:06,472 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 01:49:06,479 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 01:49:06,506 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 01:49:06,530 INFO L193 MainTranslator]: Completed translation [2018-11-10 01:49:06,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:49:06 WrapperNode [2018-11-10 01:49:06,531 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 01:49:06,531 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 01:49:06,531 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 01:49:06,531 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 01:49:06,536 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:49:06" (1/1) ... [2018-11-10 01:49:06,584 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:49:06" (1/1) ... [2018-11-10 01:49:06,598 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 01:49:06,598 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 01:49:06,598 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 01:49:06,599 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 01:49:06,604 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:49:06" (1/1) ... [2018-11-10 01:49:06,604 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:49:06" (1/1) ... [2018-11-10 01:49:06,607 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:49:06" (1/1) ... [2018-11-10 01:49:06,607 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:49:06" (1/1) ... [2018-11-10 01:49:06,610 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:49:06" (1/1) ... [2018-11-10 01:49:06,613 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:49:06" (1/1) ... [2018-11-10 01:49:06,615 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:49:06" (1/1) ... [2018-11-10 01:49:06,617 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 01:49:06,617 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 01:49:06,617 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 01:49:06,617 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 01:49:06,618 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:49:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d551851c-dd7a-412a-a664-6b32cbdf8d89/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:49:06,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 01:49:06,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 01:49:06,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 01:49:06,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 01:49:06,821 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 01:49:06,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:49:06 BoogieIcfgContainer [2018-11-10 01:49:06,822 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 01:49:06,823 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 01:49:06,823 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 01:49:06,825 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 01:49:06,825 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 01:49:06,826 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 01:49:06" (1/3) ... [2018-11-10 01:49:06,826 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@221729ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 01:49:06, skipping insertion in model container [2018-11-10 01:49:06,826 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 01:49:06,826 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:49:06" (2/3) ... [2018-11-10 01:49:06,827 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@221729ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 01:49:06, skipping insertion in model container [2018-11-10 01:49:06,827 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 01:49:06,827 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:49:06" (3/3) ... [2018-11-10 01:49:06,828 INFO L375 chiAutomizerObserver]: Analyzing ICFG BrockschmidtCookFuhs-2013CAV-Fig1-alloca_true-termination.c.i [2018-11-10 01:49:06,862 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 01:49:06,862 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 01:49:06,862 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 01:49:06,862 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 01:49:06,863 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 01:49:06,863 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 01:49:06,863 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 01:49:06,863 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 01:49:06,863 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 01:49:06,872 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-11-10 01:49:06,887 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 01:49:06,887 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 01:49:06,887 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 01:49:06,892 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 01:49:06,892 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:49:06,892 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 01:49:06,892 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-11-10 01:49:06,894 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 01:49:06,894 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 01:49:06,894 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 01:49:06,894 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 01:49:06,894 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:49:06,901 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-11-10 01:49:06,902 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-11-10 01:49:06,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:06,907 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-10 01:49:06,908 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:49:06,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:49:06,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:06,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:49:06,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:06,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:49:06,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:49:06,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:06,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1580478326, now seen corresponding path program 1 times [2018-11-10 01:49:06,986 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:49:06,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:49:06,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:06,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:49:06,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:06,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:49:07,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:49:07,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:49:07,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 01:49:07,017 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 01:49:07,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 01:49:07,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 01:49:07,032 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2018-11-10 01:49:07,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:49:07,036 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-11-10 01:49:07,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 01:49:07,038 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 22 transitions. [2018-11-10 01:49:07,039 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 01:49:07,043 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 18 transitions. [2018-11-10 01:49:07,044 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-10 01:49:07,044 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-10 01:49:07,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 18 transitions. [2018-11-10 01:49:07,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 01:49:07,045 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-11-10 01:49:07,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 18 transitions. [2018-11-10 01:49:07,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-10 01:49:07,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-10 01:49:07,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-11-10 01:49:07,064 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-11-10 01:49:07,064 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-11-10 01:49:07,064 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 01:49:07,065 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 18 transitions. [2018-11-10 01:49:07,065 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 01:49:07,065 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 01:49:07,065 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 01:49:07,066 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 01:49:07,066 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:49:07,066 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-11-10 01:49:07,066 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~mem7;havoc main_#t~mem8; 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-11-10 01:49:07,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:07,067 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-10 01:49:07,067 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:49:07,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:49:07,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:07,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:49:07,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:07,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:49:07,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:49:07,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:07,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1635435721, now seen corresponding path program 1 times [2018-11-10 01:49:07,082 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:49:07,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:49:07,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:07,084 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:49:07,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:07,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:49:07,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:49:07,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:07,112 INFO L82 PathProgramCache]: Analyzing trace with hash -421286919, now seen corresponding path program 1 times [2018-11-10 01:49:07,112 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:49:07,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:49:07,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:07,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:49:07,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:07,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:49:07,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:49:07,400 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 01:49:07,401 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 01:49:07,401 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 01:49:07,401 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 01:49:07,401 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 01:49:07,401 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:49:07,401 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 01:49:07,401 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 01:49:07,402 INFO L131 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-2013CAV-Fig1-alloca_true-termination.c.i_Iteration2_Lasso [2018-11-10 01:49:07,402 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 01:49:07,402 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 01:49:07,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:07,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:07,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:07,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:07,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:07,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:07,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:07,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:07,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:07,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:07,752 WARN L179 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 88 [2018-11-10 01:49:07,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-11-10 01:49:07,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:07,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-11-10 01:49:08,280 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 01:49:08,283 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 01:49:08,284 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:08,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:08,286 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:49:08,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:08,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:08,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:08,287 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:49:08,287 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:49:08,289 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:08,289 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:08,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:08,290 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:49:08,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:08,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:08,290 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:08,290 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:49:08,291 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:49:08,292 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:08,292 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:08,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:08,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:08,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:08,293 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:08,295 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:49:08,295 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:49:08,298 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:08,299 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:08,299 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:08,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:08,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:08,300 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:08,301 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:49:08,303 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:49:08,308 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:08,308 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:08,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:08,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:08,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:08,309 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:08,311 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:49:08,311 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:49:08,315 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:08,315 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:08,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:08,316 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:49:08,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:08,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:08,316 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:08,316 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:49:08,317 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:49:08,319 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:08,320 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:08,320 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:08,320 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:49:08,320 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:08,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:08,320 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:08,321 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:49:08,321 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:49:08,322 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:08,322 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:08,322 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:08,323 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:49:08,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:08,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:08,323 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:08,323 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:49:08,323 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:49:08,324 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:08,324 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:08,325 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:08,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:08,325 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:08,325 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:08,326 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:49:08,326 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:49:08,329 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:08,329 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:08,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:08,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:08,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:08,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:08,332 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:49:08,332 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:49:08,340 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:08,341 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:08,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:08,341 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:49:08,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:08,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:08,342 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:08,342 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:49:08,342 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:49:08,347 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 01:49:08,352 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 01:49:08,352 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 01:49:08,354 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 01:49:08,354 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 01:49:08,354 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 01:49:08,354 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-11-10 01:49:08,415 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2018-11-10 01:49:08,419 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 01:49:08,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:08,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:49:08,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:49:08,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:49:08,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:49:08,485 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-11-10 01:49:08,506 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-11-10 01:49:08,507 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-10 01:49:08,528 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-11-10 01:49:08,528 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:08,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 01:49:08,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 01:49:08,548 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:21, output treesize:32 [2018-11-10 01:49:08,651 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:08,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 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 62 [2018-11-10 01:49:08,674 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:08,682 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:08,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-11-10 01:49:08,685 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:08,716 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:08,716 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-11-10 01:49:08,717 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:08,737 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 01:49:08,751 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-11-10 01:49:08,751 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:50, output treesize:61 [2018-11-10 01:49:08,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:49:08,775 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-11-10 01:49:08,775 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 18 transitions. cyclomatic complexity: 2 Second operand 9 states. [2018-11-10 01:49:09,013 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-11-10 01:49:09,014 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-11-10 01:49:09,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-10 01:49:09,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 17 transitions. [2018-11-10 01:49:09,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 2 letters. Loop has 12 letters. [2018-11-10 01:49:09,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:49:09,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 14 letters. Loop has 12 letters. [2018-11-10 01:49:09,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:49:09,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 2 letters. Loop has 24 letters. [2018-11-10 01:49:09,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:49:09,018 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 49 transitions. [2018-11-10 01:49:09,018 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 01:49:09,019 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 42 states and 45 transitions. [2018-11-10 01:49:09,019 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-10 01:49:09,019 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-10 01:49:09,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 45 transitions. [2018-11-10 01:49:09,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 01:49:09,020 INFO L705 BuchiCegarLoop]: Abstraction has 42 states and 45 transitions. [2018-11-10 01:49:09,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 45 transitions. [2018-11-10 01:49:09,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2018-11-10 01:49:09,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-10 01:49:09,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-11-10 01:49:09,022 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-11-10 01:49:09,022 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-11-10 01:49:09,022 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 01:49:09,022 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 42 transitions. [2018-11-10 01:49:09,023 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 01:49:09,023 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 01:49:09,023 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 01:49:09,023 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:49:09,023 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:49:09,023 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~mem7;havoc main_#t~mem8; 319#L553 [2018-11-10 01:49:09,023 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~mem7;havoc main_#t~mem8; 319#L553 [2018-11-10 01:49:09,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:09,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1648309300, now seen corresponding path program 1 times [2018-11-10 01:49:09,024 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:49:09,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:49:09,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:09,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:49:09,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:09,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:49:09,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:49:09,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:09,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1681647555, now seen corresponding path program 1 times [2018-11-10 01:49:09,045 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:49:09,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:49:09,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:09,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:49:09,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:09,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:49:09,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:49:09,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:09,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1130409576, now seen corresponding path program 1 times [2018-11-10 01:49:09,054 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:49:09,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:49:09,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:09,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:49:09,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:09,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:49:09,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:49:09,242 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 90 [2018-11-10 01:49:09,293 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 01:49:09,293 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 01:49:09,293 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 01:49:09,293 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 01:49:09,293 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 01:49:09,293 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:49:09,293 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 01:49:09,293 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 01:49:09,293 INFO L131 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-2013CAV-Fig1-alloca_true-termination.c.i_Iteration3_Lasso [2018-11-10 01:49:09,293 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 01:49:09,293 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 01:49:09,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:09,469 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 83 [2018-11-10 01:49:09,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:09,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:09,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:09,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:09,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:09,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:09,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:09,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:09,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:09,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:09,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:09,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:09,860 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 01:49:09,860 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 01:49:09,860 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:09,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:09,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:09,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:09,861 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:09,863 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:49:09,863 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:49:09,865 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:09,865 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:09,866 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:09,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:09,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:09,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:09,867 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:49:09,867 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:49:09,869 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:09,869 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:09,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:09,870 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 01:49:09,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:09,870 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:09,871 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 01:49:09,871 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:49:09,876 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:09,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-11-10 01:49:09,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:09,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:09,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:09,890 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:09,893 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:49:09,893 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:49:09,902 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:09,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-11-10 01:49:09,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:09,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:09,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:09,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:09,904 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:49:09,904 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:49:09,912 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 01:49:09,916 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 01:49:09,916 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 01:49:09,917 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 01:49:09,919 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 01:49:09,919 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 01:49:09,919 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-11-10 01:49:09,967 INFO L297 tatePredicateManager]: 19 out of 20 supporting invariants were superfluous and have been removed [2018-11-10 01:49:09,969 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 01:49:09,969 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 01:49:09,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:09,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:49:09,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:49:10,001 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-11-10 01:49:10,002 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:10,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:10,004 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:6 [2018-11-10 01:49:10,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:49:10,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:49:10,032 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:10,034 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-11-10 01:49:10,038 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-11-10 01:49:10,038 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:10,047 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:10,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:10,052 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2018-11-10 01:49:10,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:49:10,091 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-10 01:49:10,091 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 42 transitions. cyclomatic complexity: 5 Second operand 7 states. [2018-11-10 01:49:10,177 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-11-10 01:49:10,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-10 01:49:10,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 01:49:10,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2018-11-10 01:49:10,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 11 letters. Loop has 7 letters. [2018-11-10 01:49:10,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:49:10,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 18 letters. Loop has 7 letters. [2018-11-10 01:49:10,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:49:10,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 11 letters. Loop has 14 letters. [2018-11-10 01:49:10,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:49:10,180 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 62 transitions. [2018-11-10 01:49:10,181 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 01:49:10,181 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 55 states and 60 transitions. [2018-11-10 01:49:10,182 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2018-11-10 01:49:10,182 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-11-10 01:49:10,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 60 transitions. [2018-11-10 01:49:10,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 01:49:10,182 INFO L705 BuchiCegarLoop]: Abstraction has 55 states and 60 transitions. [2018-11-10 01:49:10,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 60 transitions. [2018-11-10 01:49:10,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2018-11-10 01:49:10,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-10 01:49:10,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2018-11-10 01:49:10,186 INFO L728 BuchiCegarLoop]: Abstraction has 53 states and 58 transitions. [2018-11-10 01:49:10,187 INFO L608 BuchiCegarLoop]: Abstraction has 53 states and 58 transitions. [2018-11-10 01:49:10,187 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 01:49:10,187 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 58 transitions. [2018-11-10 01:49:10,187 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 01:49:10,188 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 01:49:10,188 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 01:49:10,188 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:49:10,188 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:49:10,188 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~mem7;havoc main_#t~mem8; 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~mem7;havoc main_#t~mem8; 574#L552-5 [2018-11-10 01:49:10,189 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~mem7;havoc main_#t~mem8; 574#L552-5 [2018-11-10 01:49:10,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:10,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1130409578, now seen corresponding path program 1 times [2018-11-10 01:49:10,189 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:49:10,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:49:10,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:10,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:49:10,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:10,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:49:10,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:49:10,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:10,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1462737419, now seen corresponding path program 2 times [2018-11-10 01:49:10,212 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:49:10,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:49:10,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:10,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:49:10,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:10,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:49:10,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:49:10,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:10,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1688220704, now seen corresponding path program 1 times [2018-11-10 01:49:10,222 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:49:10,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:49:10,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:10,223 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:49:10,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:10,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:49:10,394 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:49:10,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:49:10,394 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d551851c-dd7a-412a-a664-6b32cbdf8d89/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-11-10 01:49:10,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:49:10,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:49:10,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:49:10,470 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-11-10 01:49:10,471 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:10,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:10,473 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2018-11-10 01:49:10,476 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-11-10 01:49:10,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 01:49:10,479 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:10,481 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:10,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:10,484 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-11-10 01:49:10,533 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-11-10 01:49:10,536 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-11-10 01:49:10,537 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:10,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:10,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:10,544 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:12 [2018-11-10 01:49:10,567 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:10,569 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-11-10 01:49:10,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, 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-11-10 01:49:10,575 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:10,579 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:10,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:10,584 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:12 [2018-11-10 01:49:10,589 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-11-10 01:49:10,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 8 treesize of output 7 [2018-11-10 01:49:10,591 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:10,597 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:10,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:10,600 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-11-10 01:49:10,619 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-11-10 01:49:10,621 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-11-10 01:49:10,621 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:10,626 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-11-10 01:49:10,627 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:10,629 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:10,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:10,633 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:33, output treesize:7 [2018-11-10 01:49:10,647 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:49:10,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 01:49:10,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 19 [2018-11-10 01:49:10,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-10 01:49:10,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2018-11-10 01:49:10,734 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. cyclomatic complexity: 8 Second operand 20 states. [2018-11-10 01:49:11,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:49:11,052 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2018-11-10 01:49:11,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-10 01:49:11,052 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 76 transitions. [2018-11-10 01:49:11,053 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2018-11-10 01:49:11,055 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 71 states and 76 transitions. [2018-11-10 01:49:11,055 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2018-11-10 01:49:11,055 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2018-11-10 01:49:11,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 76 transitions. [2018-11-10 01:49:11,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 01:49:11,055 INFO L705 BuchiCegarLoop]: Abstraction has 71 states and 76 transitions. [2018-11-10 01:49:11,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 76 transitions. [2018-11-10 01:49:11,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 57. [2018-11-10 01:49:11,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-10 01:49:11,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2018-11-10 01:49:11,058 INFO L728 BuchiCegarLoop]: Abstraction has 57 states and 62 transitions. [2018-11-10 01:49:11,058 INFO L608 BuchiCegarLoop]: Abstraction has 57 states and 62 transitions. [2018-11-10 01:49:11,058 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 01:49:11,058 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 62 transitions. [2018-11-10 01:49:11,059 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2018-11-10 01:49:11,059 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 01:49:11,059 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 01:49:11,060 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:49:11,060 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:49:11,060 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~mem7;havoc main_#t~mem8; 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~mem7;havoc main_#t~mem8; 830#L552-5 [2018-11-10 01:49:11,060 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~mem7;havoc main_#t~mem8; 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~mem7;havoc main_#t~mem8; 830#L552-5 [2018-11-10 01:49:11,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:11,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1130409578, now seen corresponding path program 2 times [2018-11-10 01:49:11,061 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:49:11,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:49:11,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:11,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:49:11,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:11,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:49:11,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:49:11,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:11,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1111939019, now seen corresponding path program 1 times [2018-11-10 01:49:11,075 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:49:11,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:49:11,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:11,076 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:49:11,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:11,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:49:11,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:49:11,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:11,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1396704128, now seen corresponding path program 2 times [2018-11-10 01:49:11,089 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:49:11,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:49:11,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:11,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:49:11,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:11,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:49:11,300 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:49:11,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:49:11,300 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d551851c-dd7a-412a-a664-6b32cbdf8d89/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-11-10 01:49:11,306 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 01:49:11,323 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 01:49:11,323 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 01:49:11,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:49:11,339 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-11-10 01:49:11,339 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:11,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:11,340 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2018-11-10 01:49:11,346 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-11-10 01:49:11,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 01:49:11,347 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:11,348 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:11,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:11,350 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-11-10 01:49:11,397 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-11-10 01:49:11,399 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-11-10 01:49:11,399 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:11,403 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:11,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:11,406 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:12 [2018-11-10 01:49:11,425 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:11,425 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-11-10 01:49:11,427 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-11-10 01:49:11,428 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:11,430 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:11,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:11,434 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:12 [2018-11-10 01:49:11,438 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-11-10 01:49:11,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 01:49:11,439 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:11,443 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:11,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:11,446 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-11-10 01:49:11,470 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-11-10 01:49:11,473 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-11-10 01:49:11,473 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:11,478 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:11,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:11,482 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:19 [2018-11-10 01:49:11,513 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-11-10 01:49:11,515 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-11-10 01:49:11,515 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:11,520 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-11-10 01:49:11,520 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:11,522 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:11,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:11,525 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:33, output treesize:7 [2018-11-10 01:49:11,538 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 16 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:49:11,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 01:49:11,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 24 [2018-11-10 01:49:11,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-10 01:49:11,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2018-11-10 01:49:11,639 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. cyclomatic complexity: 8 Second operand 25 states. [2018-11-10 01:49:12,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:49:12,001 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2018-11-10 01:49:12,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-10 01:49:12,001 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 83 transitions. [2018-11-10 01:49:12,002 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2018-11-10 01:49:12,003 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 78 states and 83 transitions. [2018-11-10 01:49:12,003 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2018-11-10 01:49:12,003 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2018-11-10 01:49:12,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 83 transitions. [2018-11-10 01:49:12,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 01:49:12,003 INFO L705 BuchiCegarLoop]: Abstraction has 78 states and 83 transitions. [2018-11-10 01:49:12,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 83 transitions. [2018-11-10 01:49:12,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 64. [2018-11-10 01:49:12,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-10 01:49:12,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2018-11-10 01:49:12,006 INFO L728 BuchiCegarLoop]: Abstraction has 64 states and 69 transitions. [2018-11-10 01:49:12,006 INFO L608 BuchiCegarLoop]: Abstraction has 64 states and 69 transitions. [2018-11-10 01:49:12,006 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 01:49:12,006 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 69 transitions. [2018-11-10 01:49:12,007 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2018-11-10 01:49:12,007 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 01:49:12,007 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 01:49:12,007 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:49:12,007 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:49:12,008 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~mem7;havoc main_#t~mem8; 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~mem7;havoc main_#t~mem8; 1127#L552-5 [2018-11-10 01:49:12,008 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~mem7;havoc main_#t~mem8; 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~mem7;havoc main_#t~mem8; 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~mem7;havoc main_#t~mem8; 1127#L552-5 [2018-11-10 01:49:12,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:12,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1130409578, now seen corresponding path program 3 times [2018-11-10 01:49:12,008 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:49:12,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:49:12,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:12,009 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:49:12,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:12,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:49:12,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:49:12,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:12,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1931135285, now seen corresponding path program 2 times [2018-11-10 01:49:12,021 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:49:12,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:49:12,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:12,022 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:49:12,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:12,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:49:12,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:49:12,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:12,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1287649248, now seen corresponding path program 3 times [2018-11-10 01:49:12,037 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:49:12,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:49:12,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:12,039 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:49:12,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:12,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:49:12,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:49:12,248 WARN L179 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 95 [2018-11-10 01:49:12,462 WARN L179 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 110 [2018-11-10 01:49:12,517 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 01:49:12,518 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 01:49:12,518 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 01:49:12,518 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 01:49:12,518 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 01:49:12,518 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:49:12,518 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 01:49:12,518 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 01:49:12,518 INFO L131 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-2013CAV-Fig1-alloca_true-termination.c.i_Iteration6_Lasso [2018-11-10 01:49:12,518 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 01:49:12,518 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 01:49:12,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-11-10 01:49:12,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:12,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:12,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:12,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:12,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:12,723 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 92 [2018-11-10 01:49:12,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:12,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:12,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:12,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:12,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:12,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:12,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:12,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:13,166 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 01:49:13,166 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 01:49:13,166 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:13,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:13,167 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:49:13,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:13,167 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:13,167 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:13,167 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:49:13,168 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:49:13,168 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:13,168 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:13,169 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:13,169 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:49:13,169 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:13,169 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:13,169 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:13,173 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:49:13,174 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:49:13,174 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:13,174 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:13,175 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:13,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:13,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:13,175 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:13,175 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:49:13,176 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:49:13,177 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:13,177 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:13,177 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:13,177 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:13,177 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:13,178 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:13,178 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:49:13,178 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:49:13,180 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:13,180 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:13,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:13,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:13,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:13,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:13,181 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:49:13,181 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:49:13,182 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:13,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:13,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:13,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:13,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:13,183 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:13,184 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:49:13,184 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:49:13,199 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 01:49:13,208 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 01:49:13,208 INFO L444 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-10 01:49:13,208 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 01:49:13,210 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 01:49:13,210 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 01:49:13,210 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-11-10 01:49:13,295 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2018-11-10 01:49:13,295 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 01:49:13,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:13,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:49:13,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:49:13,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:49:13,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:49:13,342 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:13,343 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-11-10 01:49:13,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, 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-11-10 01:49:13,347 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 01:49:13,358 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 01:49:13,371 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-11-10 01:49:13,371 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:17 [2018-11-10 01:49:13,401 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-11-10 01:49:13,404 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-11-10 01:49:13,404 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:13,424 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-11-10 01:49:13,425 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-10 01:49:13,433 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 01:49:13,442 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-11-10 01:49:13,442 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:28, output treesize:46 [2018-11-10 01:49:13,668 WARN L179 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-11-10 01:49:13,912 WARN L179 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-11-10 01:49:13,917 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-11-10 01:49:13,919 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-11-10 01:49:13,920 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:13,925 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:13,947 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-11-10 01:49:13,949 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-11-10 01:49:13,950 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:13,981 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-11-10 01:49:13,982 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2018-11-10 01:49:14,009 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 01:49:14,036 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-11-10 01:49:14,036 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:86, output treesize:107 [2018-11-10 01:49:15,065 WARN L179 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 53 DAG size of output: 31 [2018-11-10 01:49:15,356 WARN L179 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-11-10 01:49:15,368 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-11-10 01:49:15,372 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-11-10 01:49:15,372 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:15,404 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-11-10 01:49:15,405 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-10 01:49:15,430 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 01:49:15,460 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-11-10 01:49:15,463 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-11-10 01:49:15,463 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:15,468 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:15,493 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-11-10 01:49:15,494 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:86, output treesize:105 [2018-11-10 01:49:16,185 WARN L179 SmtUtils]: Spent 678.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 31 [2018-11-10 01:49:16,525 WARN L179 SmtUtils]: Spent 326.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-11-10 01:49:16,919 WARN L179 SmtUtils]: Spent 379.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-11-10 01:49:16,919 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:49:16,920 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-11-10 01:49:16,920 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 69 transitions. cyclomatic complexity: 8 Second operand 11 states. [2018-11-10 01:49:17,959 WARN L179 SmtUtils]: Spent 953.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2018-11-10 01:49:18,960 WARN L179 SmtUtils]: Spent 972.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2018-11-10 01:49:19,838 WARN L179 SmtUtils]: Spent 801.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2018-11-10 01:49:20,695 WARN L179 SmtUtils]: Spent 830.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2018-11-10 01:49:21,535 WARN L179 SmtUtils]: Spent 809.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 41 [2018-11-10 01:49:22,358 WARN L179 SmtUtils]: Spent 798.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2018-11-10 01:49:22,365 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-11-10 01:49:22,365 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-11-10 01:49:22,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-10 01:49:22,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 45 transitions. [2018-11-10 01:49:22,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 45 transitions. Stem has 18 letters. Loop has 26 letters. [2018-11-10 01:49:22,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:49:22,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 45 transitions. Stem has 44 letters. Loop has 26 letters. [2018-11-10 01:49:22,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:49:22,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 45 transitions. Stem has 18 letters. Loop has 52 letters. [2018-11-10 01:49:22,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:49:22,368 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 227 states and 238 transitions. [2018-11-10 01:49:22,369 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2018-11-10 01:49:22,371 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 227 states to 195 states and 206 transitions. [2018-11-10 01:49:22,371 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 89 [2018-11-10 01:49:22,371 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2018-11-10 01:49:22,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 195 states and 206 transitions. [2018-11-10 01:49:22,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 01:49:22,371 INFO L705 BuchiCegarLoop]: Abstraction has 195 states and 206 transitions. [2018-11-10 01:49:22,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states and 206 transitions. [2018-11-10 01:49:22,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 146. [2018-11-10 01:49:22,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-10 01:49:22,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 156 transitions. [2018-11-10 01:49:22,379 INFO L728 BuchiCegarLoop]: Abstraction has 146 states and 156 transitions. [2018-11-10 01:49:22,379 INFO L608 BuchiCegarLoop]: Abstraction has 146 states and 156 transitions. [2018-11-10 01:49:22,379 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 01:49:22,379 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 146 states and 156 transitions. [2018-11-10 01:49:22,380 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2018-11-10 01:49:22,380 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 01:49:22,380 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 01:49:22,381 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-11-10 01:49:22,381 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:49:22,381 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~mem7;havoc main_#t~mem8; 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~mem7;havoc main_#t~mem8; 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~mem7;havoc main_#t~mem8; 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-11-10 01:49:22,381 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~mem7;havoc main_#t~mem8; 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~mem7;havoc main_#t~mem8; 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~mem7;havoc main_#t~mem8; 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-11-10 01:49:22,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:22,382 INFO L82 PathProgramCache]: Analyzing trace with hash -283955877, now seen corresponding path program 4 times [2018-11-10 01:49:22,382 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:49:22,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:49:22,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:22,383 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:49:22,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:22,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:49:22,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:49:22,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:22,401 INFO L82 PathProgramCache]: Analyzing trace with hash -102944501, now seen corresponding path program 3 times [2018-11-10 01:49:22,401 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:49:22,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:49:22,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:22,403 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:49:22,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:22,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:49:22,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:49:22,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:22,420 INFO L82 PathProgramCache]: Analyzing trace with hash -845020699, now seen corresponding path program 5 times [2018-11-10 01:49:22,420 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:49:22,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:49:22,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:22,421 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:49:22,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:22,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:49:22,706 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 56 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:49:22,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:49:22,706 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d551851c-dd7a-412a-a664-6b32cbdf8d89/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-11-10 01:49:22,718 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-10 01:49:22,758 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-11-10 01:49:22,758 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 01:49:22,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:49:22,770 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-11-10 01:49:22,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 01:49:22,773 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:22,778 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:22,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:22,779 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-11-10 01:49:22,815 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-11-10 01:49:22,818 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-11-10 01:49:22,819 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:22,822 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:22,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:22,825 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:7 [2018-11-10 01:49:22,913 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-11-10 01:49:22,916 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:22,917 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:22,919 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-11-10 01:49:22,920 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:22,947 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-11-10 01:49:22,948 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:22,964 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 01:49:22,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 01:49:22,977 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:41, output treesize:50 [2018-11-10 01:49:23,007 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-11-10 01:49:23,011 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-11-10 01:49:23,012 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:23,016 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:23,035 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-11-10 01:49:23,039 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-11-10 01:49:23,039 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:23,046 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:23,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 01:49:23,058 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:72, output treesize:42 [2018-11-10 01:49:23,113 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:23,113 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-11-10 01:49:23,117 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-11-10 01:49:23,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:23,123 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:23,140 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:23,141 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-11-10 01:49:23,147 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-11-10 01:49:23,147 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:23,153 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:23,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 01:49:23,165 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:82, output treesize:42 [2018-11-10 01:49:23,220 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:23,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 42 treesize of output 41 [2018-11-10 01:49:23,224 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:23,224 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-11-10 01:49:23,224 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:23,231 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:23,248 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:23,249 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-11-10 01:49:23,251 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-11-10 01:49:23,252 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:23,257 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:23,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 01:49:23,269 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:82, output treesize:38 [2018-11-10 01:49:23,366 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 58 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:49:23,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 01:49:23,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 17] total 37 [2018-11-10 01:49:23,550 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 93 [2018-11-10 01:49:23,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-10 01:49:23,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1192, Unknown=0, NotChecked=0, Total=1332 [2018-11-10 01:49:23,586 INFO L87 Difference]: Start difference. First operand 146 states and 156 transitions. cyclomatic complexity: 15 Second operand 37 states. [2018-11-10 01:49:24,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:49:24,686 INFO L93 Difference]: Finished difference Result 249 states and 259 transitions. [2018-11-10 01:49:24,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-10 01:49:24,688 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 249 states and 259 transitions. [2018-11-10 01:49:24,689 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2018-11-10 01:49:24,690 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 249 states to 193 states and 202 transitions. [2018-11-10 01:49:24,690 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 82 [2018-11-10 01:49:24,690 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 82 [2018-11-10 01:49:24,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 193 states and 202 transitions. [2018-11-10 01:49:24,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 01:49:24,690 INFO L705 BuchiCegarLoop]: Abstraction has 193 states and 202 transitions. [2018-11-10 01:49:24,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states and 202 transitions. [2018-11-10 01:49:24,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 128. [2018-11-10 01:49:24,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-10 01:49:24,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 135 transitions. [2018-11-10 01:49:24,695 INFO L728 BuchiCegarLoop]: Abstraction has 128 states and 135 transitions. [2018-11-10 01:49:24,695 INFO L608 BuchiCegarLoop]: Abstraction has 128 states and 135 transitions. [2018-11-10 01:49:24,696 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 01:49:24,696 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 128 states and 135 transitions. [2018-11-10 01:49:24,696 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2018-11-10 01:49:24,696 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 01:49:24,696 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 01:49:24,697 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-11-10 01:49:24,697 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:49:24,698 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~mem7;havoc main_#t~mem8; 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~mem7;havoc main_#t~mem8; 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~mem7;havoc main_#t~mem8; 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~mem7;havoc main_#t~mem8; 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-11-10 01:49:24,698 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~mem7;havoc main_#t~mem8; 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~mem7;havoc main_#t~mem8; 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~mem7;havoc main_#t~mem8; 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-11-10 01:49:24,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:24,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1469452839, now seen corresponding path program 6 times [2018-11-10 01:49:24,698 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:49:24,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:49:24,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:24,699 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:49:24,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:24,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:49:24,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:49:24,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:24,717 INFO L82 PathProgramCache]: Analyzing trace with hash -102944501, now seen corresponding path program 4 times [2018-11-10 01:49:24,718 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:49:24,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:49:24,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:24,718 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:49:24,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:24,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:49:24,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:49:24,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:24,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1758904399, now seen corresponding path program 7 times [2018-11-10 01:49:24,730 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:49:24,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:49:24,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:24,731 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:49:24,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:24,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:49:24,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:49:24,929 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 93 [2018-11-10 01:49:25,701 WARN L179 SmtUtils]: Spent 732.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 163 [2018-11-10 01:49:25,812 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2018-11-10 01:49:25,814 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 01:49:25,814 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 01:49:25,814 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 01:49:25,814 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 01:49:25,814 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 01:49:25,814 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:49:25,814 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 01:49:25,814 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 01:49:25,814 INFO L131 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-2013CAV-Fig1-alloca_true-termination.c.i_Iteration8_Lasso [2018-11-10 01:49:25,814 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 01:49:25,814 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 01:49:25,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:25,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:25,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:25,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:25,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:25,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:25,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:25,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:25,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:25,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:26,037 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 95 [2018-11-10 01:49:26,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:26,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:26,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:26,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:26,480 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 01:49:26,480 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 01:49:26,480 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:26,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:26,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:26,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:26,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:26,481 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:49:26,481 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:49:26,482 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:26,482 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:26,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:26,482 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:49:26,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:26,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:26,483 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:26,483 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:49:26,483 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:49:26,483 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:26,483 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:26,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:26,483 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:49:26,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:26,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:26,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:26,484 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:49:26,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:49:26,484 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:26,484 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:26,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:26,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:26,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:26,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:26,485 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:49:26,485 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:49:26,486 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:26,486 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:26,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:26,487 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:49:26,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:26,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:26,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:26,495 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:49:26,495 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:49:26,496 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:26,496 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:26,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:26,496 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:49:26,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:26,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:26,497 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:26,497 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:49:26,497 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:49:26,497 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:26,498 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:26,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:26,498 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:49:26,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:26,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:26,499 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:26,499 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:49:26,499 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:49:26,499 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:26,500 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:26,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:26,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:26,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:26,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:26,501 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:49:26,501 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:49:26,502 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:26,502 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:26,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:26,503 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:49:26,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:26,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:26,503 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:26,503 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:49:26,503 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:49:26,504 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:26,504 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:26,504 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:26,504 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 01:49:26,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:26,505 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:26,506 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 01:49:26,506 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:49:26,509 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:26,509 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:26,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:26,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:26,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:26,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:26,511 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:49:26,511 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:49:26,512 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:26,512 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:26,512 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:26,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:26,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:26,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:26,513 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:49:26,513 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:49:26,515 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:26,515 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:26,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:26,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:26,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:26,516 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:26,517 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:49:26,517 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:49:26,518 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:26,518 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:26,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:26,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:26,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:26,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:26,520 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:49:26,520 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:49:26,521 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:26,521 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:26,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:26,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:26,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:26,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:26,523 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:49:26,523 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:49:26,527 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:26,527 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:26,527 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:26,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:26,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:26,528 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:26,530 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:49:26,530 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:49:26,542 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:26,543 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:26,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:26,543 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 01:49:26,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:26,543 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:26,544 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 01:49:26,544 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:49:26,546 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:26,547 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:26,547 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:26,547 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 01:49:26,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:26,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:26,548 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 01:49:26,548 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:49:26,551 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:26,551 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:26,551 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:26,552 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:26,552 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:26,552 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:26,552 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:49:26,553 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:49:26,556 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:26,557 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:26,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:26,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:26,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:26,558 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:26,558 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:49:26,558 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:49:26,561 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:26,561 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:26,561 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:26,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:26,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:26,562 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:26,563 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:49:26,563 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:49:26,568 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 01:49:26,576 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 01:49:26,576 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 01:49:26,576 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 01:49:26,577 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-10 01:49:26,577 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 01:49:26,577 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-11-10 01:49:26,668 INFO L297 tatePredicateManager]: 24 out of 25 supporting invariants were superfluous and have been removed [2018-11-10 01:49:26,670 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 01:49:26,670 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 01:49:26,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:26,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:49:26,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:49:26,713 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-11-10 01:49:26,713 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:26,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:26,716 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:6 [2018-11-10 01:49:26,725 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-11-10 01:49:26,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-11-10 01:49:26,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:26,729 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:26,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:26,733 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 01:49:26,751 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:26,752 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-11-10 01:49:26,753 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-11-10 01:49:26,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:26,757 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:26,760 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:26,760 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:13 [2018-11-10 01:49:26,807 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-11-10 01:49:26,810 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-11-10 01:49:26,810 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:26,814 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:26,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:26,818 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:13 [2018-11-10 01:49:26,841 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:26,841 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-11-10 01:49:26,843 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-11-10 01:49:26,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:26,846 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:26,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:26,852 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:13 [2018-11-10 01:49:26,867 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-11-10 01:49:26,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 01:49:26,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:26,871 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:26,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:26,875 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-11-10 01:49:26,896 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-11-10 01:49:26,898 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-11-10 01:49:26,899 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:26,904 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:26,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:26,908 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:9 [2018-11-10 01:49:26,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:49:26,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:49:26,953 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-11-10 01:49:26,956 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-11-10 01:49:26,957 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 01:49:26,987 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-11-10 01:49:26,988 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-11-10 01:49:27,023 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-11-10 01:49:27,057 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-11-10 01:49:27,057 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:47, output treesize:159 [2018-11-10 01:49:27,177 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-11-10 01:49:27,181 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-11-10 01:49:27,181 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:27,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:27,231 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-11-10 01:49:27,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 16 treesize of output 13 [2018-11-10 01:49:27,234 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:27,238 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:27,265 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-11-10 01:49:27,269 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-11-10 01:49:27,270 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:27,277 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:27,299 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-11-10 01:49:27,299 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:146, output treesize:86 [2018-11-10 01:49:27,527 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:27,538 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-11-10 01:49:27,543 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-11-10 01:49:27,545 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 01:49:27,596 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:27,597 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:27,599 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:27,601 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-11-10 01:49:27,602 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 01:49:27,649 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-10 01:49:27,694 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-11-10 01:49:27,694 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:65, output treesize:160 [2018-11-10 01:49:27,805 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:49:27,806 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-11-10 01:49:27,806 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 128 states and 135 transitions. cyclomatic complexity: 11 Second operand 24 states. [2018-11-10 01:49:27,891 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-11-10 01:49:27,892 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-11-10 01:49:27,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-10 01:49:27,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2018-11-10 01:49:27,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 40 letters. Loop has 26 letters. [2018-11-10 01:49:27,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:49:27,893 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 01:49:27,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:27,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:49:27,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:49:27,934 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-11-10 01:49:27,934 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:27,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:27,937 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:6 [2018-11-10 01:49:27,946 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-11-10 01:49:27,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 01:49:27,948 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:27,950 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:27,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:27,954 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 01:49:27,977 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:27,978 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-11-10 01:49:27,981 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-11-10 01:49:27,981 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:27,985 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:27,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:27,991 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:13 [2018-11-10 01:49:28,046 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-11-10 01:49:28,048 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-11-10 01:49:28,048 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:28,053 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:28,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:28,058 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:13 [2018-11-10 01:49:28,086 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:28,087 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-11-10 01:49:28,089 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-11-10 01:49:28,090 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:28,093 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:28,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:28,098 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:13 [2018-11-10 01:49:28,115 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-11-10 01:49:28,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 01:49:28,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:28,121 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:28,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:28,125 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-11-10 01:49:28,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, 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-11-10 01:49:28,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, 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-11-10 01:49:28,149 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:28,154 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:28,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:28,161 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:9 [2018-11-10 01:49:28,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:49:28,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:49:28,216 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-11-10 01:49:28,226 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-11-10 01:49:28,227 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 01:49:28,264 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-11-10 01:49:28,266 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-11-10 01:49:28,318 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-11-10 01:49:28,403 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-11-10 01:49:28,403 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:47, output treesize:159 [2018-11-10 01:49:28,534 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:28,536 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 53 treesize of output 56 [2018-11-10 01:49:28,538 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:28,538 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 30 treesize of output 21 [2018-11-10 01:49:28,538 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:28,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:28,574 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:28,574 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 27 treesize of output 32 [2018-11-10 01:49:28,577 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:28,578 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 23 treesize of output 16 [2018-11-10 01:49:28,578 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:28,582 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:28,607 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:28,607 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 56 treesize of output 55 [2018-11-10 01:49:28,610 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:28,612 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 48 treesize of output 47 [2018-11-10 01:49:28,613 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:28,619 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:28,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-10 01:49:28,638 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:137, output treesize:86 [2018-11-10 01:49:28,934 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:28,942 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-11-10 01:49:28,946 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-11-10 01:49:28,946 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 01:49:28,984 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:28,985 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:28,986 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:28,987 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-11-10 01:49:28,988 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 01:49:29,025 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-10 01:49:29,057 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-11-10 01:49:29,057 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:65, output treesize:160 [2018-11-10 01:49:29,158 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:49:29,159 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-11-10 01:49:29,159 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 128 states and 135 transitions. cyclomatic complexity: 11 Second operand 24 states. [2018-11-10 01:49:29,237 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-11-10 01:49:29,238 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-11-10 01:49:29,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-10 01:49:29,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2018-11-10 01:49:29,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 40 letters. Loop has 26 letters. [2018-11-10 01:49:29,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:49:29,239 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 01:49:29,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:29,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:49:29,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:49:29,285 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-11-10 01:49:29,285 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:29,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:29,288 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:6 [2018-11-10 01:49:29,297 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-11-10 01:49:29,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 01:49:29,298 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:29,300 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:29,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:29,303 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 01:49:29,326 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:29,326 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-11-10 01:49:29,328 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-11-10 01:49:29,328 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:29,332 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:29,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:29,336 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:13 [2018-11-10 01:49:29,394 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-11-10 01:49:29,397 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-11-10 01:49:29,397 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:29,401 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:29,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:29,405 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:13 [2018-11-10 01:49:29,435 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:29,436 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-11-10 01:49:29,438 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-11-10 01:49:29,438 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:29,441 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:29,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:29,446 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:13 [2018-11-10 01:49:29,463 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-11-10 01:49:29,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 01:49:29,465 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:29,469 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:29,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:29,474 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-11-10 01:49:29,493 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-11-10 01:49:29,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, 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-11-10 01:49:29,495 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:29,498 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:29,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:29,502 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:9 [2018-11-10 01:49:29,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:49:29,520 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:49:29,543 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-11-10 01:49:29,546 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-11-10 01:49:29,547 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 01:49:29,578 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-11-10 01:49:29,578 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-11-10 01:49:29,614 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-11-10 01:49:29,647 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-11-10 01:49:29,648 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:47, output treesize:159 [2018-11-10 01:49:29,752 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-11-10 01:49:29,754 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-11-10 01:49:29,755 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:29,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:29,787 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-11-10 01:49:29,789 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-11-10 01:49:29,790 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:29,796 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:29,820 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-11-10 01:49:29,823 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-11-10 01:49:29,824 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:29,830 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:29,848 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-11-10 01:49:29,848 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:146, output treesize:86 [2018-11-10 01:49:30,065 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:30,073 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-11-10 01:49:30,076 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:30,078 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:30,079 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-11-10 01:49:30,080 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 01:49:30,120 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:30,120 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-11-10 01:49:30,121 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 01:49:30,155 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-10 01:49:30,190 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-11-10 01:49:30,190 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:65, output treesize:160 [2018-11-10 01:49:30,265 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:49:30,265 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-11-10 01:49:30,265 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 128 states and 135 transitions. cyclomatic complexity: 11 Second operand 24 states. [2018-11-10 01:49:31,807 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-11-10 01:49:31,808 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-11-10 01:49:31,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-10 01:49:31,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 126 transitions. [2018-11-10 01:49:31,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 126 transitions. Stem has 40 letters. Loop has 26 letters. [2018-11-10 01:49:31,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:49:31,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 126 transitions. Stem has 66 letters. Loop has 26 letters. [2018-11-10 01:49:31,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:49:31,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 126 transitions. Stem has 40 letters. Loop has 52 letters. [2018-11-10 01:49:31,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:49:31,811 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 660 states and 694 transitions. [2018-11-10 01:49:31,815 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2018-11-10 01:49:31,816 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 660 states to 407 states and 429 transitions. [2018-11-10 01:49:31,817 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 80 [2018-11-10 01:49:31,817 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 135 [2018-11-10 01:49:31,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 407 states and 429 transitions. [2018-11-10 01:49:31,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 01:49:31,817 INFO L705 BuchiCegarLoop]: Abstraction has 407 states and 429 transitions. [2018-11-10 01:49:31,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states and 429 transitions. [2018-11-10 01:49:31,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 151. [2018-11-10 01:49:31,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-11-10 01:49:31,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 161 transitions. [2018-11-10 01:49:31,825 INFO L728 BuchiCegarLoop]: Abstraction has 151 states and 161 transitions. [2018-11-10 01:49:31,825 INFO L608 BuchiCegarLoop]: Abstraction has 151 states and 161 transitions. [2018-11-10 01:49:31,825 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 01:49:31,826 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 151 states and 161 transitions. [2018-11-10 01:49:31,826 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2018-11-10 01:49:31,826 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 01:49:31,826 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 01:49:31,827 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-11-10 01:49:31,827 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:49:31,829 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~mem7;havoc main_#t~mem8; 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~mem7;havoc main_#t~mem8; 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~mem7;havoc main_#t~mem8; 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-11-10 01:49:31,829 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~mem7;havoc main_#t~mem8; 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-11-10 01:49:31,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:31,829 INFO L82 PathProgramCache]: Analyzing trace with hash -258484156, now seen corresponding path program 8 times [2018-11-10 01:49:31,830 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:49:31,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:49:31,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:31,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:49:31,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:31,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:49:31,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:49:31,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:31,847 INFO L82 PathProgramCache]: Analyzing trace with hash -438809489, now seen corresponding path program 2 times [2018-11-10 01:49:31,847 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:49:31,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:49:31,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:31,848 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:49:31,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:31,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:49:31,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:49:31,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:31,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1691602228, now seen corresponding path program 9 times [2018-11-10 01:49:31,855 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:49:31,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:49:31,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:31,855 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:49:31,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:31,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:49:31,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:49:32,431 WARN L179 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 148 [2018-11-10 01:49:32,534 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2018-11-10 01:49:32,536 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 01:49:32,536 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 01:49:32,536 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 01:49:32,536 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 01:49:32,536 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 01:49:32,536 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:49:32,536 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 01:49:32,536 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 01:49:32,536 INFO L131 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-2013CAV-Fig1-alloca_true-termination.c.i_Iteration9_Lasso [2018-11-10 01:49:32,536 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 01:49:32,537 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 01:49:32,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:32,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:32,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:32,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:32,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:32,731 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 87 [2018-11-10 01:49:32,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-11-10 01:49:32,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:32,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:32,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-11-10 01:49:32,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-11-10 01:49:32,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-11-10 01:49:32,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-11-10 01:49:32,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:32,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:33,071 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 01:49:33,071 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 01:49:33,071 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:33,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:33,072 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:49:33,072 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:33,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:33,072 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:33,072 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:49:33,072 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:49:33,072 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:33,072 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:33,073 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:33,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:33,073 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:33,073 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:33,073 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:49:33,073 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:49:33,074 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:33,074 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:33,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:33,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:33,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:33,077 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:33,078 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:49:33,078 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:49:33,079 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:33,079 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:33,080 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:33,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:33,080 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:33,080 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:33,081 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:49:33,081 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:49:33,081 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:33,082 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:33,082 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:33,082 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:33,082 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:33,082 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:33,083 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:49:33,083 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:49:33,084 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:33,084 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:33,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:33,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:33,085 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:33,085 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:33,086 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:49:33,086 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:49:33,088 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:33,088 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:33,089 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:33,089 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:33,089 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:33,089 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:33,089 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:49:33,090 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:49:33,090 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:33,091 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:33,091 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:33,091 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 01:49:33,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:33,091 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:33,092 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 01:49:33,092 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:49:33,094 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:33,094 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:33,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:33,095 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:33,095 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:33,095 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:33,095 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:49:33,096 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:49:33,099 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:33,099 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:33,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:33,099 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:49:33,099 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:33,100 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:33,100 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:33,100 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:49:33,100 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:49:33,100 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:33,101 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:33,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:33,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:33,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:33,101 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:33,102 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:49:33,102 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:49:33,103 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:33,103 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:33,103 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:33,103 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 01:49:33,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:33,103 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:33,104 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 01:49:33,104 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:49:33,107 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:33,107 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:33,107 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:33,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:33,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:33,108 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:33,108 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:49:33,108 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:49:33,112 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 01:49:33,113 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 01:49:33,113 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 01:49:33,113 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 01:49:33,114 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 01:49:33,114 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 01:49:33,114 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-11-10 01:49:33,223 INFO L297 tatePredicateManager]: 22 out of 23 supporting invariants were superfluous and have been removed [2018-11-10 01:49:33,224 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 01:49:33,225 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 01:49:33,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:33,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:49:33,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:49:33,253 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-11-10 01:49:33,253 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:33,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:33,255 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:6 [2018-11-10 01:49:33,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:49:33,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:49:33,299 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:33,300 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-11-10 01:49:33,302 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-11-10 01:49:33,302 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 01:49:33,308 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 01:49:33,313 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-11-10 01:49:33,314 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:36 [2018-11-10 01:49:33,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:49:33,327 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-11-10 01:49:33,327 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 151 states and 161 transitions. cyclomatic complexity: 14 Second operand 8 states. [2018-11-10 01:49:33,375 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-11-10 01:49:33,376 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-11-10 01:49:33,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 01:49:33,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 18 transitions. [2018-11-10 01:49:33,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 18 transitions. Stem has 34 letters. Loop has 7 letters. [2018-11-10 01:49:33,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:49:33,377 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 01:49:33,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:33,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:49:33,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:49:33,417 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-11-10 01:49:33,418 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:33,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:33,421 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:6 [2018-11-10 01:49:33,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:49:33,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:49:33,481 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:33,482 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-11-10 01:49:33,485 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-11-10 01:49:33,485 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 01:49:33,493 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 01:49:33,499 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-11-10 01:49:33,499 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:36 [2018-11-10 01:49:33,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:49:33,515 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-11-10 01:49:33,515 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 151 states and 161 transitions. cyclomatic complexity: 14 Second operand 8 states. [2018-11-10 01:49:33,567 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-11-10 01:49:33,568 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-11-10 01:49:33,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 01:49:33,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 17 transitions. [2018-11-10 01:49:33,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 17 transitions. Stem has 34 letters. Loop has 7 letters. [2018-11-10 01:49:33,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:49:33,568 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 01:49:33,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:33,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:49:33,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:49:33,601 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-11-10 01:49:33,601 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:33,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:33,604 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:6 [2018-11-10 01:49:33,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:49:33,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:49:33,657 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:33,658 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-11-10 01:49:33,670 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-11-10 01:49:33,670 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 01:49:33,681 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 01:49:33,690 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-11-10 01:49:33,690 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:36 [2018-11-10 01:49:33,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:49:33,706 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-11-10 01:49:33,706 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 151 states and 161 transitions. cyclomatic complexity: 14 Second operand 8 states. [2018-11-10 01:49:33,763 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-11-10 01:49:33,767 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-11-10 01:49:33,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 01:49:33,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2018-11-10 01:49:33,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 29 transitions. Stem has 34 letters. Loop has 7 letters. [2018-11-10 01:49:33,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:49:33,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 29 transitions. Stem has 41 letters. Loop has 7 letters. [2018-11-10 01:49:33,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:49:33,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 29 transitions. Stem has 34 letters. Loop has 14 letters. [2018-11-10 01:49:33,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:49:33,769 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 275 states and 294 transitions. [2018-11-10 01:49:33,770 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 48 [2018-11-10 01:49:33,771 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 275 states to 168 states and 178 transitions. [2018-11-10 01:49:33,771 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-10 01:49:33,771 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-11-10 01:49:33,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 168 states and 178 transitions. [2018-11-10 01:49:33,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 01:49:33,772 INFO L705 BuchiCegarLoop]: Abstraction has 168 states and 178 transitions. [2018-11-10 01:49:33,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states and 178 transitions. [2018-11-10 01:49:33,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 137. [2018-11-10 01:49:33,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-11-10 01:49:33,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 147 transitions. [2018-11-10 01:49:33,775 INFO L728 BuchiCegarLoop]: Abstraction has 137 states and 147 transitions. [2018-11-10 01:49:33,775 INFO L608 BuchiCegarLoop]: Abstraction has 137 states and 147 transitions. [2018-11-10 01:49:33,775 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-10 01:49:33,775 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 137 states and 147 transitions. [2018-11-10 01:49:33,776 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2018-11-10 01:49:33,776 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 01:49:33,776 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 01:49:33,777 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-11-10 01:49:33,777 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:49:33,777 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~mem7;havoc main_#t~mem8; 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~mem7;havoc main_#t~mem8; 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~mem7;havoc main_#t~mem8; 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-11-10 01:49:33,777 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~mem7;havoc main_#t~mem8; 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~mem7;havoc main_#t~mem8; 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~mem7;havoc main_#t~mem8; 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~mem7;havoc main_#t~mem8; 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-11-10 01:49:33,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:33,777 INFO L82 PathProgramCache]: Analyzing trace with hash -258484156, now seen corresponding path program 10 times [2018-11-10 01:49:33,777 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:49:33,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:49:33,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:33,778 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:49:33,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:33,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:49:33,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:49:33,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:33,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1024771483, now seen corresponding path program 5 times [2018-11-10 01:49:33,794 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:49:33,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:49:33,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:33,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:49:33,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:33,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:49:33,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:49:33,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:33,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1308538498, now seen corresponding path program 11 times [2018-11-10 01:49:33,809 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:49:33,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:49:33,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:33,810 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:49:33,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:33,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:49:33,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:49:34,202 WARN L179 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 108 [2018-11-10 01:49:34,904 WARN L179 SmtUtils]: Spent 665.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 148 [2018-11-10 01:49:35,007 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 01:49:35,007 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 01:49:35,007 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 01:49:35,007 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 01:49:35,007 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 01:49:35,007 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:49:35,008 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 01:49:35,008 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 01:49:35,008 INFO L131 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-2013CAV-Fig1-alloca_true-termination.c.i_Iteration10_Lasso [2018-11-10 01:49:35,008 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 01:49:35,008 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 01:49:35,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:35,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:35,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:35,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:35,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:35,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:35,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:35,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:35,301 WARN L179 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 95 [2018-11-10 01:49:35,414 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 81 [2018-11-10 01:49:35,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:35,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:35,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:35,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:35,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:35,769 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 01:49:35,769 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 01:49:35,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-11-10 01:49:35,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:35,770 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:49:35,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:35,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:35,770 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:35,770 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:49:35,770 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:49:35,770 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:35,771 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:35,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:35,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:35,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:35,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:35,771 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:49:35,771 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:49:35,772 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:35,772 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:35,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:35,773 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:49:35,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:35,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:35,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:35,773 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:49:35,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:49:35,773 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:35,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:35,774 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:35,774 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:49:35,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:35,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:35,774 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:35,775 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:49:35,775 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:49:35,775 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:35,775 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:35,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:35,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:35,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:35,776 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:35,776 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:49:35,776 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:49:35,777 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:35,778 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:35,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:35,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:35,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:35,778 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:35,779 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:49:35,779 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:49:35,780 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:35,780 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:35,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:35,780 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:49:35,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:35,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:35,781 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:35,781 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:49:35,781 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:49:35,781 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:35,782 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:35,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:35,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:35,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:35,782 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:35,783 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:49:35,783 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:49:35,785 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:35,785 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:35,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:35,786 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 01:49:35,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:35,786 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:35,787 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 01:49:35,787 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:49:35,789 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:35,790 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:35,790 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:35,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:35,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:35,790 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:35,791 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:49:35,791 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:49:35,794 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:35,795 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:35,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:35,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:35,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:35,795 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:35,796 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:49:35,796 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:49:35,797 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:35,797 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:35,798 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:35,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:35,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:35,798 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:35,800 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:49:35,800 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:49:35,810 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:35,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:35,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:35,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:35,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:35,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:35,811 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:49:35,811 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:49:35,812 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:35,813 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:35,813 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:35,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:35,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:35,813 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:35,814 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:49:35,814 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:49:35,815 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:35,815 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:35,815 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:35,816 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 01:49:35,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:35,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:35,816 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 01:49:35,816 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:49:35,818 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:35,819 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:35,819 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:35,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:35,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:35,819 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:35,820 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:49:35,820 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:49:35,823 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:35,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-11-10 01:49:35,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:35,823 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 01:49:35,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:35,824 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:35,824 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 01:49:35,824 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:49:35,826 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:35,827 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:35,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:35,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:35,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:35,827 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:35,828 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:49:35,828 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:49:35,833 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 01:49:35,836 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 01:49:35,836 INFO L444 ModelExtractionUtils]: 9 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 01:49:35,837 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 01:49:35,837 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 01:49:35,837 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 01:49:35,837 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-11-10 01:49:35,948 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2018-11-10 01:49:35,949 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 01:49:35,949 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 01:49:35,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:35,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:49:35,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:49:35,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:49:35,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:49:36,006 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-11-10 01:49:36,015 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-11-10 01:49:36,016 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-10 01:49:36,072 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-11-10 01:49:36,073 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-10 01:49:36,106 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 24 treesize of output 23 [2018-11-10 01:49:36,106 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:36,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, 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-11-10 01:49:36,143 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 8 xjuncts. [2018-11-10 01:49:36,175 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-10 01:49:36,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-10 01:49:36,197 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:27, output treesize:58 [2018-11-10 01:49:36,237 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-11-10 01:49:36,245 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-11-10 01:49:36,246 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-10 01:49:36,296 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 24 treesize of output 23 [2018-11-10 01:49:36,296 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:36,341 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-11-10 01:49:36,342 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 8 xjuncts. [2018-11-10 01:49:36,392 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-11-10 01:49:36,392 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-10 01:49:36,419 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-10 01:49: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 24 treesize of output 21 [2018-11-10 01:49:36,493 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-11-10 01:49:36,493 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:36,497 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:36,558 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-11-10 01:49:36,559 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-11-10 01:49:36,559 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:36,563 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:36,615 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-11-10 01:49:36,616 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-11-10 01:49:36,616 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:36,620 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:36,665 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-11-10 01:49:36,666 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-11-10 01:49:36,666 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:36,670 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:36,710 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 5 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-10 01:49:36,710 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 10 variables, input treesize:124, output treesize:58 [2018-11-10 01:49:36,843 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-11-10 01:49:36,857 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-11-10 01:49:36,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-11-10 01:49:36,979 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-11-10 01:49:36,980 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-10 01:49:37,074 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-11-10 01:49:37,075 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 9 xjuncts. [2018-11-10 01:49:37,160 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-11-10 01:49:37,161 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:37,203 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-10 01:49:37,313 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-11-10 01:49:37,315 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-11-10 01:49:37,315 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:37,319 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:37,407 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-11-10 01:49:37,409 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-11-10 01:49:37,409 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:37,419 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:37,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, 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-11-10 01:49:37,525 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-11-10 01:49:37,525 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:37,552 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-11-10 01:49:37,552 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:37,571 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 01:49:37,632 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-11-10 01:49:37,635 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-11-10 01:49:37,635 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:37,639 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:37,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 5 dim-2 vars, End of recursive call: and 8 xjuncts. [2018-11-10 01:49:37,693 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 10 variables, input treesize:214, output treesize:188 [2018-11-10 01:49:37,873 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:37,880 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-11-10 01:49:37,882 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:37,883 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:37,884 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-11-10 01:49:37,885 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:37,912 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:37,913 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-11-10 01:49:37,913 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:37,929 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 01:49:37,959 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:37,974 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-11-10 01:49:37,978 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-11-10 01:49:37,978 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:38,068 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:38,075 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-11-10 01:49:38,076 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 3 xjuncts. [2018-11-10 01:49:38,133 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:38,134 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:38,136 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:38,136 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-11-10 01:49:38,137 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:38,171 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:38,173 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:38,176 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:38,184 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-11-10 01:49:38,186 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 3 xjuncts. [2018-11-10 01:49:38,227 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-10 01:49:38,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-11-10 01:49:38,275 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:114, output treesize:166 [2018-11-10 01:49:38,508 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-11-10 01:49:38,512 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-11-10 01:49:38,512 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:38,537 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:38,537 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:38,539 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:38,540 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:38,542 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-11-10 01:49:38,543 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-10 01:49:38,564 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 01:49:38,601 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-11-10 01:49:38,604 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:38,605 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:38,607 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-11-10 01:49:38,607 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-10 01:49:38,637 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-11-10 01:49:38,637 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:38,655 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 01:49:38,685 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-11-10 01:49:38,685 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:111, output treesize:180 [2018-11-10 01:49:38,741 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 01:49:38,741 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-11-10 01:49:38,741 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 137 states and 147 transitions. cyclomatic complexity: 14 Second operand 18 states. [2018-11-10 01:49:39,236 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-11-10 01:49:39,236 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-11-10 01:49:39,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-10 01:49:39,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 35 transitions. [2018-11-10 01:49:39,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 35 transitions. Stem has 34 letters. Loop has 33 letters. [2018-11-10 01:49:39,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:49:39,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 35 transitions. Stem has 67 letters. Loop has 33 letters. [2018-11-10 01:49:39,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:49:39,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 35 transitions. Stem has 34 letters. Loop has 66 letters. [2018-11-10 01:49:39,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:49:39,237 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 331 states and 353 transitions. [2018-11-10 01:49:39,239 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2018-11-10 01:49:39,239 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 331 states to 110 states and 114 transitions. [2018-11-10 01:49:39,239 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-10 01:49:39,239 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-10 01:49:39,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 110 states and 114 transitions. [2018-11-10 01:49:39,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 01:49:39,240 INFO L705 BuchiCegarLoop]: Abstraction has 110 states and 114 transitions. [2018-11-10 01:49:39,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states and 114 transitions. [2018-11-10 01:49:39,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 100. [2018-11-10 01:49:39,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-10 01:49:39,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 104 transitions. [2018-11-10 01:49:39,242 INFO L728 BuchiCegarLoop]: Abstraction has 100 states and 104 transitions. [2018-11-10 01:49:39,242 INFO L608 BuchiCegarLoop]: Abstraction has 100 states and 104 transitions. [2018-11-10 01:49:39,242 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-10 01:49:39,242 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 100 states and 104 transitions. [2018-11-10 01:49:39,242 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2018-11-10 01:49:39,242 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 01:49:39,243 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 01:49:39,244 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-11-10 01:49:39,244 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:49:39,244 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~mem7;havoc main_#t~mem8; 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~mem7;havoc main_#t~mem8; 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~mem7;havoc main_#t~mem8; 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~mem7;havoc main_#t~mem8; 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~mem7;havoc main_#t~mem8; 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~mem7;havoc main_#t~mem8; 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-11-10 01:49:39,244 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~mem7;havoc main_#t~mem8; 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~mem7;havoc main_#t~mem8; 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~mem7;havoc main_#t~mem8; 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~mem7;havoc main_#t~mem8; 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-11-10 01:49:39,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:39,244 INFO L82 PathProgramCache]: Analyzing trace with hash 916805432, now seen corresponding path program 12 times [2018-11-10 01:49:39,244 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:49:39,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:49:39,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:39,245 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:49:39,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:39,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:49:39,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:49:39,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:39,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1024771483, now seen corresponding path program 6 times [2018-11-10 01:49:39,272 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:49:39,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:49:39,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:39,272 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:49:39,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:39,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:49:39,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:49:39,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:39,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1570773490, now seen corresponding path program 13 times [2018-11-10 01:49:39,284 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:49:39,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:49:39,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:39,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:49:39,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:49:39,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:49:39,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:49:39,571 WARN L179 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 108 [2018-11-10 01:49:43,063 WARN L179 SmtUtils]: Spent 3.46 s on a formula simplification. DAG size of input: 240 DAG size of output: 224 [2018-11-10 01:49:43,531 WARN L179 SmtUtils]: Spent 466.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2018-11-10 01:49:43,534 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 01:49:43,534 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 01:49:43,534 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 01:49:43,534 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 01:49:43,535 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 01:49:43,535 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:49:43,535 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 01:49:43,535 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 01:49:43,535 INFO L131 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-2013CAV-Fig1-alloca_true-termination.c.i_Iteration11_Lasso [2018-11-10 01:49:43,535 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 01:49:43,535 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 01:49:43,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:43,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:43,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:43,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:43,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:43,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:43,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:43,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:43,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:43,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:43,884 WARN L179 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 100 [2018-11-10 01:49:43,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:43,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:43,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:43,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:49:44,329 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 01:49:44,329 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 01:49:44,329 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:44,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:44,329 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:49:44,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:44,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:44,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:44,330 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:49:44,330 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:49:44,330 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:44,330 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:44,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:44,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:44,331 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:44,331 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:44,331 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:49:44,331 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:49:44,331 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:44,331 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:44,332 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:44,332 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:44,332 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:44,332 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:44,332 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:49:44,332 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:49:44,333 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:44,333 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:44,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:44,333 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:49:44,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:44,334 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:44,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:44,334 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:49:44,334 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:49:44,334 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:44,334 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:44,334 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:44,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:44,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:44,335 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:44,335 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:49:44,335 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:49:44,336 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:44,336 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:44,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:44,336 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:44,336 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:44,336 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:44,336 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:49:44,337 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:49:44,337 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:44,338 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:44,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:44,338 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:49:44,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:44,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:44,338 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:44,338 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:49:44,338 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:49:44,339 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:44,339 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:44,339 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:44,339 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:49:44,339 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:44,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:44,340 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:44,340 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:49:44,340 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:49:44,340 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:44,340 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:44,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:44,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:44,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:44,341 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:44,341 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:49:44,342 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:49:44,342 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:44,343 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:44,343 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:44,343 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 01:49:44,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:44,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:44,344 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 01:49:44,344 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:49:44,346 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:44,346 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:44,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:44,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:44,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:44,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:44,347 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:49:44,347 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:49:44,348 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:44,349 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:44,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:44,349 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 01:49:44,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:44,349 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:44,350 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 01:49:44,350 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:49:44,352 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:44,352 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:44,353 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:44,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:44,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:44,353 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:44,355 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:49:44,355 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:49:44,364 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:44,364 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:44,365 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:44,365 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:44,365 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:44,365 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:44,366 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:49:44,366 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:49:44,369 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:49:44,369 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:49:44,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:49:44,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:49:44,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:49:44,370 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:49:44,371 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:49:44,371 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:49:44,375 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 01:49:44,382 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-10 01:49:44,382 INFO L444 ModelExtractionUtils]: 4 out of 13 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-10 01:49:44,382 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 01:49:44,383 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 01:49:44,383 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 01:49:44,383 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-11-10 01:49:44,560 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2018-11-10 01:49:44,561 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 01:49:44,561 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 01:49:44,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:44,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:49:44,591 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:49:44,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:49:44,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:49:44,628 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-11-10 01:49:44,648 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-11-10 01:49:44,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 8 xjuncts. [2018-11-10 01:49:44,743 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-11-10 01:49:44,744 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-10 01:49:44,804 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 24 treesize of output 23 [2018-11-10 01:49:44,804 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:44,853 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-11-10 01:49:44,853 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-10 01:49:44,886 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-10 01:49:44,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-10 01:49:44,912 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:27, output treesize:58 [2018-11-10 01:49:44,935 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-11-10 01:49:44,937 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-11-10 01:49:44,937 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:44,947 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:45,007 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-11-10 01:49:45,016 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-11-10 01:49:45,017 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-10 01:49:45,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 2 case distinctions, treesize of input 29 treesize of output 37 [2018-11-10 01:49:45,070 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-10 01:49:45,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, 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-11-10 01:49:45,119 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 8 xjuncts. [2018-11-10 01:49:45,163 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 24 treesize of output 23 [2018-11-10 01:49:45,164 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:45,191 INFO L267 ElimStorePlain]: Start of recursive call 4: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-10 01:49:45,251 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-11-10 01:49:45,252 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-11-10 01:49:45,253 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:45,257 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:45,308 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-11-10 01:49:45,310 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-11-10 01:49:45,310 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:45,314 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:45,359 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-11-10 01:49:45,360 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-11-10 01:49:45,360 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:45,364 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:45,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 5 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-10 01:49:45,404 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 10 variables, input treesize:124, output treesize:58 [2018-11-10 01:49:45,507 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 33 [2018-11-10 01:49:45,510 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 0 case distinctions, treesize of input 23 treesize of output 16 [2018-11-10 01:49:45,510 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:45,515 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:45,612 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-11-10 01:49:45,625 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-11-10 01:49:45,626 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 3 xjuncts. [2018-11-10 01:49:45,742 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-11-10 01:49:45,744 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 9 xjuncts. [2018-11-10 01:49:45,863 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-11-10 01:49:45,864 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 3 xjuncts. [2018-11-10 01:49:45,945 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-11-10 01:49:45,945 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:45,986 INFO L267 ElimStorePlain]: Start of recursive call 4: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-10 01:49:46,071 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-11-10 01:49:46,073 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-11-10 01:49:46,073 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:46,077 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:46,156 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-11-10 01:49:46,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 0 case distinctions, treesize of input 39 treesize of output 34 [2018-11-10 01:49:46,159 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:46,186 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-11-10 01:49:46,187 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:46,205 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 01:49:46,267 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-11-10 01:49:46,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 0 case distinctions, treesize of input 25 treesize of output 20 [2018-11-10 01:49:46,269 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:46,274 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:46,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 5 dim-2 vars, End of recursive call: and 8 xjuncts. [2018-11-10 01:49:46,326 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 10 variables, input treesize:214, output treesize:188 [2018-11-10 01:49:46,508 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:46,523 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-11-10 01:49:46,527 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:46,530 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:46,540 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 57 treesize of output 79 [2018-11-10 01:49:46,542 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-11-10 01:49:46,678 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:46,678 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 57 treesize of output 54 [2018-11-10 01:49:46,679 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:46,767 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:46,774 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-11-10 01:49:46,776 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 3 xjuncts. [2018-11-10 01:49:46,848 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:46,849 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:46,850 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:46,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, 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-11-10 01:49:46,851 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:46,886 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-10 01:49:46,930 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:46,939 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-11-10 01:49:46,942 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:46,943 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:46,944 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-11-10 01:49:46,945 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:46,976 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:46,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 48 treesize of output 47 [2018-11-10 01:49:46,977 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:46,996 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 01:49:47,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-11-10 01:49:47,049 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:114, output treesize:166 [2018-11-10 01:49:47,288 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-11-10 01:49:47,291 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-11-10 01:49:47,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:47,314 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:47,315 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:47,317 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-11-10 01:49:47,318 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-10 01:49:47,339 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 01:49:47,371 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-11-10 01:49:47,376 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-11-10 01:49:47,376 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:47,399 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:47,400 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:47,401 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:47,402 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:47,404 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-11-10 01:49:47,404 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-10 01:49:47,426 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 01:49:47,455 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-11-10 01:49:47,455 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:111, output treesize:180 [2018-11-10 01:49:47,517 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 01:49:47,517 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-11-10 01:49:47,517 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 100 states and 104 transitions. cyclomatic complexity: 7 Second operand 18 states. [2018-11-10 01:49:47,590 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 100 states and 104 transitions. cyclomatic complexity: 7. Second operand 18 states. Result 114 states and 118 transitions. Complement of second has 9 states. [2018-11-10 01:49:47,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-10 01:49:47,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-10 01:49:47,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2018-11-10 01:49:47,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 65 letters. Loop has 33 letters. [2018-11-10 01:49:47,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:49:47,591 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 01:49:47,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:47,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:49:47,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:49:47,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:49:47,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:49:47,649 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:47,667 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-11-10 01:49:47,680 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-11-10 01:49:47,681 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-11-10 01:49:47,764 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:47,780 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-11-10 01:49:47,782 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 9 xjuncts. [2018-11-10 01:49:47,884 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:47,885 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-11-10 01:49:47,885 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:47,948 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:47,956 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-11-10 01:49:47,956 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2018-11-10 01:49:47,992 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-11-10 01:49:48,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-11-10 01:49:48,021 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:34, output treesize:94 [2018-11-10 01:49:48,080 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:48,080 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-11-10 01:49:48,082 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-11-10 01:49:48,082 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:48,086 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:48,182 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:48,183 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-11-10 01:49:48,184 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-11-10 01:49:48,185 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:48,189 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:48,263 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:48,273 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-11-10 01:49:48,286 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-11-10 01:49:48,287 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 3 xjuncts. [2018-11-10 01:49:48,322 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:48,323 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-11-10 01:49:48,323 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:48,336 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 01:49:48,395 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:48,396 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-11-10 01:49:48,397 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-11-10 01:49:48,397 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:48,401 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:48,455 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:48,463 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-11-10 01:49:48,467 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-11-10 01:49:48,467 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:48,489 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:48,499 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-11-10 01:49:48,500 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 3 xjuncts. [2018-11-10 01:49:48,518 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 01:49:48,582 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:48,605 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-11-10 01:49:48,608 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-11-10 01:49:48,608 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:48,629 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:48,636 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-11-10 01:49:48,637 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 3 xjuncts. [2018-11-10 01:49:48,659 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 01:49:48,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-2 vars, End of recursive call: and 8 xjuncts. [2018-11-10 01:49:48,708 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 12 variables, input treesize:214, output treesize:124 [2018-11-10 01:49:48,915 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:48,916 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-11-10 01:49:48,918 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:48,918 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-11-10 01:49:48,918 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:48,923 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:49,015 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:49,024 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-11-10 01:49:49,029 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:49,036 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 58 [2018-11-10 01:49:49,036 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 3 xjuncts. [2018-11-10 01:49:49,068 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:49,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 40 [2018-11-10 01:49:49,069 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:49,082 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 01:49:49,157 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:49,164 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-11-10 01:49:49,168 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:49,175 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 50 [2018-11-10 01:49:49,176 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 3 xjuncts. [2018-11-10 01:49:49,206 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:49,207 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 31 treesize of output 32 [2018-11-10 01:49:49,207 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:49,216 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:49,275 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:49,290 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-11-10 01:49:49,294 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:49,294 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-11-10 01:49:49,294 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:49,356 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:49,364 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-11-10 01:49:49,365 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 3 xjuncts. [2018-11-10 01:49:49,403 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:49,414 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-11-10 01:49:49,414 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 3 xjuncts. [2018-11-10 01:49:49,449 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:49,464 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-11-10 01:49:49,466 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 9 xjuncts. [2018-11-10 01:49:49,516 INFO L267 ElimStorePlain]: Start of recursive call 10: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-10 01:49:49,568 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:49,576 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-11-10 01:49:49,579 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:49,580 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-11-10 01:49:49,580 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:49,601 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:49,610 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-11-10 01:49:49,611 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 3 xjuncts. [2018-11-10 01:49:49,631 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 01:49:49,674 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:49,681 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-11-10 01:49:49,683 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:49,684 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-11-10 01:49:49,684 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:49,703 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:49,705 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-11-10 01:49:49,705 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:49,717 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 01:49:49,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-11-10 01:49:49,747 INFO L202 ElimStorePlain]: Needed 20 recursive calls to eliminate 6 variables, input treesize:256, output treesize:166 [2018-11-10 01:49:49,966 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:49,980 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-11-10 01:49:49,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 65 treesize of output 54 [2018-11-10 01:49:49,985 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:50,075 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:50,076 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:50,077 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:50,077 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-11-10 01:49:50,078 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:50,130 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:50,133 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:50,136 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:50,144 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-11-10 01:49:50,145 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 3 xjuncts. [2018-11-10 01:49:50,205 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:50,212 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-11-10 01:49:50,213 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2018-11-10 01:49:50,257 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-10 01:49:50,304 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:50,311 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-11-10 01:49:50,313 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-11-10 01:49:50,314 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:50,334 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:50,335 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:50,336 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:50,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, 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-11-10 01:49:50,337 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:50,351 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 01:49:50,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-11-10 01:49:50,396 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:114, output treesize:166 [2018-11-10 01:49:50,664 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-11-10 01:49:50,667 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-11-10 01:49:50,667 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:50,691 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:50,694 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:50,696 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-11-10 01:49:50,696 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-10 01:49:50,720 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 01:49:50,753 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-11-10 01:49:50,758 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-11-10 01:49:50,758 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:50,784 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:50,784 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:50,788 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:50,790 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:50,792 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-11-10 01:49:50,792 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-10 01:49:50,817 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 01:49:50,847 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-11-10 01:49:50,847 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:111, output treesize:180 [2018-11-10 01:49:50,905 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 16 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:49:50,906 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-11-10 01:49:50,906 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 100 states and 104 transitions. cyclomatic complexity: 7 Second operand 21 states. [2018-11-10 01:49:50,920 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-11-10 01:49:50,920 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-11-10 01:49:50,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-10 01:49:50,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2018-11-10 01:49:50,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 65 letters. Loop has 33 letters. [2018-11-10 01:49:50,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:49:50,921 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 01:49:50,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:50,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:49:50,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:49:50,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:49:50,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:49:50,998 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:51,018 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-11-10 01:49:51,032 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-11-10 01:49:51,032 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-11-10 01:49:51,116 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:51,123 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-11-10 01:49:51,124 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-10 01:49:51,187 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:51,187 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-11-10 01:49:51,187 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:51,229 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:51,244 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-11-10 01:49:51,246 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 9 xjuncts. [2018-11-10 01:49:51,306 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 8 xjuncts. [2018-11-10 01:49:51,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-11-10 01:49:51,337 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:34, output treesize:94 [2018-11-10 01:49:51,398 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:51,405 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-11-10 01:49:51,409 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-11-10 01:49:51,409 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:51,432 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:51,442 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-11-10 01:49:51,442 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-10 01:49:51,465 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 01:49:51,587 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:51,588 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-11-10 01:49:51,589 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-11-10 01:49:51,589 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:51,593 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:51,672 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:51,679 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-11-10 01:49:51,681 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-11-10 01:49:51,681 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:51,702 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:51,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 36 treesize of output 54 [2018-11-10 01:49:51,709 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 3 xjuncts. [2018-11-10 01:49:51,727 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 01:49:51,803 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:51,812 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-11-10 01:49:51,815 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-11-10 01:49:51,815 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:51,833 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:51,845 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-11-10 01:49:51,846 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 3 xjuncts. [2018-11-10 01:49:51,867 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 01:49:51,935 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:51,935 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-11-10 01:49:51,938 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-11-10 01:49:51,939 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:51,943 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:51,997 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:51,998 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-11-10 01:49:52,000 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-11-10 01:49:52,000 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:52,005 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:52,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-2 vars, End of recursive call: and 8 xjuncts. [2018-11-10 01:49:52,053 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 12 variables, input treesize:214, output treesize:124 [2018-11-10 01:49:52,265 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:52,273 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-11-10 01:49:52,275 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:52,275 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-11-10 01:49:52,276 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:52,294 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:52,295 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-11-10 01:49:52,295 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:52,307 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 01:49:52,400 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:52,409 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-11-10 01:49:52,411 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:52,411 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-11-10 01:49:52,412 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:52,429 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:52,437 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-11-10 01:49:52,437 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 3 xjuncts. [2018-11-10 01:49:52,457 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 01:49:52,540 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:52,547 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-11-10 01:49:52,550 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:52,550 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-11-10 01:49:52,550 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:52,569 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:52,576 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-11-10 01:49:52,577 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 3 xjuncts. [2018-11-10 01:49:52,590 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:52,657 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:52,672 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-11-10 01:49:52,678 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:52,685 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-11-10 01:49:52,686 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 3 xjuncts. [2018-11-10 01:49:52,770 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:52,771 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-11-10 01:49:52,771 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:52,812 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:52,820 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-11-10 01:49:52,821 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 3 xjuncts. [2018-11-10 01:49:52,857 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:52,872 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-11-10 01:49:52,874 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 9 xjuncts. [2018-11-10 01:49:52,919 INFO L267 ElimStorePlain]: Start of recursive call 11: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-10 01:49:52,980 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:52,988 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-11-10 01:49:52,991 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:52,993 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-11-10 01:49:52,993 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:53,013 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:53,023 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-11-10 01:49:53,024 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 3 xjuncts. [2018-11-10 01:49:53,043 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 01:49:53,085 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:53,086 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-11-10 01:49:53,088 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:53,088 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-11-10 01:49:53,088 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:53,093 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:53,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-11-10 01:49:53,122 INFO L202 ElimStorePlain]: Needed 20 recursive calls to eliminate 6 variables, input treesize:256, output treesize:166 [2018-11-10 01:49:53,341 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:53,355 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-11-10 01:49:53,359 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:53,361 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:53,372 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 57 treesize of output 79 [2018-11-10 01:49:53,373 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-11-10 01:49:53,507 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:53,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 57 treesize of output 54 [2018-11-10 01:49:53,508 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:53,597 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:53,605 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-11-10 01:49:53,606 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 3 xjuncts. [2018-11-10 01:49:53,684 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:53,685 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:53,686 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:53,687 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-11-10 01:49:53,687 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:53,723 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-10 01:49:53,767 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:53,774 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-11-10 01:49:53,777 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:53,777 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:53,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 51 treesize of output 58 [2018-11-10 01:49:53,779 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:53,807 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:53,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, 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-11-10 01:49:53,808 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:53,825 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 01:49:53,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-11-10 01:49:53,871 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:114, output treesize:166 [2018-11-10 01:49:54,140 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-11-10 01:49:54,143 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-11-10 01:49:54,144 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:54,167 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:54,167 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:54,169 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-11-10 01:49:54,170 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-10 01:49:54,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 01:49:54,225 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-11-10 01:49:54,228 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:54,229 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:54,230 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:54,231 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:54,233 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-11-10 01:49:54,234 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-10 01:49:54,273 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-11-10 01:49:54,273 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:54,291 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 01:49:54,328 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-11-10 01:49:54,328 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:111, output treesize:180 [2018-11-10 01:49:54,391 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 16 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:49:54,392 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-11-10 01:49:54,392 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 100 states and 104 transitions. cyclomatic complexity: 7 Second operand 21 states. [2018-11-10 01:49:54,772 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 41 [2018-11-10 01:49:54,925 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 44 [2018-11-10 01:49:55,382 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-11-10 01:49:55,382 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-11-10 01:49:55,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-10 01:49:55,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 59 transitions. [2018-11-10 01:49:55,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 59 transitions. Stem has 65 letters. Loop has 33 letters. [2018-11-10 01:49:55,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:49:55,384 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 01:49:55,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:49:55,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:49:55,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:49:55,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:49:55,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:49:55,456 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-11-10 01:49:55,466 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-11-10 01:49:55,466 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-10 01:49:55,546 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-11-10 01:49:55,547 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 8 xjuncts. [2018-11-10 01:49:55,605 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 24 treesize of output 23 [2018-11-10 01:49:55,606 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:55,647 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-11-10 01:49:55,647 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-10 01:49:55,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-10 01:49:55,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-10 01:49:55,696 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:27, output treesize:58 [2018-11-10 01:49:55,718 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-11-10 01:49:55,719 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-11-10 01:49:55,719 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:55,723 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:55,765 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-11-10 01:49:55,766 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-11-10 01:49:55,766 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:55,770 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:55,806 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-11-10 01:49:55,810 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-11-10 01:49:55,811 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:55,815 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:55,868 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-11-10 01:49:55,877 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-11-10 01:49:55,878 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-10 01:49:55,925 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 24 treesize of output 23 [2018-11-10 01:49:55,926 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:55,962 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-11-10 01:49:55,962 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-11-10 01:49:56,000 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-11-10 01:49:56,001 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 8 xjuncts. [2018-11-10 01:49:56,038 INFO L267 ElimStorePlain]: Start of recursive call 8: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-10 01:49:56,089 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-11-10 01:49:56,090 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-11-10 01:49:56,091 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:56,096 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:56,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 5 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-10 01:49:56,142 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 10 variables, input treesize:124, output treesize:58 [2018-11-10 01:49:56,257 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-11-10 01:49:56,260 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-11-10 01:49:56,261 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:56,267 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:56,334 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-11-10 01:49:56,337 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-11-10 01:49:56,337 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:56,343 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:56,417 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-11-10 01:49:56,422 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-11-10 01:49:56,422 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:56,452 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 35 treesize of output 30 [2018-11-10 01:49:56,453 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:56,465 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:56,525 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-11-10 01:49:56,529 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 46 treesize of output 41 [2018-11-10 01:49:56,530 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:56,622 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-11-10 01:49:56,623 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 3 xjuncts. [2018-11-10 01:49:56,698 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-11-10 01:49:56,698 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 3 xjuncts. [2018-11-10 01:49:56,771 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-11-10 01:49:56,773 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 9 xjuncts. [2018-11-10 01:49:56,827 INFO L267 ElimStorePlain]: Start of recursive call 9: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-10 01:49:56,886 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-11-10 01:49:56,888 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-11-10 01:49:56,888 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:56,894 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:49:56,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 5 dim-2 vars, End of recursive call: and 8 xjuncts. [2018-11-10 01:49:56,946 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 10 variables, input treesize:214, output treesize:188 [2018-11-10 01:49:57,129 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:57,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, 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-11-10 01:49:57,140 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:57,141 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:57,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, 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-11-10 01:49:57,143 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:57,171 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:57,171 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-11-10 01:49:57,172 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:57,187 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 01:49:57,217 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:57,231 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-11-10 01:49:57,235 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:57,237 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:57,248 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 57 treesize of output 79 [2018-11-10 01:49:57,249 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2018-11-10 01:49:57,379 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:57,379 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 57 treesize of output 54 [2018-11-10 01:49:57,380 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:57,466 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:57,467 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:57,468 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:57,469 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-11-10 01:49:57,469 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:57,526 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:57,534 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-11-10 01:49:57,535 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 3 xjuncts. [2018-11-10 01:49:57,579 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-10 01:49:57,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-11-10 01:49:57,627 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:114, output treesize:166 [2018-11-10 01:49:57,870 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-11-10 01:49:57,874 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-11-10 01:49:57,874 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:57,899 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:57,900 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:57,901 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:57,902 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:57,904 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-11-10 01:49:57,904 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-10 01:49:57,926 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 01:49:57,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 2 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 61 [2018-11-10 01:49:57,964 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:57,964 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:49:57,966 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-11-10 01:49:57,967 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-10 01:49:57,996 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-11-10 01:49:57,996 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 01:49:58,013 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 01:49:58,043 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-11-10 01:49:58,044 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:111, output treesize:180 [2018-11-10 01:49:58,102 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 01:49:58,103 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 16 loop predicates [2018-11-10 01:49:58,103 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 100 states and 104 transitions. cyclomatic complexity: 7 Second operand 18 states. [2018-11-10 01:49:58,665 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 100 states and 104 transitions. cyclomatic complexity: 7. Second operand 18 states. Result 225 states and 233 transitions. Complement of second has 44 states. [2018-11-10 01:49:58,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 19 states 1 stem states 17 non-accepting loop states 1 accepting loop states [2018-11-10 01:49:58,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-10 01:49:58,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 43 transitions. [2018-11-10 01:49:58,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 43 transitions. Stem has 65 letters. Loop has 33 letters. [2018-11-10 01:49:58,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:49:58,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 43 transitions. Stem has 98 letters. Loop has 33 letters. [2018-11-10 01:49:58,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:49:58,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 43 transitions. Stem has 65 letters. Loop has 66 letters. [2018-11-10 01:49:58,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:49:58,666 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 225 states and 233 transitions. [2018-11-10 01:49:58,667 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 01:49:58,667 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 225 states to 0 states and 0 transitions. [2018-11-10 01:49:58,667 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 01:49:58,667 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 01:49:58,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 01:49:58,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 01:49:58,667 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 01:49:58,667 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 01:49:58,668 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 01:49:58,668 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-10 01:49:58,668 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 01:49:58,668 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 01:49:58,668 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 01:49:58,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 01:49:58 BoogieIcfgContainer [2018-11-10 01:49:58,673 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 01:49:58,674 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 01:49:58,674 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 01:49:58,674 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 01:49:58,675 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:49:06" (3/4) ... [2018-11-10 01:49:58,678 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 01:49:58,678 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 01:49:58,679 INFO L168 Benchmark]: Toolchain (without parser) took 52418.20 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 575.1 MB). Free memory was 956.6 MB in the beginning and 1.3 GB in the end (delta: -364.8 MB). Peak memory consumption was 210.3 MB. Max. memory is 11.5 GB. [2018-11-10 01:49:58,679 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 01:49:58,679 INFO L168 Benchmark]: CACSL2BoogieTranslator took 269.45 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 934.0 MB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. [2018-11-10 01:49:58,679 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -186.9 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2018-11-10 01:49:58,680 INFO L168 Benchmark]: Boogie Preprocessor took 18.59 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 01:49:58,680 INFO L168 Benchmark]: RCFGBuilder took 205.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. [2018-11-10 01:49:58,680 INFO L168 Benchmark]: BuchiAutomizer took 51850.90 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 444.6 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -222.2 MB). Peak memory consumption was 222.4 MB. Max. memory is 11.5 GB. [2018-11-10 01:49:58,680 INFO L168 Benchmark]: Witness Printer took 4.22 ms. Allocated memory is still 1.6 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 01:49:58,681 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 269.45 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 934.0 MB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 67.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -186.9 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.59 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 205.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 51850.90 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 444.6 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -222.2 MB). Peak memory consumption was 222.4 MB. Max. memory is 11.5 GB. * Witness Printer took 4.22 ms. Allocated memory is still 1.6 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 11 terminating modules (4 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 19 locations. 4 modules have a trivial ranking function, the largest among these consists of 37 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 51.8s and 12 iterations. TraceHistogramMax:7. Analysis of lassos took 16.8s. Construction of modules took 1.5s. Büchi inclusion checks took 33.1s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 9. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 444 StatesRemovedByMinimization, 9 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: 34/96 HoareTripleCheckerStatistics: 274 SDtfs, 744 SDslu, 1028 SDs, 0 SdLazy, 2871 SolverSat, 338 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc3 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: 6ms 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...