./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/NoriSharma-2013FSE-Fig7-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_ca29b8b8-a0c5-493a-9ff6-6289945c83fe/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ca29b8b8-a0c5-493a-9ff6-6289945c83fe/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ca29b8b8-a0c5-493a-9ff6-6289945c83fe/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ca29b8b8-a0c5-493a-9ff6-6289945c83fe/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/NoriSharma-2013FSE-Fig7-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_ca29b8b8-a0c5-493a-9ff6-6289945c83fe/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ca29b8b8-a0c5-493a-9ff6-6289945c83fe/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 30b0688e11392273c757e30cbd2949890cabab7f .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 11:12:03,065 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 11:12:03,066 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 11:12:03,074 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 11:12:03,074 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 11:12:03,075 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 11:12:03,076 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 11:12:03,077 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 11:12:03,078 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 11:12:03,079 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 11:12:03,080 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 11:12:03,080 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 11:12:03,081 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 11:12:03,082 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 11:12:03,083 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 11:12:03,083 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 11:12:03,084 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 11:12:03,085 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 11:12:03,087 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 11:12:03,088 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 11:12:03,089 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 11:12:03,090 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 11:12:03,092 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 11:12:03,092 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 11:12:03,092 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 11:12:03,093 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 11:12:03,094 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 11:12:03,094 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 11:12:03,095 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 11:12:03,096 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 11:12:03,096 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 11:12:03,097 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 11:12:03,097 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 11:12:03,097 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 11:12:03,098 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 11:12:03,098 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 11:12:03,099 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ca29b8b8-a0c5-493a-9ff6-6289945c83fe/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 11:12:03,111 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 11:12:03,111 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 11:12:03,112 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 11:12:03,112 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 11:12:03,113 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 11:12:03,113 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 11:12:03,113 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 11:12:03,113 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 11:12:03,113 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 11:12:03,114 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 11:12:03,114 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 11:12:03,114 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 11:12:03,114 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 11:12:03,114 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 11:12:03,114 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 11:12:03,115 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 11:12:03,115 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 11:12:03,115 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 11:12:03,115 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 11:12:03,115 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 11:12:03,115 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 11:12:03,116 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 11:12:03,116 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 11:12:03,116 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 11:12:03,116 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 11:12:03,116 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 11:12:03,116 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 11:12:03,117 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 11:12:03,117 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_ca29b8b8-a0c5-493a-9ff6-6289945c83fe/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 -> 30b0688e11392273c757e30cbd2949890cabab7f [2018-11-10 11:12:03,142 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 11:12:03,151 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 11:12:03,154 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 11:12:03,155 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 11:12:03,155 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 11:12:03,156 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ca29b8b8-a0c5-493a-9ff6-6289945c83fe/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/NoriSharma-2013FSE-Fig7-alloca_true-termination.c.i [2018-11-10 11:12:03,198 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ca29b8b8-a0c5-493a-9ff6-6289945c83fe/bin-2019/uautomizer/data/ad4c2c84f/5fa8a7c2d4b1420ba61b7a72671da5be/FLAGd3ae367b1 [2018-11-10 11:12:03,582 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 11:12:03,582 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ca29b8b8-a0c5-493a-9ff6-6289945c83fe/sv-benchmarks/c/termination-memory-alloca/NoriSharma-2013FSE-Fig7-alloca_true-termination.c.i [2018-11-10 11:12:03,591 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ca29b8b8-a0c5-493a-9ff6-6289945c83fe/bin-2019/uautomizer/data/ad4c2c84f/5fa8a7c2d4b1420ba61b7a72671da5be/FLAGd3ae367b1 [2018-11-10 11:12:03,601 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ca29b8b8-a0c5-493a-9ff6-6289945c83fe/bin-2019/uautomizer/data/ad4c2c84f/5fa8a7c2d4b1420ba61b7a72671da5be [2018-11-10 11:12:03,603 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 11:12:03,604 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 11:12:03,605 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 11:12:03,605 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 11:12:03,608 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 11:12:03,609 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:12:03" (1/1) ... [2018-11-10 11:12:03,611 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60bb045d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:12:03, skipping insertion in model container [2018-11-10 11:12:03,611 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:12:03" (1/1) ... [2018-11-10 11:12:03,620 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 11:12:03,653 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 11:12:03,859 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:12:03,868 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 11:12:03,896 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:12:03,928 INFO L193 MainTranslator]: Completed translation [2018-11-10 11:12:03,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:12:03 WrapperNode [2018-11-10 11:12:03,928 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 11:12:03,929 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 11:12:03,929 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 11:12:03,929 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 11:12:03,981 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:12:03" (1/1) ... [2018-11-10 11:12:03,993 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:12:03" (1/1) ... [2018-11-10 11:12:04,012 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 11:12:04,013 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 11:12:04,013 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 11:12:04,013 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 11:12:04,019 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:12:03" (1/1) ... [2018-11-10 11:12:04,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:12:03" (1/1) ... [2018-11-10 11:12:04,022 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:12:03" (1/1) ... [2018-11-10 11:12:04,022 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:12:03" (1/1) ... [2018-11-10 11:12:04,027 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:12:03" (1/1) ... [2018-11-10 11:12:04,031 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:12:03" (1/1) ... [2018-11-10 11:12:04,033 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:12:03" (1/1) ... [2018-11-10 11:12:04,035 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 11:12:04,036 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 11:12:04,036 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 11:12:04,036 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 11:12:04,037 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:12:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ca29b8b8-a0c5-493a-9ff6-6289945c83fe/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 11:12:04,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 11:12:04,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 11:12:04,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 11:12:04,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 11:12:04,311 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 11:12:04,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:12:04 BoogieIcfgContainer [2018-11-10 11:12:04,311 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 11:12:04,312 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 11:12:04,312 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 11:12:04,314 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 11:12:04,315 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 11:12:04,315 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 11:12:03" (1/3) ... [2018-11-10 11:12:04,315 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@67ec0e4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 11:12:04, skipping insertion in model container [2018-11-10 11:12:04,316 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 11:12:04,316 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:12:03" (2/3) ... [2018-11-10 11:12:04,316 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@67ec0e4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 11:12:04, skipping insertion in model container [2018-11-10 11:12:04,316 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 11:12:04,316 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:12:04" (3/3) ... [2018-11-10 11:12:04,317 INFO L375 chiAutomizerObserver]: Analyzing ICFG NoriSharma-2013FSE-Fig7-alloca_true-termination.c.i [2018-11-10 11:12:04,354 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 11:12:04,355 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 11:12:04,355 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 11:12:04,355 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 11:12:04,355 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 11:12:04,355 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 11:12:04,355 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 11:12:04,355 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 11:12:04,356 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 11:12:04,369 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2018-11-10 11:12:04,390 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2018-11-10 11:12:04,391 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:12:04,391 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:12:04,397 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:12:04,398 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:12:04,398 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 11:12:04,398 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2018-11-10 11:12:04,400 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2018-11-10 11:12:04,400 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:12:04,400 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:12:04,401 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:12:04,401 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:12:04,407 INFO L793 eck$LassoCheckResult]: Stem: 27#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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~mem9, main_#t~mem10, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~mem14, main_#t~short15, main_~a~0.base, main_~a~0.offset, main_~i~0.base, main_~i~0.offset, main_~b~0.base, main_~b~0.offset, main_~j~0.base, main_~j~0.offset, main_~c~0.base, main_~c~0.offset, main_~M~0.base, main_~M~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_~a~0.base, main_~a~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_~i~0.base, main_~i~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_~b~0.base, main_~b~0.offset := main_#t~malloc4.base, main_#t~malloc4.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~malloc5.base, main_#t~malloc5.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~malloc5.base, main_#t~malloc5.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~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~c~0.base, main_~c~0.offset := main_#t~malloc6.base, main_#t~malloc6.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~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~M~0.base, main_~M~0.offset := main_#t~malloc7.base, main_#t~malloc7.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~malloc8.base, main_#t~malloc8.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~malloc8.base, main_#t~malloc8.offset; 25#L554true SUMMARY for call main_#t~mem9 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 13#L554-1true SUMMARY for call write~int(main_#t~mem9, main_~a~0.base, main_~a~0.offset, 4); srcloc: L554-1 14#L554-2true havoc main_#t~mem9; 8#L555true SUMMARY for call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L555 10#L555-1true SUMMARY for call write~int(main_#t~mem10, main_~b~0.base, main_~b~0.offset, 4); srcloc: L555-1 26#L555-2true havoc main_#t~mem10; 23#L556true SUMMARY for call write~int(0, main_~c~0.base, main_~c~0.offset, 4); srcloc: L556 20#L557-10true [2018-11-10 11:12:04,408 INFO L795 eck$LassoCheckResult]: Loop: 20#L557-10true assume true; 4#L557true SUMMARY for call main_#t~mem11 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L557 7#L557-1true SUMMARY for call main_#t~mem12 := read~int(main_~M~0.base, main_~M~0.offset, 4); srcloc: L557-1 9#L557-2true main_#t~short15 := main_#t~mem11 < main_#t~mem12; 11#L557-3true assume main_#t~short15; 32#L557-8true assume !!main_#t~short15;havoc main_#t~mem13;havoc main_#t~mem12;havoc main_#t~short15;havoc main_#t~mem14;havoc main_#t~mem11; 18#L558true SUMMARY for call main_#t~mem16 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L558 21#L558-1true SUMMARY for call write~int(main_#t~mem16 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L558-1 24#L558-2true havoc main_#t~mem16; 17#L559true SUMMARY for call main_#t~mem17 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L559 3#L559-1true SUMMARY for call write~int(main_#t~mem17 + 1, main_~j~0.base, main_~j~0.offset, 4); srcloc: L559-1 5#L559-2true havoc main_#t~mem17; 31#L560true SUMMARY for call main_#t~mem18 := read~int(main_~c~0.base, main_~c~0.offset, 4); srcloc: L560 33#L560-1true SUMMARY for call write~int(main_#t~mem18 + 1, main_~c~0.base, main_~c~0.offset, 4); srcloc: L560-1 19#L560-2true havoc main_#t~mem18; 20#L557-10true [2018-11-10 11:12:04,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:12:04,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1775970851, now seen corresponding path program 1 times [2018-11-10 11:12:04,415 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:12:04,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:12:04,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:12:04,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:12:04,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:12:04,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:12:04,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:12:04,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:12:04,570 INFO L82 PathProgramCache]: Analyzing trace with hash -2140997291, now seen corresponding path program 1 times [2018-11-10 11:12:04,570 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:12:04,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:12:04,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:12:04,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:12:04,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:12:04,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:12:04,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:12:04,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:12:04,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1460795661, now seen corresponding path program 1 times [2018-11-10 11:12:04,599 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:12:04,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:12:04,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:12:04,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:12:04,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:12:04,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:12:04,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:12:04,870 WARN L179 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2018-11-10 11:12:05,607 WARN L179 SmtUtils]: Spent 671.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 157 [2018-11-10 11:12:05,974 WARN L179 SmtUtils]: Spent 363.00 ms on a formula simplification that was a NOOP. DAG size: 147 [2018-11-10 11:12:05,986 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 11:12:05,987 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 11:12:05,987 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 11:12:05,987 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 11:12:05,987 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 11:12:05,988 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:12:05,988 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 11:12:05,988 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 11:12:05,988 INFO L131 ssoRankerPreferences]: Filename of dumped script: NoriSharma-2013FSE-Fig7-alloca_true-termination.c.i_Iteration1_Lasso [2018-11-10 11:12:05,988 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 11:12:05,989 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 11:12:06,011 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 11:12:06,017 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 11:12:06,026 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 11:12:06,039 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 11:12:06,040 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 11:12:06,043 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 11:12:06,045 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 11:12:06,048 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 11:12:06,051 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 11:12:06,058 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 11:12:06,059 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 11:12:06,061 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 11:12:06,063 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 11:12:06,065 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 11:12:06,067 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 11:12:07,138 WARN L179 SmtUtils]: Spent 500.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 161 [2018-11-10 11:12:07,359 WARN L179 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 128 [2018-11-10 11:12:07,359 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 11:12:07,361 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 11:12:07,364 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 11:12:07,365 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 11:12:07,366 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 11:12:07,367 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 11:12:07,369 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 11:12:07,624 WARN L179 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 81 [2018-11-10 11:12:08,194 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 11:12:08,197 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 11:12:08,199 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 11:12:08,200 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:12:08,200 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:12:08,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:12:08,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:12:08,201 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:12:08,202 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:12:08,202 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:12:08,205 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:12:08,205 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 11:12:08,206 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:12:08,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:12:08,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:12:08,206 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:12:08,209 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:12:08,209 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:12:08,215 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:12:08,216 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:12:08,216 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:12:08,216 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:12:08,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:12:08,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:12:08,217 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:12:08,217 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:12:08,217 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:12:08,218 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:12:08,219 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 11:12:08,219 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:12:08,219 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:12:08,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:12:08,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:12:08,220 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:12:08,220 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:12:08,220 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:12:08,221 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:12:08,221 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 11:12:08,222 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:12:08,222 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:12:08,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:12:08,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:12:08,222 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:12:08,223 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:12:08,223 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:12:08,224 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:12:08,224 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:12:08,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:12:08,225 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:12:08,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:12:08,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:12:08,225 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:12:08,225 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:12:08,226 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:12:08,226 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:12:08,227 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 11:12:08,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:12:08,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:12:08,228 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:12:08,228 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:12:08,229 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:12:08,229 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:12:08,232 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:12:08,233 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 11:12:08,233 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:12:08,233 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:12:08,233 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:12:08,233 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:12:08,233 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:12:08,234 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:12:08,234 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:12:08,235 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:12:08,236 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 11:12:08,236 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:12:08,236 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:12:08,236 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:12:08,236 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:12:08,236 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:12:08,237 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:12:08,237 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:12:08,238 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:12:08,238 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:12:08,238 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:12:08,239 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:12:08,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:12:08,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:12:08,239 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:12:08,239 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:12:08,239 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:12:08,240 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:12:08,240 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 11:12:08,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:12:08,241 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:12:08,241 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:12:08,241 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:12:08,241 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:12:08,242 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:12:08,242 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:12:08,242 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:12:08,243 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 11:12:08,243 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:12:08,243 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:12:08,243 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:12:08,243 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:12:08,245 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:12:08,245 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:12:08,248 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:12:08,248 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:12:08,249 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:12:08,249 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:12:08,249 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:12:08,249 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:12:08,250 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:12:08,250 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:12:08,253 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:12:08,253 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 11:12:08,253 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:12:08,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:12:08,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:12:08,254 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:12:08,255 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:12:08,255 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:12:08,257 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:12:08,258 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:12:08,258 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:12:08,258 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:12:08,258 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:12:08,258 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:12:08,259 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:12:08,259 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:12:08,261 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:12:08,261 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:12:08,261 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:12:08,262 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:12:08,262 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:12:08,262 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:12:08,262 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:12:08,263 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:12:08,265 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:12:08,265 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 11:12:08,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:12:08,266 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:12:08,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:12:08,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:12:08,266 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:12:08,266 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:12:08,266 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:12:08,267 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:12:08,267 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 11:12:08,267 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:12:08,267 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:12:08,267 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:12:08,268 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:12:08,268 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:12:08,268 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:12:08,268 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:12:08,270 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 11:12:08,276 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 11:12:08,276 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 11:12:08,278 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 11:12:08,278 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 11:12:08,278 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 11:12:08,279 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~M~0.base) ULTIMATE.start_main_~M~0.offset)_1, 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_~M~0.base) ULTIMATE.start_main_~M~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 11:12:08,687 INFO L297 tatePredicateManager]: 102 out of 104 supporting invariants were superfluous and have been removed [2018-11-10 11:12:08,694 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 11:12:08,695 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 11:12:08,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:12:08,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:12:08,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:12:08,769 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2018-11-10 11:12:08,798 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:08,799 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:08,801 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 39 treesize of output 52 [2018-11-10 11:12:08,828 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:08,829 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:08,831 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:08,831 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:08,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 60 [2018-11-10 11:12:08,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 55 [2018-11-10 11:12:08,884 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:08,885 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:08,886 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:08,887 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:08,887 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:08,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2018-11-10 11:12:08,889 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 11:12:08,897 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:12:08,906 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:12:08,920 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:12:08,929 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:12:08,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:12:08,938 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:47, output treesize:10 [2018-11-10 11:12:08,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:12:08,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:12:09,057 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:09,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 59 [2018-11-10 11:12:09,079 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 11:12:09,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 11:12:09,111 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:09,112 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:09,115 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:09,116 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 37 treesize of output 52 [2018-11-10 11:12:09,117 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 11:12:09,140 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 11:12:09,161 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 11:12:09,162 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:55, output treesize:66 [2018-11-10 11:12:09,280 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:09,282 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 54 treesize of output 61 [2018-11-10 11:12:09,286 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 11:12:09,287 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 11:12:09,300 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:12:09,334 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:09,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 69 [2018-11-10 11:12:09,351 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 53 [2018-11-10 11:12:09,351 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 11:12:09,388 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:09,397 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 43 treesize of output 63 [2018-11-10 11:12:09,399 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2018-11-10 11:12:09,433 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 11:12:09,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-10 11:12:09,501 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:106, output treesize:130 [2018-11-10 11:12:09,560 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:09,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 69 [2018-11-10 11:12:09,576 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 53 [2018-11-10 11:12:09,576 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 11:12:09,608 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:09,616 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 43 treesize of output 63 [2018-11-10 11:12:09,618 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-10 11:12:09,653 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 11:12:09,700 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:09,702 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 54 treesize of output 61 [2018-11-10 11:12:09,705 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 11:12:09,705 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 11:12:09,714 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:12:09,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-10 11:12:09,755 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:106, output treesize:130 [2018-11-10 11:12:09,770 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 11:12:09,781 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 9 loop predicates [2018-11-10 11:12:09,782 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states. Second operand 12 states. [2018-11-10 11:12:09,976 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states.. Second operand 12 states. Result 83 states and 86 transitions. Complement of second has 19 states. [2018-11-10 11:12:09,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 2 stem states 7 non-accepting loop states 1 accepting loop states [2018-11-10 11:12:09,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-10 11:12:09,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 37 transitions. [2018-11-10 11:12:09,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 37 transitions. Stem has 9 letters. Loop has 15 letters. [2018-11-10 11:12:09,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:12:09,980 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 11:12:09,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:12:10,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:12:10,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:12:10,014 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2018-11-10 11:12:10,023 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:10,024 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:10,025 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 39 treesize of output 52 [2018-11-10 11:12:10,050 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:10,051 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:10,052 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:10,053 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:10,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 60 [2018-11-10 11:12:10,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 55 [2018-11-10 11:12:10,088 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:10,090 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:10,091 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:10,091 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:10,092 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:10,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2018-11-10 11:12:10,093 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 11:12:10,102 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:12:10,112 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:12:10,121 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:12:10,130 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:12:10,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:12:10,141 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:47, output treesize:10 [2018-11-10 11:12:10,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:12:10,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:12:10,256 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:10,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 59 [2018-11-10 11:12:10,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, 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 11:12:10,269 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 11:12:10,290 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:10,291 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:10,292 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:10,293 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 37 treesize of output 52 [2018-11-10 11:12:10,294 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 11:12:10,307 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 11:12:10,324 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 11:12:10,324 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:55, output treesize:66 [2018-11-10 11:12:10,393 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:10,395 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 54 treesize of output 61 [2018-11-10 11:12:10,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 11:12:10,398 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 11:12:10,408 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:12:10,441 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:10,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 69 [2018-11-10 11:12:10,465 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 53 [2018-11-10 11:12:10,465 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 11:12:10,504 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:10,515 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 43 treesize of output 63 [2018-11-10 11:12:10,516 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2018-11-10 11:12:10,549 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 11:12:10,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-10 11:12:10,589 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:106, output treesize:130 [2018-11-10 11:12:10,643 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:10,645 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 54 treesize of output 61 [2018-11-10 11:12:10,648 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 11:12:10,648 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 11:12:10,659 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:12:10,685 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:10,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 69 [2018-11-10 11:12:10,712 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 55 treesize of output 67 [2018-11-10 11:12:10,714 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 3 xjuncts. [2018-11-10 11:12:10,798 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:10,799 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 53 [2018-11-10 11:12:10,799 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 11:12:10,839 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 11:12:10,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-10 11:12:10,886 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:106, output treesize:130 [2018-11-10 11:12:10,911 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 11:12:10,911 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 9 loop predicates [2018-11-10 11:12:10,911 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states. Second operand 12 states. [2018-11-10 11:12:11,127 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states.. Second operand 12 states. Result 93 states and 98 transitions. Complement of second has 25 states. [2018-11-10 11:12:11,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 2 stem states 10 non-accepting loop states 1 accepting loop states [2018-11-10 11:12:11,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-10 11:12:11,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 42 transitions. [2018-11-10 11:12:11,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 42 transitions. Stem has 9 letters. Loop has 15 letters. [2018-11-10 11:12:11,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:12:11,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 42 transitions. Stem has 24 letters. Loop has 15 letters. [2018-11-10 11:12:11,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:12:11,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 42 transitions. Stem has 9 letters. Loop has 30 letters. [2018-11-10 11:12:11,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:12:11,130 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 98 transitions. [2018-11-10 11:12:11,133 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2018-11-10 11:12:11,136 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 53 states and 56 transitions. [2018-11-10 11:12:11,137 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2018-11-10 11:12:11,137 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2018-11-10 11:12:11,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 56 transitions. [2018-11-10 11:12:11,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 11:12:11,138 INFO L705 BuchiCegarLoop]: Abstraction has 53 states and 56 transitions. [2018-11-10 11:12:11,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 56 transitions. [2018-11-10 11:12:11,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 47. [2018-11-10 11:12:11,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-10 11:12:11,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2018-11-10 11:12:11,159 INFO L728 BuchiCegarLoop]: Abstraction has 47 states and 50 transitions. [2018-11-10 11:12:11,159 INFO L608 BuchiCegarLoop]: Abstraction has 47 states and 50 transitions. [2018-11-10 11:12:11,159 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 11:12:11,159 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 50 transitions. [2018-11-10 11:12:11,160 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2018-11-10 11:12:11,160 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:12:11,160 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:12:11,161 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:12:11,161 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:12:11,161 INFO L793 eck$LassoCheckResult]: Stem: 912#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 893#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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~mem9, main_#t~mem10, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~mem14, main_#t~short15, main_~a~0.base, main_~a~0.offset, main_~i~0.base, main_~i~0.offset, main_~b~0.base, main_~b~0.offset, main_~j~0.base, main_~j~0.offset, main_~c~0.base, main_~c~0.offset, main_~M~0.base, main_~M~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_~a~0.base, main_~a~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_~i~0.base, main_~i~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_~b~0.base, main_~b~0.offset := main_#t~malloc4.base, main_#t~malloc4.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~malloc5.base, main_#t~malloc5.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~malloc5.base, main_#t~malloc5.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~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~c~0.base, main_~c~0.offset := main_#t~malloc6.base, main_#t~malloc6.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~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~M~0.base, main_~M~0.offset := main_#t~malloc7.base, main_#t~malloc7.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~malloc8.base, main_#t~malloc8.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~malloc8.base, main_#t~malloc8.offset; 894#L554 SUMMARY for call main_#t~mem9 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 895#L554-1 SUMMARY for call write~int(main_#t~mem9, main_~a~0.base, main_~a~0.offset, 4); srcloc: L554-1 896#L554-2 havoc main_#t~mem9; 887#L555 SUMMARY for call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L555 888#L555-1 SUMMARY for call write~int(main_#t~mem10, main_~b~0.base, main_~b~0.offset, 4); srcloc: L555-1 892#L555-2 havoc main_#t~mem10; 910#L556 SUMMARY for call write~int(0, main_~c~0.base, main_~c~0.offset, 4); srcloc: L556 911#L557-10 assume true; 907#L557 SUMMARY for call main_#t~mem11 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L557 919#L557-1 SUMMARY for call main_#t~mem12 := read~int(main_~M~0.base, main_~M~0.offset, 4); srcloc: L557-1 918#L557-2 main_#t~short15 := main_#t~mem11 < main_#t~mem12; 889#L557-3 assume !main_#t~short15; 890#L557-5 [2018-11-10 11:12:11,161 INFO L795 eck$LassoCheckResult]: Loop: 890#L557-5 SUMMARY for call main_#t~mem13 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L557-5 913#L557-6 SUMMARY for call main_#t~mem14 := read~int(main_~N~0.base, main_~N~0.offset, 4); srcloc: L557-6 914#L557-7 main_#t~short15 := main_#t~mem13 < main_#t~mem14; 915#L557-8 assume !!main_#t~short15;havoc main_#t~mem13;havoc main_#t~mem12;havoc main_#t~short15;havoc main_#t~mem14;havoc main_#t~mem11; 899#L558 SUMMARY for call main_#t~mem16 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L558 900#L558-1 SUMMARY for call write~int(main_#t~mem16 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L558-1 908#L558-2 havoc main_#t~mem16; 897#L559 SUMMARY for call main_#t~mem17 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L559 873#L559-1 SUMMARY for call write~int(main_#t~mem17 + 1, main_~j~0.base, main_~j~0.offset, 4); srcloc: L559-1 874#L559-2 havoc main_#t~mem17; 877#L560 SUMMARY for call main_#t~mem18 := read~int(main_~c~0.base, main_~c~0.offset, 4); srcloc: L560 916#L560-1 SUMMARY for call write~int(main_#t~mem18 + 1, main_~c~0.base, main_~c~0.offset, 4); srcloc: L560-1 903#L560-2 havoc main_#t~mem18; 904#L557-10 assume true; 879#L557 SUMMARY for call main_#t~mem11 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L557 880#L557-1 SUMMARY for call main_#t~mem12 := read~int(main_~M~0.base, main_~M~0.offset, 4); srcloc: L557-1 883#L557-2 main_#t~short15 := main_#t~mem11 < main_#t~mem12; 885#L557-3 assume !main_#t~short15; 890#L557-5 [2018-11-10 11:12:11,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:12:11,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1862726928, now seen corresponding path program 1 times [2018-11-10 11:12:11,162 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:12:11,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:12:11,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:12:11,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:12:11,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:12:11,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:12:11,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:12:11,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:12:11,207 INFO L82 PathProgramCache]: Analyzing trace with hash -759940489, now seen corresponding path program 1 times [2018-11-10 11:12:11,208 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:12:11,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:12:11,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:12:11,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:12:11,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:12:11,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:12:11,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:12:11,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:12:11,228 INFO L82 PathProgramCache]: Analyzing trace with hash -389830202, now seen corresponding path program 1 times [2018-11-10 11:12:11,228 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:12:11,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:12:11,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:12:11,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:12:11,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:12:11,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:12:11,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:12:11,581 WARN L179 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 96 [2018-11-10 11:12:12,323 WARN L179 SmtUtils]: Spent 658.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 163 [2018-11-10 11:12:12,623 WARN L179 SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2018-11-10 11:12:12,626 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 11:12:12,627 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 11:12:12,627 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 11:12:12,627 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 11:12:12,627 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 11:12:12,627 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:12:12,627 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 11:12:12,627 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 11:12:12,627 INFO L131 ssoRankerPreferences]: Filename of dumped script: NoriSharma-2013FSE-Fig7-alloca_true-termination.c.i_Iteration2_Lasso [2018-11-10 11:12:12,627 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 11:12:12,627 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 11:12:12,630 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 11:12:12,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:12:12,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:12:12,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:12:12,642 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 11:12:12,644 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 11:12:12,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:12:12,650 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 11:12:12,654 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 11:12:12,656 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 11:12:13,831 WARN L179 SmtUtils]: Spent 613.00 ms on a formula simplification. DAG size of input: 235 DAG size of output: 187 [2018-11-10 11:12:14,160 WARN L179 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 156 [2018-11-10 11:12:14,161 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 11:12:14,162 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 11:12:14,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:12:14,165 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 11:12:14,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:12:14,167 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 11:12:14,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:12:14,476 WARN L179 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 101 [2018-11-10 11:12:14,860 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2018-11-10 11:12:15,126 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 11:12:15,126 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 11:12:15,127 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:12:15,127 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:12:15,127 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:12:15,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:12:15,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:12:15,128 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:12:15,128 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:12:15,128 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:12:15,129 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:12:15,133 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:12:15,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:12:15,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:12:15,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:12:15,134 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:12:15,134 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:12:15,135 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:12:15,136 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:12:15,137 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 11:12:15,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:12:15,137 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:12:15,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:12:15,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:12:15,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:12:15,138 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:12:15,138 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:12:15,138 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:12:15,139 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 11:12:15,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:12:15,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:12:15,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:12:15,139 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:12:15,140 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:12:15,140 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:12:15,142 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:12:15,142 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 11:12:15,143 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:12:15,143 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:12:15,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:12:15,143 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:12:15,144 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:12:15,144 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:12:15,146 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:12:15,146 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:12:15,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:12:15,147 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:12:15,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:12:15,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:12:15,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:12:15,147 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:12:15,148 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:12:15,148 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:12:15,148 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:12:15,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:12:15,149 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:12:15,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:12:15,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:12:15,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:12:15,149 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:12:15,150 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:12:15,150 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:12:15,150 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:12:15,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:12:15,151 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:12:15,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:12:15,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:12:15,151 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:12:15,152 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:12:15,152 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:12:15,152 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:12:15,152 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:12:15,153 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:12:15,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:12:15,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:12:15,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:12:15,154 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:12:15,154 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:12:15,155 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:12:15,156 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:12:15,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:12:15,156 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:12:15,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:12:15,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:12:15,156 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:12:15,157 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:12:15,157 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:12:15,159 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 11:12:15,161 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 11:12:15,161 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 11:12:15,162 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 11:12:15,162 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 11:12:15,162 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 11:12:15,162 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_~N~0.base) ULTIMATE.start_main_~N~0.offset)_1) = -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_~N~0.base) ULTIMATE.start_main_~N~0.offset)_1 Supporting invariants [] [2018-11-10 11:12:15,711 INFO L297 tatePredicateManager]: 122 out of 124 supporting invariants were superfluous and have been removed [2018-11-10 11:12:15,714 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 11:12:15,715 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 11:12:15,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:12:15,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:12:15,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:12:15,749 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 62 [2018-11-10 11:12:15,767 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:15,768 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:15,769 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 59 treesize of output 69 [2018-11-10 11:12:15,789 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:15,790 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:15,791 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:15,792 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:15,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 74 [2018-11-10 11:12:15,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 66 [2018-11-10 11:12:15,830 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:15,833 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:15,836 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:15,837 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:15,838 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:15,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 85 [2018-11-10 11:12:15,885 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:15,886 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:15,889 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:15,892 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:15,893 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:15,894 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:15,895 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:15,897 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:15,898 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:15,899 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:15,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 65 [2018-11-10 11:12:15,901 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 11:12:15,918 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:12:15,935 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:12:15,955 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:12:15,970 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:12:15,987 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:12:16,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:12:16,010 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:70, output treesize:10 [2018-11-10 11:12:16,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:12:16,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:12:16,120 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:16,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 67 [2018-11-10 11:12:16,145 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 53 treesize of output 63 [2018-11-10 11:12:16,146 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-11-10 11:12:16,191 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:16,191 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 46 treesize of output 49 [2018-11-10 11:12:16,192 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 11:12:16,219 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 11:12:16,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 11:12:16,244 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:55, output treesize:108 [2018-11-10 11:12:16,337 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:16,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 67 [2018-11-10 11:12:16,352 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 49 [2018-11-10 11:12:16,353 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 11:12:16,378 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:16,379 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:16,382 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:16,383 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 45 treesize of output 60 [2018-11-10 11:12:16,384 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 11:12:16,403 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 11:12:16,437 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:16,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 55 [2018-11-10 11:12:16,441 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 37 treesize of output 30 [2018-11-10 11:12:16,442 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 11:12:16,450 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:12:16,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 11:12:16,477 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:106, output treesize:96 [2018-11-10 11:12:16,565 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:16,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 69 [2018-11-10 11:12:16,577 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 53 [2018-11-10 11:12:16,578 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 11:12:16,613 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:16,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 63 [2018-11-10 11:12:16,623 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-10 11:12:16,659 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 11:12:16,708 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:16,709 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 54 treesize of output 61 [2018-11-10 11:12:16,712 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 11:12:16,712 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 11:12:16,723 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:12:16,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-10 11:12:16,773 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:106, output treesize:130 [2018-11-10 11:12:16,791 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 11:12:16,792 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 10 loop predicates [2018-11-10 11:12:16,792 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 47 states and 50 transitions. cyclomatic complexity: 5 Second operand 12 states. [2018-11-10 11:12:16,942 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 47 states and 50 transitions. cyclomatic complexity: 5. Second operand 12 states. Result 69 states and 72 transitions. Complement of second has 20 states. [2018-11-10 11:12:16,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 2 stem states 8 non-accepting loop states 1 accepting loop states [2018-11-10 11:12:16,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-10 11:12:16,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 36 transitions. [2018-11-10 11:12:16,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 36 transitions. Stem has 14 letters. Loop has 18 letters. [2018-11-10 11:12:16,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:12:16,944 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 11:12:16,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:12:16,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:12:16,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:12:16,982 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 62 [2018-11-10 11:12:16,995 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:16,997 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:16,998 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 59 treesize of output 69 [2018-11-10 11:12:17,024 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:17,025 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:17,027 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:17,027 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:17,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 74 [2018-11-10 11:12:17,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 66 [2018-11-10 11:12:17,065 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:17,067 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:17,068 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:17,070 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:17,071 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:17,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 85 [2018-11-10 11:12:17,106 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:17,107 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:17,109 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:17,111 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:17,112 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:17,113 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:17,113 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:17,114 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:17,115 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:17,115 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:17,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 65 [2018-11-10 11:12:17,117 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 11:12:17,132 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:12:17,147 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:12:17,160 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:12:17,174 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:12:17,189 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:12:17,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:12:17,205 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:70, output treesize:10 [2018-11-10 11:12:17,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:12:17,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:12:17,300 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:17,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 67 [2018-11-10 11:12:17,316 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 53 [2018-11-10 11:12:17,316 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 11:12:17,344 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:17,352 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 41 treesize of output 59 [2018-11-10 11:12:17,353 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-10 11:12:17,377 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 11:12:17,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 11:12:17,401 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:55, output treesize:108 [2018-11-10 11:12:17,488 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:17,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 55 [2018-11-10 11:12:17,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2018-11-10 11:12:17,495 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 11:12:17,504 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:12:17,525 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:17,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 67 [2018-11-10 11:12:17,537 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 49 [2018-11-10 11:12:17,538 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 11:12:17,569 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:17,570 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:17,571 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:17,572 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 45 treesize of output 60 [2018-11-10 11:12:17,573 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 11:12:17,591 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 11:12:17,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 11:12:17,616 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:106, output treesize:96 [2018-11-10 11:12:17,698 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:17,699 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 54 treesize of output 61 [2018-11-10 11:12:17,701 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 11:12:17,701 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 11:12:17,710 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:12:17,738 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:17,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 69 [2018-11-10 11:12:17,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 53 [2018-11-10 11:12:17,751 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 11:12:17,794 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:17,802 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 43 treesize of output 63 [2018-11-10 11:12:17,803 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2018-11-10 11:12:17,837 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 11:12:17,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-10 11:12:17,876 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:106, output treesize:130 [2018-11-10 11:12:17,899 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 11:12:17,899 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 10 loop predicates [2018-11-10 11:12:17,899 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 47 states and 50 transitions. cyclomatic complexity: 5 Second operand 12 states. [2018-11-10 11:12:18,143 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 47 states and 50 transitions. cyclomatic complexity: 5. Second operand 12 states. Result 89 states and 94 transitions. Complement of second has 22 states. [2018-11-10 11:12:18,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 2 stem states 9 non-accepting loop states 1 accepting loop states [2018-11-10 11:12:18,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-10 11:12:18,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 46 transitions. [2018-11-10 11:12:18,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 46 transitions. Stem has 14 letters. Loop has 18 letters. [2018-11-10 11:12:18,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:12:18,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 46 transitions. Stem has 32 letters. Loop has 18 letters. [2018-11-10 11:12:18,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:12:18,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 46 transitions. Stem has 14 letters. Loop has 36 letters. [2018-11-10 11:12:18,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:12:18,146 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 94 transitions. [2018-11-10 11:12:18,148 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2018-11-10 11:12:18,149 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 86 states and 91 transitions. [2018-11-10 11:12:18,149 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2018-11-10 11:12:18,149 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2018-11-10 11:12:18,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 86 states and 91 transitions. [2018-11-10 11:12:18,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 11:12:18,149 INFO L705 BuchiCegarLoop]: Abstraction has 86 states and 91 transitions. [2018-11-10 11:12:18,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states and 91 transitions. [2018-11-10 11:12:18,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 83. [2018-11-10 11:12:18,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-10 11:12:18,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2018-11-10 11:12:18,157 INFO L728 BuchiCegarLoop]: Abstraction has 83 states and 88 transitions. [2018-11-10 11:12:18,157 INFO L608 BuchiCegarLoop]: Abstraction has 83 states and 88 transitions. [2018-11-10 11:12:18,157 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 11:12:18,157 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 88 transitions. [2018-11-10 11:12:18,158 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2018-11-10 11:12:18,158 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:12:18,159 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:12:18,162 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:12:18,162 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:12:18,162 INFO L793 eck$LassoCheckResult]: Stem: 1908#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1886#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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~mem9, main_#t~mem10, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~mem14, main_#t~short15, main_~a~0.base, main_~a~0.offset, main_~i~0.base, main_~i~0.offset, main_~b~0.base, main_~b~0.offset, main_~j~0.base, main_~j~0.offset, main_~c~0.base, main_~c~0.offset, main_~M~0.base, main_~M~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_~a~0.base, main_~a~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_~i~0.base, main_~i~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_~b~0.base, main_~b~0.offset := main_#t~malloc4.base, main_#t~malloc4.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~malloc5.base, main_#t~malloc5.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~malloc5.base, main_#t~malloc5.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~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~c~0.base, main_~c~0.offset := main_#t~malloc6.base, main_#t~malloc6.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~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~M~0.base, main_~M~0.offset := main_#t~malloc7.base, main_#t~malloc7.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~malloc8.base, main_#t~malloc8.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~malloc8.base, main_#t~malloc8.offset; 1887#L554 SUMMARY for call main_#t~mem9 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L554 1888#L554-1 SUMMARY for call write~int(main_#t~mem9, main_~a~0.base, main_~a~0.offset, 4); srcloc: L554-1 1889#L554-2 havoc main_#t~mem9; 1881#L555 SUMMARY for call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L555 1882#L555-1 SUMMARY for call write~int(main_#t~mem10, main_~b~0.base, main_~b~0.offset, 4); srcloc: L555-1 1885#L555-2 havoc main_#t~mem10; 1906#L556 SUMMARY for call write~int(0, main_~c~0.base, main_~c~0.offset, 4); srcloc: L556 1907#L557-10 assume true; 1901#L557 SUMMARY for call main_#t~mem11 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L557 1928#L557-1 SUMMARY for call main_#t~mem12 := read~int(main_~M~0.base, main_~M~0.offset, 4); srcloc: L557-1 1926#L557-2 main_#t~short15 := main_#t~mem11 < main_#t~mem12; 1924#L557-3 assume !main_#t~short15; 1922#L557-5 SUMMARY for call main_#t~mem13 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L557-5 1913#L557-6 SUMMARY for call main_#t~mem14 := read~int(main_~N~0.base, main_~N~0.offset, 4); srcloc: L557-6 1914#L557-7 main_#t~short15 := main_#t~mem13 < main_#t~mem14; 1949#L557-8 assume !!main_#t~short15;havoc main_#t~mem13;havoc main_#t~mem12;havoc main_#t~short15;havoc main_#t~mem14;havoc main_#t~mem11; 1948#L558 SUMMARY for call main_#t~mem16 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L558 1947#L558-1 SUMMARY for call write~int(main_#t~mem16 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L558-1 1946#L558-2 havoc main_#t~mem16; 1890#L559 SUMMARY for call main_#t~mem17 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L559 1867#L559-1 SUMMARY for call write~int(main_#t~mem17 + 1, main_~j~0.base, main_~j~0.offset, 4); srcloc: L559-1 1868#L559-2 havoc main_#t~mem17; 1871#L560 SUMMARY for call main_#t~mem18 := read~int(main_~c~0.base, main_~c~0.offset, 4); srcloc: L560 1918#L560-1 SUMMARY for call write~int(main_#t~mem18 + 1, main_~c~0.base, main_~c~0.offset, 4); srcloc: L560-1 1942#L560-2 havoc main_#t~mem18; 1900#L557-10 assume true; 1873#L557 SUMMARY for call main_#t~mem11 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L557 1874#L557-1 SUMMARY for call main_#t~mem12 := read~int(main_~M~0.base, main_~M~0.offset, 4); srcloc: L557-1 1877#L557-2 main_#t~short15 := main_#t~mem11 < main_#t~mem12; 1879#L557-3 assume main_#t~short15; 1883#L557-8 [2018-11-10 11:12:18,163 INFO L795 eck$LassoCheckResult]: Loop: 1883#L557-8 assume !!main_#t~short15;havoc main_#t~mem13;havoc main_#t~mem12;havoc main_#t~short15;havoc main_#t~mem14;havoc main_#t~mem11; 1892#L558 SUMMARY for call main_#t~mem16 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L558 1893#L558-1 SUMMARY for call write~int(main_#t~mem16 + 1, main_~i~0.base, main_~i~0.offset, 4); srcloc: L558-1 1902#L558-2 havoc main_#t~mem16; 1904#L559 SUMMARY for call main_#t~mem17 := read~int(main_~j~0.base, main_~j~0.offset, 4); srcloc: L559 1945#L559-1 SUMMARY for call write~int(main_#t~mem17 + 1, main_~j~0.base, main_~j~0.offset, 4); srcloc: L559-1 1944#L559-2 havoc main_#t~mem17; 1943#L560 SUMMARY for call main_#t~mem18 := read~int(main_~c~0.base, main_~c~0.offset, 4); srcloc: L560 1920#L560-1 SUMMARY for call write~int(main_#t~mem18 + 1, main_~c~0.base, main_~c~0.offset, 4); srcloc: L560-1 1896#L560-2 havoc main_#t~mem18; 1897#L557-10 assume true; 1941#L557 SUMMARY for call main_#t~mem11 := read~int(main_~i~0.base, main_~i~0.offset, 4); srcloc: L557 1940#L557-1 SUMMARY for call main_#t~mem12 := read~int(main_~M~0.base, main_~M~0.offset, 4); srcloc: L557-1 1938#L557-2 main_#t~short15 := main_#t~mem11 < main_#t~mem12; 1936#L557-3 assume main_#t~short15; 1883#L557-8 [2018-11-10 11:12:18,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:12:18,163 INFO L82 PathProgramCache]: Analyzing trace with hash -389830204, now seen corresponding path program 1 times [2018-11-10 11:12:18,163 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:12:18,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:12:18,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:12:18,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:12:18,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:12:18,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:12:18,514 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:12:18,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:12:18,516 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ca29b8b8-a0c5-493a-9ff6-6289945c83fe/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 11:12:18,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:12:18,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:12:18,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:12:18,565 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2018-11-10 11:12:18,585 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:18,587 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:18,587 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 63 [2018-11-10 11:12:18,607 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:18,607 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:18,609 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:18,609 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:18,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2018-11-10 11:12:18,635 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:18,635 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:18,636 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:18,637 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:18,637 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:18,639 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:18,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2018-11-10 11:12:18,670 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:18,670 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:18,671 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:18,672 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:18,673 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:18,673 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:18,674 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:18,675 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:18,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2018-11-10 11:12:18,676 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 11:12:18,690 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:12:18,701 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:12:18,713 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:12:18,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:12:18,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:12:18,738 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:63, output treesize:25 [2018-11-10 11:12:18,894 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:12:18,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 37 [2018-11-10 11:12:18,897 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 11:12:18,898 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 11:12:18,902 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:12:18,910 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 11:12:18,910 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:38 [2018-11-10 11:12:18,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 36 [2018-11-10 11:12:18,943 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 11:12:18,943 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 11:12:18,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:12:18,959 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 11:12:18,959 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:51, output treesize:26 [2018-11-10 11:12:18,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 36 [2018-11-10 11:12:18,993 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 11:12:18,993 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 11:12:19,000 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:12:19,008 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 11:12:19,008 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:18 [2018-11-10 11:12:19,058 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 28 treesize of output 24 [2018-11-10 11:12:19,060 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 15 treesize of output 11 [2018-11-10 11:12:19,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 11:12:19,064 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 13 treesize of output 9 [2018-11-10 11:12:19,065 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 11:12:19,066 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:12:19,068 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 11:12:19,068 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:32, output treesize:5 [2018-11-10 11:12:19,093 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:12:19,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 11:12:19,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-10 11:12:19,126 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 11:12:19,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:12:19,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1504384277, now seen corresponding path program 2 times [2018-11-10 11:12:19,126 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:12:19,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:12:19,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:12:19,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:12:19,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:12:19,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:12:19,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:12:19,296 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 77 [2018-11-10 11:12:19,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-10 11:12:19,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=506, Unknown=0, NotChecked=0, Total=600 [2018-11-10 11:12:19,344 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. cyclomatic complexity: 8 Second operand 25 states. [2018-11-10 11:12:19,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:12:19,925 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2018-11-10 11:12:19,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-10 11:12:19,926 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 78 transitions. [2018-11-10 11:12:19,927 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 11:12:19,927 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 0 states and 0 transitions. [2018-11-10 11:12:19,927 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 11:12:19,927 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 11:12:19,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 11:12:19,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 11:12:19,927 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:12:19,927 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:12:19,927 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:12:19,927 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 11:12:19,927 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 11:12:19,928 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 11:12:19,928 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 11:12:19,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 11:12:19 BoogieIcfgContainer [2018-11-10 11:12:19,932 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 11:12:19,932 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 11:12:19,932 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 11:12:19,932 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 11:12:19,933 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:12:04" (3/4) ... [2018-11-10 11:12:19,935 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 11:12:19,935 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 11:12:19,936 INFO L168 Benchmark]: Toolchain (without parser) took 16332.33 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 324.5 MB). Free memory was 957.6 MB in the beginning and 992.7 MB in the end (delta: -35.1 MB). Peak memory consumption was 289.5 MB. Max. memory is 11.5 GB. [2018-11-10 11:12:19,936 INFO L168 Benchmark]: CDTParser took 0.17 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 11:12:19,936 INFO L168 Benchmark]: CACSL2BoogieTranslator took 324.17 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 936.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 11:12:19,936 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 936.2 MB in the beginning and 1.1 GB in the end (delta: -208.0 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. [2018-11-10 11:12:19,937 INFO L168 Benchmark]: Boogie Preprocessor took 22.71 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 11:12:19,937 INFO L168 Benchmark]: RCFGBuilder took 275.80 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: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2018-11-10 11:12:19,937 INFO L168 Benchmark]: BuchiAutomizer took 15620.24 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 174.6 MB). Free memory was 1.1 GB in the beginning and 992.7 MB in the end (delta: 125.3 MB). Peak memory consumption was 299.9 MB. Max. memory is 11.5 GB. [2018-11-10 11:12:19,938 INFO L168 Benchmark]: Witness Printer took 3.00 ms. Allocated memory is still 1.4 GB. Free memory is still 992.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:12:19,939 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.17 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 324.17 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 936.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 83.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 936.2 MB in the beginning and 1.1 GB in the end (delta: -208.0 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.71 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 275.80 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: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 15620.24 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 174.6 MB). Free memory was 1.1 GB in the beginning and 992.7 MB in the end (delta: 125.3 MB). Peak memory consumption was 299.9 MB. Max. memory is 11.5 GB. * Witness Printer took 3.00 ms. Allocated memory is still 1.4 GB. Free memory is still 992.7 MB. 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[M][M] + -1 * unknown-#memory_int-unknown[i][i] and consists of 14 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[j][j] + unknown-#memory_int-unknown[N][N] and consists of 12 locations. 1 modules have a trivial ranking function, the largest among these consists of 25 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 15.5s and 4 iterations. TraceHistogramMax:2. Analysis of lassos took 10.0s. Construction of modules took 0.4s. Büchi inclusion checks took 5.0s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 83 states and ocurred in iteration 2. Nontrivial modules had stage [0, 2, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 96 SDtfs, 323 SDslu, 232 SDs, 0 SdLazy, 576 SolverSat, 72 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital681 mio100 ax102 hnf99 lsp94 ukn64 mio100 lsp39 div100 bol100 ite100 ukn100 eq205 hnf87 smp96 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 3 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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...