./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/lis-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_564e3793-cc27-4c48-b0d5-76f0bde905ba/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_564e3793-cc27-4c48-b0d5-76f0bde905ba/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_564e3793-cc27-4c48-b0d5-76f0bde905ba/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_564e3793-cc27-4c48-b0d5-76f0bde905ba/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/lis-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_564e3793-cc27-4c48-b0d5-76f0bde905ba/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_564e3793-cc27-4c48-b0d5-76f0bde905ba/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 70142fc261543b4951115471830b502e8a88ca6e ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/working_dir_564e3793-cc27-4c48-b0d5-76f0bde905ba/bin-2019/uautomizer/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: OutOfMemoryError: Java heap space --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 12:44:09,347 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 12:44:09,348 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 12:44:09,354 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 12:44:09,355 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 12:44:09,355 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 12:44:09,356 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 12:44:09,357 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 12:44:09,359 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 12:44:09,359 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 12:44:09,360 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 12:44:09,360 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 12:44:09,360 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 12:44:09,361 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 12:44:09,361 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 12:44:09,362 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 12:44:09,362 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 12:44:09,364 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 12:44:09,365 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 12:44:09,366 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 12:44:09,366 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 12:44:09,367 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 12:44:09,368 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 12:44:09,368 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 12:44:09,368 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 12:44:09,369 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 12:44:09,369 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 12:44:09,370 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 12:44:09,370 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 12:44:09,371 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 12:44:09,371 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 12:44:09,371 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 12:44:09,372 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 12:44:09,372 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 12:44:09,372 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 12:44:09,373 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 12:44:09,373 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_564e3793-cc27-4c48-b0d5-76f0bde905ba/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-18 12:44:09,381 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 12:44:09,381 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 12:44:09,382 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 12:44:09,382 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 12:44:09,382 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 12:44:09,382 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 12:44:09,383 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 12:44:09,383 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 12:44:09,383 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 12:44:09,383 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 12:44:09,383 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 12:44:09,383 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 12:44:09,383 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 12:44:09,384 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 12:44:09,384 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 12:44:09,384 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 12:44:09,384 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 12:44:09,384 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 12:44:09,384 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 12:44:09,384 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 12:44:09,384 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 12:44:09,385 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 12:44:09,385 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 12:44:09,385 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 12:44:09,385 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 12:44:09,385 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 12:44:09,385 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 12:44:09,385 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 12:44:09,386 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 12:44:09,386 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_564e3793-cc27-4c48-b0d5-76f0bde905ba/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 -> 70142fc261543b4951115471830b502e8a88ca6e [2018-11-18 12:44:09,409 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 12:44:09,419 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 12:44:09,421 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 12:44:09,422 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 12:44:09,423 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 12:44:09,423 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_564e3793-cc27-4c48-b0d5-76f0bde905ba/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/lis-alloca_true-termination.c.i [2018-11-18 12:44:09,469 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_564e3793-cc27-4c48-b0d5-76f0bde905ba/bin-2019/uautomizer/data/d1027922b/90bd33c6a38d4276a4ab439cf02663e5/FLAG24e8a6e1f [2018-11-18 12:44:09,922 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 12:44:09,922 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_564e3793-cc27-4c48-b0d5-76f0bde905ba/sv-benchmarks/c/termination-memory-alloca/lis-alloca_true-termination.c.i [2018-11-18 12:44:09,933 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_564e3793-cc27-4c48-b0d5-76f0bde905ba/bin-2019/uautomizer/data/d1027922b/90bd33c6a38d4276a4ab439cf02663e5/FLAG24e8a6e1f [2018-11-18 12:44:10,440 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_564e3793-cc27-4c48-b0d5-76f0bde905ba/bin-2019/uautomizer/data/d1027922b/90bd33c6a38d4276a4ab439cf02663e5 [2018-11-18 12:44:10,443 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 12:44:10,443 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 12:44:10,444 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 12:44:10,444 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 12:44:10,447 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 12:44:10,448 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:44:10" (1/1) ... [2018-11-18 12:44:10,450 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3270d41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:44:10, skipping insertion in model container [2018-11-18 12:44:10,450 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:44:10" (1/1) ... [2018-11-18 12:44:10,455 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 12:44:10,483 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 12:44:10,665 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:44:10,672 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 12:44:10,742 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:44:10,765 INFO L195 MainTranslator]: Completed translation [2018-11-18 12:44:10,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:44:10 WrapperNode [2018-11-18 12:44:10,765 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 12:44:10,766 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 12:44:10,766 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 12:44:10,766 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 12:44:10,771 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:44:10" (1/1) ... [2018-11-18 12:44:10,781 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:44:10" (1/1) ... [2018-11-18 12:44:10,796 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 12:44:10,797 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 12:44:10,797 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 12:44:10,797 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 12:44:10,802 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:44:10" (1/1) ... [2018-11-18 12:44:10,802 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:44:10" (1/1) ... [2018-11-18 12:44:10,804 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:44:10" (1/1) ... [2018-11-18 12:44:10,804 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:44:10" (1/1) ... [2018-11-18 12:44:10,808 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:44:10" (1/1) ... [2018-11-18 12:44:10,811 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:44:10" (1/1) ... [2018-11-18 12:44:10,812 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:44:10" (1/1) ... [2018-11-18 12:44:10,813 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 12:44:10,814 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 12:44:10,814 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 12:44:10,814 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 12:44:10,814 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:44:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_564e3793-cc27-4c48-b0d5-76f0bde905ba/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-18 12:44:10,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 12:44:10,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 12:44:10,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 12:44:10,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 12:44:10,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 12:44:10,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 12:44:11,052 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 12:44:11,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:44:11 BoogieIcfgContainer [2018-11-18 12:44:11,052 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 12:44:11,053 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 12:44:11,053 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 12:44:11,055 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 12:44:11,055 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 12:44:11,055 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 12:44:10" (1/3) ... [2018-11-18 12:44:11,056 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4bf030fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 12:44:11, skipping insertion in model container [2018-11-18 12:44:11,056 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 12:44:11,056 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:44:10" (2/3) ... [2018-11-18 12:44:11,057 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4bf030fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 12:44:11, skipping insertion in model container [2018-11-18 12:44:11,057 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 12:44:11,057 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:44:11" (3/3) ... [2018-11-18 12:44:11,058 INFO L375 chiAutomizerObserver]: Analyzing ICFG lis-alloca_true-termination.c.i [2018-11-18 12:44:11,091 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 12:44:11,091 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 12:44:11,091 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 12:44:11,091 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 12:44:11,091 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 12:44:11,091 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 12:44:11,091 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 12:44:11,092 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 12:44:11,092 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 12:44:11,100 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2018-11-18 12:44:11,114 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2018-11-18 12:44:11,115 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:44:11,115 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:44:11,120 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 12:44:11,121 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 12:44:11,121 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 12:44:11,121 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2018-11-18 12:44:11,122 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2018-11-18 12:44:11,123 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:44:11,123 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:44:11,123 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 12:44:11,123 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 12:44:11,130 INFO L794 eck$LassoCheckResult]: Stem: 26#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 23#L565true assume !(main_~array_size~0 < 1); 9#L565-2true call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;assume { :begin_inline_lis } true;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 3#L552-4true [2018-11-18 12:44:11,130 INFO L796 eck$LassoCheckResult]: Loop: 3#L552-4true assume true; 10#L552-1true assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 16#L552-3true lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3#L552-4true [2018-11-18 12:44:11,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:44:11,135 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-11-18 12:44:11,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:44:11,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:44:11,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:11,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:44:11,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:11,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:44:11,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:44:11,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:44:11,221 INFO L82 PathProgramCache]: Analyzing trace with hash 42862, now seen corresponding path program 1 times [2018-11-18 12:44:11,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:44:11,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:44:11,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:11,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:44:11,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:11,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:44:11,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:44:11,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:44:11,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1806814474, now seen corresponding path program 1 times [2018-11-18 12:44:11,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:44:11,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:44:11,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:11,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:44:11,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:11,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:44:11,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:44:11,571 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:44:11,572 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:44:11,572 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:44:11,572 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:44:11,572 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 12:44:11,572 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:44:11,572 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:44:11,572 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:44:11,573 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-termination.c.i_Iteration1_Lasso [2018-11-18 12:44:11,573 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:44:11,573 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:44:11,593 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-18 12:44:11,597 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-18 12:44:11,600 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-18 12:44:11,602 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-18 12:44:11,604 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-18 12:44:11,605 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-18 12:44:11,607 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-18 12:44:11,610 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-18 12:44:11,612 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-18 12:44:11,615 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-18 12:44:11,619 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-18 12:44:11,620 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-18 12:44:11,622 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-18 12:44:11,628 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-18 12:44:11,631 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-18 12:44:11,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:44:11,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-18 12:44:11,640 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-18 12:44:11,641 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-18 12:44:11,643 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-18 12:44:11,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-18 12:44:11,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:44:11,811 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2018-11-18 12:44:11,881 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-18 12:44:11,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:44:11,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:44:12,210 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:44:12,215 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 12:44:12,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-18 12:44:12,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:12,218 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:44:12,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:12,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:12,219 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:12,221 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:44:12,221 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:44:12,223 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:12,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-18 12:44:12,226 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:12,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:12,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:12,227 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:12,229 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:44:12,229 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:44:12,232 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:12,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-18 12:44:12,235 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:12,235 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:44:12,236 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:12,236 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:12,236 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:12,236 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:44:12,236 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:44:12,237 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:12,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-18 12:44:12,238 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:12,238 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:12,238 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:12,239 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:12,240 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:44:12,240 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:44:12,245 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:12,245 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:44:12,245 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:12,246 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:44:12,246 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:12,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:12,247 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:12,248 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:44:12,248 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:44:12,258 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:12,259 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:44:12,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:12,259 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:44:12,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:12,260 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:12,260 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:12,260 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:44:12,260 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:44:12,261 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:12,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-18 12:44:12,262 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:12,262 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:12,262 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:12,262 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:12,263 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:44:12,263 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:44:12,266 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:12,266 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:44:12,267 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:12,267 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:44:12,267 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:12,267 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:12,267 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:12,267 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:44:12,268 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:44:12,268 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:12,269 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:44:12,269 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:12,269 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:44:12,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:12,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:12,270 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:12,270 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:44:12,270 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:44:12,271 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:12,271 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:44:12,271 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:12,271 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:44:12,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:12,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:12,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:12,272 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:44:12,272 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:44:12,273 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:12,273 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:44:12,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:12,274 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:44:12,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:12,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:12,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:12,274 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:44:12,274 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:44:12,275 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:12,275 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:44:12,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:12,276 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:44:12,276 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:12,276 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:12,276 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:12,276 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:44:12,277 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:44:12,277 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:12,277 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:44:12,278 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:12,278 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:12,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:12,278 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:12,280 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:44:12,280 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:44:12,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:12,285 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:44:12,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:12,286 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:44:12,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:12,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:12,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:12,287 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:44:12,287 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:44:12,287 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:12,287 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:44:12,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:12,288 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:44:12,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:12,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:12,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:12,288 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:44:12,288 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:44:12,289 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:12,289 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:44:12,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:12,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:12,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:12,290 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:12,291 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:44:12,291 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:44:12,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:12,293 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:44:12,294 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:12,294 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:44:12,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:12,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:12,294 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:12,295 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:44:12,295 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:44:12,295 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:12,295 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:44:12,296 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:12,296 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:44:12,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:12,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:12,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:12,296 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:44:12,296 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:44:12,297 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:12,297 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:44:12,297 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:12,297 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:44:12,297 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:12,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:12,297 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:12,298 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:44:12,298 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:44:12,298 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:12,298 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:44:12,299 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:12,299 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:44:12,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:12,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:12,299 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:12,299 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:44:12,299 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:44:12,300 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:12,300 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:44:12,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:12,300 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:44:12,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:12,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:12,300 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:12,301 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:44:12,301 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:44:12,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:12,301 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:44:12,301 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:12,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:12,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:12,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:12,302 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:44:12,302 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:44:12,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:12,305 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:44:12,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:12,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:12,306 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:12,306 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:12,313 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:44:12,314 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:44:12,371 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 12:44:12,405 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-18 12:44:12,405 INFO L444 ModelExtractionUtils]: 36 out of 43 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-18 12:44:12,407 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 12:44:12,409 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 12:44:12,409 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 12:44:12,409 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_lis_~best~0.base)_1, ULTIMATE.start_lis_~best~0.offset, ULTIMATE.start_lis_~i~0) = 1*v_rep(select #length ULTIMATE.start_lis_~best~0.base)_1 - 1*ULTIMATE.start_lis_~best~0.offset - 4*ULTIMATE.start_lis_~i~0 Supporting invariants [] [2018-11-18 12:44:12,464 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2018-11-18 12:44:12,469 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 12:44:12,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:44:12,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:44:12,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:44:12,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:44:12,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:44:12,522 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-18 12:44:12,531 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 12:44:12,532 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states. Second operand 4 states. [2018-11-18 12:44:12,566 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states.. Second operand 4 states. Result 49 states and 70 transitions. Complement of second has 8 states. [2018-11-18 12:44:12,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 12:44:12,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 12:44:12,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2018-11-18 12:44:12,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 4 letters. Loop has 3 letters. [2018-11-18 12:44:12,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:44:12,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-18 12:44:12,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:44:12,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 4 letters. Loop has 6 letters. [2018-11-18 12:44:12,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:44:12,572 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 70 transitions. [2018-11-18 12:44:12,573 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-11-18 12:44:12,576 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 23 states and 33 transitions. [2018-11-18 12:44:12,576 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-18 12:44:12,577 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-18 12:44:12,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 33 transitions. [2018-11-18 12:44:12,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:44:12,577 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 33 transitions. [2018-11-18 12:44:12,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 33 transitions. [2018-11-18 12:44:12,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-18 12:44:12,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-18 12:44:12,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 33 transitions. [2018-11-18 12:44:12,595 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 33 transitions. [2018-11-18 12:44:12,595 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 33 transitions. [2018-11-18 12:44:12,595 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 12:44:12,595 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 33 transitions. [2018-11-18 12:44:12,595 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-11-18 12:44:12,595 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:44:12,595 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:44:12,596 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:44:12,596 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 12:44:12,596 INFO L794 eck$LassoCheckResult]: Stem: 209#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 205#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 200#L565 assume !(main_~array_size~0 < 1); 201#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;assume { :begin_inline_lis } true;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 188#L552-4 assume true; 190#L552-1 assume !(lis_~i~0 < lis_~N); 192#L552-5 lis_~i~0 := 1; 193#L554-4 [2018-11-18 12:44:12,596 INFO L796 eck$LassoCheckResult]: Loop: 193#L554-4 assume true; 206#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 207#L555-4 assume !true; 203#L554-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 193#L554-4 [2018-11-18 12:44:12,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:44:12,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1806814416, now seen corresponding path program 1 times [2018-11-18 12:44:12,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:44:12,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:44:12,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:12,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:44:12,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:12,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:44:12,652 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-18 12:44:12,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:44:12,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:44:12,654 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 12:44:12,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:44:12,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1791208, now seen corresponding path program 1 times [2018-11-18 12:44:12,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:44:12,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:44:12,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:12,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:44:12,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:12,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:44:12,658 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-18 12:44:12,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:44:12,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 12:44:12,658 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 12:44:12,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 12:44:12,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 12:44:12,661 INFO L87 Difference]: Start difference. First operand 23 states and 33 transitions. cyclomatic complexity: 13 Second operand 2 states. [2018-11-18 12:44:12,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:44:12,664 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2018-11-18 12:44:12,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 12:44:12,665 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 31 transitions. [2018-11-18 12:44:12,665 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-11-18 12:44:12,666 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 31 transitions. [2018-11-18 12:44:12,666 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-18 12:44:12,666 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-18 12:44:12,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 31 transitions. [2018-11-18 12:44:12,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:44:12,666 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2018-11-18 12:44:12,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 31 transitions. [2018-11-18 12:44:12,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-18 12:44:12,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-18 12:44:12,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2018-11-18 12:44:12,668 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2018-11-18 12:44:12,668 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2018-11-18 12:44:12,668 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 12:44:12,668 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 31 transitions. [2018-11-18 12:44:12,669 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-11-18 12:44:12,669 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:44:12,669 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:44:12,669 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:44:12,669 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 12:44:12,669 INFO L794 eck$LassoCheckResult]: Stem: 262#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 258#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 253#L565 assume !(main_~array_size~0 < 1); 254#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;assume { :begin_inline_lis } true;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 241#L552-4 assume true; 243#L552-1 assume !(lis_~i~0 < lis_~N); 245#L552-5 lis_~i~0 := 1; 246#L554-4 [2018-11-18 12:44:12,669 INFO L796 eck$LassoCheckResult]: Loop: 246#L554-4 assume true; 259#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 260#L555-4 assume true; 255#L555-1 assume !(lis_~j~0 < lis_~i~0); 256#L554-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 246#L554-4 [2018-11-18 12:44:12,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:44:12,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1806814416, now seen corresponding path program 2 times [2018-11-18 12:44:12,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:44:12,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:44:12,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:12,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:44:12,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:12,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:44:12,699 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-18 12:44:12,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:44:12,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:44:12,699 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 12:44:12,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:44:12,699 INFO L82 PathProgramCache]: Analyzing trace with hash 55507698, now seen corresponding path program 1 times [2018-11-18 12:44:12,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:44:12,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:44:12,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:12,700 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:44:12,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:12,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:44:12,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:44:12,711 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:44:12,711 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:44:12,711 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:44:12,711 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:44:12,711 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 12:44:12,711 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:44:12,711 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:44:12,711 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:44:12,711 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-termination.c.i_Iteration3_Loop [2018-11-18 12:44:12,711 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:44:12,711 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:44:12,712 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-18 12:44:12,716 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-18 12:44:12,718 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-18 12:44:12,723 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-18 12:44:12,724 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-18 12:44:12,757 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:44:12,757 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_564e3793-cc27-4c48-b0d5-76f0bde905ba/bin-2019/uautomizer/z3 Starting monitored process 2 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:44:12,761 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 12:44:12,761 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 12:44:12,778 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 12:44:12,778 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~P_PID_2=1} Honda state: {v_rep~unnamed0~0~P_PID_2=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_564e3793-cc27-4c48-b0d5-76f0bde905ba/bin-2019/uautomizer/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:44:12,782 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 12:44:12,782 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 12:44:12,797 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 12:44:12,797 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~P_PGID_2=2} Honda state: {v_rep~unnamed0~0~P_PGID_2=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_564e3793-cc27-4c48-b0d5-76f0bde905ba/bin-2019/uautomizer/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:44:12,800 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 12:44:12,800 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_564e3793-cc27-4c48-b0d5-76f0bde905ba/bin-2019/uautomizer/z3 Starting monitored process 5 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:44:12,820 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 12:44:12,820 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 12:44:12,948 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 12:44:12,949 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:44:12,950 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:44:12,950 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:44:12,950 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:44:12,950 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 12:44:12,950 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:44:12,950 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:44:12,950 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:44:12,950 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-termination.c.i_Iteration3_Loop [2018-11-18 12:44:12,950 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:44:12,950 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:44:12,951 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-18 12:44:12,955 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-18 12:44:12,957 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-18 12:44:12,963 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-18 12:44:12,964 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-18 12:44:13,011 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:44:13,012 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 12:44:13,012 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:44:13,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:13,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:13,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:13,013 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:13,014 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:44:13,014 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:44:13,015 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:13,016 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:44:13,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:13,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:13,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:13,016 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:13,017 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:44:13,017 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:44:13,020 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:13,020 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:44:13,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:13,021 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:44:13,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:13,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:13,023 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:13,024 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:44:13,024 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:44:13,026 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 12:44:13,027 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 12:44:13,027 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 12:44:13,027 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 12:44:13,028 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 12:44:13,028 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 12:44:13,028 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~i~0) = -2*ULTIMATE.start_lis_~i~0 + 1 Supporting invariants [] [2018-11-18 12:44:13,028 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 12:44:13,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:44:13,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:44:13,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:44:13,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:44:13,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:44:13,075 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-18 12:44:13,076 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-18 12:44:13,076 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 31 transitions. cyclomatic complexity: 11 Second operand 5 states. [2018-11-18 12:44:13,148 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 31 transitions. cyclomatic complexity: 11. Second operand 5 states. Result 47 states and 66 transitions. Complement of second has 9 states. [2018-11-18 12:44:13,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-18 12:44:13,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 12:44:13,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2018-11-18 12:44:13,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 7 letters. Loop has 5 letters. [2018-11-18 12:44:13,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:44:13,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 12 letters. Loop has 5 letters. [2018-11-18 12:44:13,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:44:13,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 7 letters. Loop has 10 letters. [2018-11-18 12:44:13,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:44:13,151 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 66 transitions. [2018-11-18 12:44:13,152 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-18 12:44:13,153 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 45 states and 64 transitions. [2018-11-18 12:44:13,153 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-11-18 12:44:13,153 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-11-18 12:44:13,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 64 transitions. [2018-11-18 12:44:13,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:44:13,153 INFO L705 BuchiCegarLoop]: Abstraction has 45 states and 64 transitions. [2018-11-18 12:44:13,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 64 transitions. [2018-11-18 12:44:13,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 38. [2018-11-18 12:44:13,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-18 12:44:13,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 52 transitions. [2018-11-18 12:44:13,156 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 52 transitions. [2018-11-18 12:44:13,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 12:44:13,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:44:13,156 INFO L87 Difference]: Start difference. First operand 38 states and 52 transitions. Second operand 4 states. [2018-11-18 12:44:13,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:44:13,202 INFO L93 Difference]: Finished difference Result 41 states and 54 transitions. [2018-11-18 12:44:13,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 12:44:13,202 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 54 transitions. [2018-11-18 12:44:13,203 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-11-18 12:44:13,204 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 40 states and 53 transitions. [2018-11-18 12:44:13,204 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-18 12:44:13,204 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-18 12:44:13,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 53 transitions. [2018-11-18 12:44:13,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:44:13,204 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 53 transitions. [2018-11-18 12:44:13,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 53 transitions. [2018-11-18 12:44:13,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-11-18 12:44:13,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-18 12:44:13,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 51 transitions. [2018-11-18 12:44:13,206 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 51 transitions. [2018-11-18 12:44:13,206 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 51 transitions. [2018-11-18 12:44:13,207 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 12:44:13,207 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 51 transitions. [2018-11-18 12:44:13,207 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-11-18 12:44:13,207 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:44:13,207 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:44:13,208 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:44:13,208 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:44:13,209 INFO L794 eck$LassoCheckResult]: Stem: 484#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 478#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 471#L565 assume !(main_~array_size~0 < 1); 472#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;assume { :begin_inline_lis } true;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 457#L552-4 assume true; 458#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 490#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 459#L552-4 assume true; 460#L552-1 assume !(lis_~i~0 < lis_~N); 461#L552-5 lis_~i~0 := 1; 462#L554-4 assume true; 479#L554-1 [2018-11-18 12:44:13,209 INFO L796 eck$LassoCheckResult]: Loop: 479#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 480#L555-4 assume true; 473#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 465#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 466#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 476#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 485#L555-4 assume true; 491#L555-1 assume !(lis_~j~0 < lis_~i~0); 487#L554-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 488#L554-4 assume true; 479#L554-1 [2018-11-18 12:44:13,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:44:13,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1956012017, now seen corresponding path program 1 times [2018-11-18 12:44:13,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:44:13,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:44:13,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:13,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:44:13,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:13,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:44:13,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:44:13,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:44:13,228 INFO L82 PathProgramCache]: Analyzing trace with hash 835304816, now seen corresponding path program 1 times [2018-11-18 12:44:13,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:44:13,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:44:13,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:13,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:44:13,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:13,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:44:13,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:44:13,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:44:13,241 INFO L82 PathProgramCache]: Analyzing trace with hash -677580448, now seen corresponding path program 1 times [2018-11-18 12:44:13,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:44:13,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:44:13,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:13,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:44:13,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:13,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:44:13,297 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:44:13,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:44:13,297 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_564e3793-cc27-4c48-b0d5-76f0bde905ba/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:44:13,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:44:13,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:44:13,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:44:13,400 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 12:44:13,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:44:13,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-11-18 12:44:13,564 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 81 [2018-11-18 12:44:13,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 12:44:13,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-11-18 12:44:13,605 INFO L87 Difference]: Start difference. First operand 38 states and 51 transitions. cyclomatic complexity: 17 Second operand 10 states. [2018-11-18 12:44:13,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:44:13,735 INFO L93 Difference]: Finished difference Result 89 states and 114 transitions. [2018-11-18 12:44:13,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 12:44:13,735 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 114 transitions. [2018-11-18 12:44:13,736 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 23 [2018-11-18 12:44:13,736 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 77 states and 101 transitions. [2018-11-18 12:44:13,736 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2018-11-18 12:44:13,737 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2018-11-18 12:44:13,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 101 transitions. [2018-11-18 12:44:13,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:44:13,737 INFO L705 BuchiCegarLoop]: Abstraction has 77 states and 101 transitions. [2018-11-18 12:44:13,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 101 transitions. [2018-11-18 12:44:13,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 41. [2018-11-18 12:44:13,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-18 12:44:13,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 54 transitions. [2018-11-18 12:44:13,739 INFO L728 BuchiCegarLoop]: Abstraction has 41 states and 54 transitions. [2018-11-18 12:44:13,739 INFO L608 BuchiCegarLoop]: Abstraction has 41 states and 54 transitions. [2018-11-18 12:44:13,739 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 12:44:13,739 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 54 transitions. [2018-11-18 12:44:13,740 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-11-18 12:44:13,740 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:44:13,740 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:44:13,740 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:44:13,740 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:44:13,740 INFO L794 eck$LassoCheckResult]: Stem: 696#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 690#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 683#L565 assume !(main_~array_size~0 < 1); 684#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;assume { :begin_inline_lis } true;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 669#L552-4 assume true; 670#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 704#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 671#L552-4 assume true; 672#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 703#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 705#L552-4 assume true; 702#L552-1 assume !(lis_~i~0 < lis_~N); 673#L552-5 lis_~i~0 := 1; 674#L554-4 assume true; 691#L554-1 [2018-11-18 12:44:13,740 INFO L796 eck$LassoCheckResult]: Loop: 691#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 692#L555-4 assume true; 687#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 677#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 678#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 685#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 697#L555-4 assume true; 706#L555-1 assume !(lis_~j~0 < lis_~i~0); 699#L554-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 700#L554-4 assume true; 691#L554-1 [2018-11-18 12:44:13,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:44:13,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1785827116, now seen corresponding path program 2 times [2018-11-18 12:44:13,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:44:13,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:44:13,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:13,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:44:13,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:13,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:44:13,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:44:13,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:44:13,758 INFO L82 PathProgramCache]: Analyzing trace with hash 835304816, now seen corresponding path program 2 times [2018-11-18 12:44:13,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:44:13,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:44:13,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:13,759 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:44:13,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:13,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:44:13,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:44:13,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:44:13,769 INFO L82 PathProgramCache]: Analyzing trace with hash -985754917, now seen corresponding path program 2 times [2018-11-18 12:44:13,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:44:13,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:44:13,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:13,770 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:44:13,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:13,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:44:13,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:44:14,000 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 79 [2018-11-18 12:44:14,267 WARN L180 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 111 [2018-11-18 12:44:14,352 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:44:14,352 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:44:14,352 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:44:14,353 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:44:14,353 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 12:44:14,353 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:44:14,353 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:44:14,353 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:44:14,353 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-termination.c.i_Iteration5_Lasso [2018-11-18 12:44:14,353 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:44:14,353 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:44:14,356 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-18 12:44:14,358 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-18 12:44:14,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-18 12:44:14,360 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-18 12:44:14,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-18 12:44:14,362 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-18 12:44:14,363 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-18 12:44:14,673 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 94 [2018-11-18 12:44:14,802 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 82 [2018-11-18 12:44:14,802 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-18 12:44:14,804 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-18 12:44:14,805 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-18 12:44:14,806 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-18 12:44:14,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:44:14,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:44:14,809 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-18 12:44:14,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:44:14,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:44:14,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:44:14,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:44:14,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:44:14,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:44:14,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:44:14,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:44:14,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:44:15,000 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2018-11-18 12:44:15,244 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:44:15,244 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 12:44:15,244 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:44:15,245 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:15,245 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:44:15,245 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:15,245 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:15,245 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:15,245 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:44:15,245 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:44:15,246 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:15,247 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:44:15,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:15,247 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:44:15,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:15,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:15,247 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:15,247 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:44:15,248 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:44:15,248 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:15,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-18 12:44:15,248 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:15,249 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:44:15,249 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:15,249 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:15,249 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:15,249 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:44:15,249 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:44:15,250 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:15,250 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:44:15,250 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:15,250 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:44:15,250 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:15,250 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:15,250 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:15,251 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:44:15,251 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:44:15,251 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:15,251 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:44:15,252 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:15,252 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:44:15,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:15,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:15,252 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:15,252 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:44:15,252 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:44:15,253 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:15,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-18 12:44:15,253 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:15,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:15,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:15,254 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:15,254 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:44:15,254 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:44:15,255 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:15,256 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:44:15,256 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:15,256 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:44:15,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:15,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:15,256 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:15,257 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:44:15,257 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:44:15,258 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:15,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-18 12:44:15,258 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:15,258 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:15,258 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:15,259 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:15,259 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:44:15,259 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:44:15,263 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:15,263 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:44:15,263 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:15,264 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:44:15,264 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:15,264 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:15,265 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:44:15,265 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:44:15,267 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:15,268 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:44:15,268 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:15,268 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:44:15,268 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:15,268 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:15,269 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:44:15,270 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:44:15,274 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:15,274 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:44:15,274 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:15,275 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:15,275 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:15,275 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:15,276 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:44:15,276 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:44:15,284 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 12:44:15,287 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 12:44:15,288 INFO L444 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-18 12:44:15,288 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 12:44:15,288 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 12:44:15,289 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 12:44:15,289 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_lis_~best~0.base) ULTIMATE.start_lis_~best~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_lis_~best~0.base) (+ ULTIMATE.start_lis_~best~0.offset 4))_1) = 2*v_rep(select (select #memory_int ULTIMATE.start_lis_~best~0.base) ULTIMATE.start_lis_~best~0.offset)_1 - 2*v_rep(select (select #memory_int ULTIMATE.start_lis_~best~0.base) (+ ULTIMATE.start_lis_~best~0.offset 4))_1 + 1 Supporting invariants [] [2018-11-18 12:44:15,397 INFO L297 tatePredicateManager]: 36 out of 37 supporting invariants were superfluous and have been removed [2018-11-18 12:44:15,399 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 12:44:15,399 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 12:44:15,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:44:15,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:44:15,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:44:15,441 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 11 treesize of output 14 [2018-11-18 12:44:15,447 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:15,448 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:15,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 12:44:15,449 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:44:15,452 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:44:15,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:44:15,456 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-11-18 12:44:15,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:44:15,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:44:15,541 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:15,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 86 [2018-11-18 12:44:15,548 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:15,551 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:15,552 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:15,553 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:44:15,562 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:15,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 158 [2018-11-18 12:44:15,581 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-11-18 12:44:15,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 77 [2018-11-18 12:44:15,638 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 12 treesize of output 11 [2018-11-18 12:44:15,638 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:44:15,650 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:44:15,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 73 [2018-11-18 12:44:15,660 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 12 treesize of output 11 [2018-11-18 12:44:15,660 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 12:44:15,667 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:44:15,683 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 12:44:15,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-18 12:44:15,704 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:110, output treesize:161 [2018-11-18 12:44:15,935 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:44:15,935 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2018-11-18 12:44:15,935 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 54 transitions. cyclomatic complexity: 17 Second operand 9 states. [2018-11-18 12:44:16,107 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 54 transitions. cyclomatic complexity: 17. Second operand 9 states. Result 152 states and 209 transitions. Complement of second has 16 states. [2018-11-18 12:44:16,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-18 12:44:16,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 12:44:16,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 57 transitions. [2018-11-18 12:44:16,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 57 transitions. Stem has 14 letters. Loop has 10 letters. [2018-11-18 12:44:16,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:44:16,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 57 transitions. Stem has 24 letters. Loop has 10 letters. [2018-11-18 12:44:16,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:44:16,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 57 transitions. Stem has 14 letters. Loop has 20 letters. [2018-11-18 12:44:16,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:44:16,111 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 152 states and 209 transitions. [2018-11-18 12:44:16,113 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 41 [2018-11-18 12:44:16,114 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 152 states to 142 states and 194 transitions. [2018-11-18 12:44:16,115 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2018-11-18 12:44:16,115 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2018-11-18 12:44:16,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 142 states and 194 transitions. [2018-11-18 12:44:16,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:44:16,115 INFO L705 BuchiCegarLoop]: Abstraction has 142 states and 194 transitions. [2018-11-18 12:44:16,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states and 194 transitions. [2018-11-18 12:44:16,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 110. [2018-11-18 12:44:16,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-18 12:44:16,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 153 transitions. [2018-11-18 12:44:16,121 INFO L728 BuchiCegarLoop]: Abstraction has 110 states and 153 transitions. [2018-11-18 12:44:16,121 INFO L608 BuchiCegarLoop]: Abstraction has 110 states and 153 transitions. [2018-11-18 12:44:16,121 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 12:44:16,121 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 110 states and 153 transitions. [2018-11-18 12:44:16,123 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 29 [2018-11-18 12:44:16,123 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:44:16,123 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:44:16,123 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:44:16,123 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:44:16,123 INFO L794 eck$LassoCheckResult]: Stem: 1156#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1152#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 1144#L565 assume !(main_~array_size~0 < 1); 1145#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;assume { :begin_inline_lis } true;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 1130#L552-4 assume true; 1131#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1174#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1132#L552-4 assume true; 1133#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1169#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1173#L552-4 assume true; 1168#L552-1 assume !(lis_~i~0 < lis_~N); 1134#L552-5 lis_~i~0 := 1; 1135#L554-4 assume true; 1191#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1188#L555-4 [2018-11-18 12:44:16,124 INFO L796 eck$LassoCheckResult]: Loop: 1188#L555-4 assume true; 1185#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1183#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 1180#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8; 1150#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1179#L555-4 assume true; 1175#L555-1 assume !(lis_~j~0 < lis_~i~0); 1176#L554-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1195#L554-4 assume true; 1190#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1188#L555-4 [2018-11-18 12:44:16,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:44:16,124 INFO L82 PathProgramCache]: Analyzing trace with hash -473934219, now seen corresponding path program 1 times [2018-11-18 12:44:16,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:44:16,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:44:16,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:16,125 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:44:16,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:16,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:44:16,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:44:16,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:44:16,137 INFO L82 PathProgramCache]: Analyzing trace with hash -856528460, now seen corresponding path program 1 times [2018-11-18 12:44:16,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:44:16,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:44:16,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:16,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:44:16,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:16,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:44:16,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:44:16,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:44:16,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1281376040, now seen corresponding path program 1 times [2018-11-18 12:44:16,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:44:16,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:44:16,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:16,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:44:16,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:16,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:44:16,210 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:44:16,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:44:16,211 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_564e3793-cc27-4c48-b0d5-76f0bde905ba/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:44:16,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:44:16,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:44:16,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:44:16,314 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 12:44:16,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:44:16,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-11-18 12:44:16,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 12:44:16,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-11-18 12:44:16,427 INFO L87 Difference]: Start difference. First operand 110 states and 153 transitions. cyclomatic complexity: 51 Second operand 14 states. [2018-11-18 12:44:16,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:44:16,740 INFO L93 Difference]: Finished difference Result 407 states and 553 transitions. [2018-11-18 12:44:16,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-18 12:44:16,741 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 407 states and 553 transitions. [2018-11-18 12:44:16,744 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 63 [2018-11-18 12:44:16,750 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 407 states to 315 states and 434 transitions. [2018-11-18 12:44:16,750 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 129 [2018-11-18 12:44:16,751 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 129 [2018-11-18 12:44:16,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 315 states and 434 transitions. [2018-11-18 12:44:16,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:44:16,751 INFO L705 BuchiCegarLoop]: Abstraction has 315 states and 434 transitions. [2018-11-18 12:44:16,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states and 434 transitions. [2018-11-18 12:44:16,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 122. [2018-11-18 12:44:16,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-18 12:44:16,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 167 transitions. [2018-11-18 12:44:16,759 INFO L728 BuchiCegarLoop]: Abstraction has 122 states and 167 transitions. [2018-11-18 12:44:16,759 INFO L608 BuchiCegarLoop]: Abstraction has 122 states and 167 transitions. [2018-11-18 12:44:16,759 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 12:44:16,759 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states and 167 transitions. [2018-11-18 12:44:16,760 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 34 [2018-11-18 12:44:16,760 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:44:16,760 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:44:16,760 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:44:16,760 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 12:44:16,761 INFO L794 eck$LassoCheckResult]: Stem: 1791#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1786#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 1776#L565 assume !(main_~array_size~0 < 1); 1777#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;assume { :begin_inline_lis } true;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 1762#L552-4 assume true; 1763#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1811#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1764#L552-4 assume true; 1765#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1807#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1808#L552-4 assume true; 1799#L552-1 assume !(lis_~i~0 < lis_~N); 1800#L552-5 lis_~i~0 := 1; 1803#L554-4 assume true; 1787#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1788#L555-4 [2018-11-18 12:44:16,761 INFO L796 eck$LassoCheckResult]: Loop: 1788#L555-4 assume true; 1864#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 1863#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 1861#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 1862#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1788#L555-4 [2018-11-18 12:44:16,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:44:16,761 INFO L82 PathProgramCache]: Analyzing trace with hash -473934219, now seen corresponding path program 2 times [2018-11-18 12:44:16,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:44:16,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:44:16,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:16,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:44:16,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:16,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:44:16,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:44:16,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:44:16,775 INFO L82 PathProgramCache]: Analyzing trace with hash 64095531, now seen corresponding path program 1 times [2018-11-18 12:44:16,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:44:16,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:44:16,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:16,776 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:44:16,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:16,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:44:16,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:44:16,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:44:16,786 INFO L82 PathProgramCache]: Analyzing trace with hash -20342985, now seen corresponding path program 1 times [2018-11-18 12:44:16,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:44:16,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:44:16,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:16,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:44:16,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:16,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:44:16,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:44:16,928 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 73 [2018-11-18 12:44:17,185 WARN L180 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 113 [2018-11-18 12:44:17,267 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:44:17,268 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:44:17,268 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:44:17,268 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:44:17,268 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 12:44:17,268 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:44:17,268 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:44:17,268 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:44:17,268 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-termination.c.i_Iteration7_Lasso [2018-11-18 12:44:17,268 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:44:17,268 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:44:17,271 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-18 12:44:17,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:44:17,274 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-18 12:44:17,280 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-18 12:44:17,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:44:17,284 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-18 12:44:17,287 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-18 12:44:17,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:44:17,289 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-18 12:44:17,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:44:17,300 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-18 12:44:17,634 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 102 [2018-11-18 12:44:17,779 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 88 [2018-11-18 12:44:17,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:44:17,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:44:17,782 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-18 12:44:17,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:44:17,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:44:17,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:44:17,787 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-18 12:44:17,787 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-18 12:44:17,789 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-18 12:44:17,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:44:17,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:44:17,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:44:17,958 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2018-11-18 12:44:18,210 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:44:18,210 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 12:44:18,210 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:44:18,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:18,211 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:44:18,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:18,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:18,211 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:18,211 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:44:18,211 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:44:18,212 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:18,212 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:44:18,212 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:18,213 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:44:18,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:18,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:18,213 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:18,213 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:44:18,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:44:18,213 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:18,214 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:44:18,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:18,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:18,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:18,214 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:18,215 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:44:18,215 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:44:18,216 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:18,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-18 12:44:18,216 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:18,216 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:44:18,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:18,216 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:18,216 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:18,217 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:44:18,217 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:44:18,217 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:18,217 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:44:18,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:18,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:18,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:18,218 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:18,218 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:44:18,218 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:44:18,219 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:18,220 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:44:18,220 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:18,220 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:44:18,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:18,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:18,220 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:18,221 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:44:18,221 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:44:18,221 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:18,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-18 12:44:18,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:18,222 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:44:18,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:18,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:18,222 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:18,222 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:44:18,222 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:44:18,222 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:18,223 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:44:18,223 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:18,223 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:44:18,223 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:18,223 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:18,223 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:18,223 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:44:18,223 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:44:18,224 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:18,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-18 12:44:18,224 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:18,224 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:44:18,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:18,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:18,225 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:18,225 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:44:18,225 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:44:18,225 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:18,226 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:44:18,226 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:18,226 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:44:18,226 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:18,226 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:18,226 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:18,226 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:44:18,227 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:44:18,227 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:18,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-18 12:44:18,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:18,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:18,228 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:18,228 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:18,228 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:44:18,228 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:44:18,231 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:18,231 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:44:18,231 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:18,231 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:44:18,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:18,232 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:18,232 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:18,232 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:44:18,232 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:44:18,233 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:18,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-18 12:44:18,233 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:18,233 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:18,233 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:18,233 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:18,234 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:44:18,234 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:44:18,236 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:18,237 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:44:18,237 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:18,237 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:18,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:18,237 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:18,238 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:44:18,238 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:44:18,243 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:18,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-18 12:44:18,244 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:18,244 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:18,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:18,244 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:18,245 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:44:18,245 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:44:18,246 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:18,246 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:44:18,246 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:18,246 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:18,246 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:18,246 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:18,247 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:44:18,247 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:44:18,248 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:18,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-18 12:44:18,249 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:18,249 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:18,249 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:18,249 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:18,252 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:44:18,252 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:44:18,283 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 12:44:18,306 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-18 12:44:18,306 INFO L444 ModelExtractionUtils]: 52 out of 58 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-18 12:44:18,307 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 12:44:18,308 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 12:44:18,308 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 12:44:18,308 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~j~0) = -2*ULTIMATE.start_lis_~j~0 + 1 Supporting invariants [] [2018-11-18 12:44:18,429 INFO L297 tatePredicateManager]: 42 out of 43 supporting invariants were superfluous and have been removed [2018-11-18 12:44:18,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:44:18,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:44:18,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:44:18,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:44:18,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:44:18,465 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-18 12:44:18,465 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-18 12:44:18,465 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 122 states and 167 transitions. cyclomatic complexity: 54 Second operand 5 states. [2018-11-18 12:44:18,499 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 122 states and 167 transitions. cyclomatic complexity: 54. Second operand 5 states. Result 249 states and 349 transitions. Complement of second has 8 states. [2018-11-18 12:44:18,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 12:44:18,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 12:44:18,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2018-11-18 12:44:18,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 15 letters. Loop has 5 letters. [2018-11-18 12:44:18,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:44:18,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 20 letters. Loop has 5 letters. [2018-11-18 12:44:18,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:44:18,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 15 letters. Loop has 10 letters. [2018-11-18 12:44:18,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:44:18,502 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 249 states and 349 transitions. [2018-11-18 12:44:18,504 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 29 [2018-11-18 12:44:18,505 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 249 states to 191 states and 263 transitions. [2018-11-18 12:44:18,505 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2018-11-18 12:44:18,505 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2018-11-18 12:44:18,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 191 states and 263 transitions. [2018-11-18 12:44:18,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:44:18,505 INFO L705 BuchiCegarLoop]: Abstraction has 191 states and 263 transitions. [2018-11-18 12:44:18,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states and 263 transitions. [2018-11-18 12:44:18,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 177. [2018-11-18 12:44:18,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-11-18 12:44:18,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 247 transitions. [2018-11-18 12:44:18,514 INFO L728 BuchiCegarLoop]: Abstraction has 177 states and 247 transitions. [2018-11-18 12:44:18,514 INFO L608 BuchiCegarLoop]: Abstraction has 177 states and 247 transitions. [2018-11-18 12:44:18,514 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 12:44:18,514 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 177 states and 247 transitions. [2018-11-18 12:44:18,515 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 29 [2018-11-18 12:44:18,515 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:44:18,515 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:44:18,515 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:44:18,515 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:44:18,516 INFO L794 eck$LassoCheckResult]: Stem: 2425#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2420#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 2410#L565 assume !(main_~array_size~0 < 1); 2411#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;assume { :begin_inline_lis } true;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 2396#L552-4 assume true; 2397#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2436#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2398#L552-4 assume true; 2399#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2441#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2442#L552-4 assume true; 2445#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2446#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2444#L552-4 assume true; 2435#L552-1 assume !(lis_~i~0 < lis_~N); 2400#L552-5 lis_~i~0 := 1; 2401#L554-4 assume true; 2438#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2519#L555-4 assume true; 2479#L555-1 assume !(lis_~j~0 < lis_~i~0); 2480#L554-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 2448#L554-4 assume true; 2449#L554-1 [2018-11-18 12:44:18,516 INFO L796 eck$LassoCheckResult]: Loop: 2449#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2541#L555-4 assume true; 2540#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 2539#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 2538#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8; 2413#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2537#L555-4 assume true; 2534#L555-1 assume !(lis_~j~0 < lis_~i~0); 2417#L554-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 2432#L554-4 assume true; 2449#L554-1 [2018-11-18 12:44:18,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:44:18,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1831421780, now seen corresponding path program 1 times [2018-11-18 12:44:18,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:44:18,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:44:18,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:18,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:44:18,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:18,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:44:18,550 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-18 12:44:18,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:44:18,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:44:18,551 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 12:44:18,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:44:18,551 INFO L82 PathProgramCache]: Analyzing trace with hash 892563118, now seen corresponding path program 2 times [2018-11-18 12:44:18,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:44:18,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:44:18,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:18,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:44:18,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:18,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:44:18,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:44:18,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 12:44:18,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:44:18,674 INFO L87 Difference]: Start difference. First operand 177 states and 247 transitions. cyclomatic complexity: 84 Second operand 4 states. [2018-11-18 12:44:18,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:44:18,696 INFO L93 Difference]: Finished difference Result 189 states and 259 transitions. [2018-11-18 12:44:18,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 12:44:18,696 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 189 states and 259 transitions. [2018-11-18 12:44:18,698 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 29 [2018-11-18 12:44:18,699 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 189 states to 187 states and 257 transitions. [2018-11-18 12:44:18,699 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2018-11-18 12:44:18,699 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2018-11-18 12:44:18,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 187 states and 257 transitions. [2018-11-18 12:44:18,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:44:18,699 INFO L705 BuchiCegarLoop]: Abstraction has 187 states and 257 transitions. [2018-11-18 12:44:18,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states and 257 transitions. [2018-11-18 12:44:18,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 175. [2018-11-18 12:44:18,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-11-18 12:44:18,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 243 transitions. [2018-11-18 12:44:18,703 INFO L728 BuchiCegarLoop]: Abstraction has 175 states and 243 transitions. [2018-11-18 12:44:18,703 INFO L608 BuchiCegarLoop]: Abstraction has 175 states and 243 transitions. [2018-11-18 12:44:18,703 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-18 12:44:18,703 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 175 states and 243 transitions. [2018-11-18 12:44:18,704 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 29 [2018-11-18 12:44:18,704 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:44:18,704 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:44:18,705 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:44:18,705 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:44:18,705 INFO L794 eck$LassoCheckResult]: Stem: 2800#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2793#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 2783#L565 assume !(main_~array_size~0 < 1); 2784#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;assume { :begin_inline_lis } true;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 2769#L552-4 assume true; 2770#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2805#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2771#L552-4 assume true; 2772#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2811#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2812#L552-4 assume true; 2815#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 2816#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2814#L552-4 assume true; 2804#L552-1 assume !(lis_~i~0 < lis_~N); 2773#L552-5 lis_~i~0 := 1; 2774#L554-4 assume true; 2794#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2795#L555-4 assume true; 2900#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 2899#L556 assume !lis_#t~short11; 2895#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8; 2884#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2885#L555-4 assume true; 2785#L555-1 assume !(lis_~j~0 < lis_~i~0); 2786#L554-3 [2018-11-18 12:44:18,705 INFO L796 eck$LassoCheckResult]: Loop: 2786#L554-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 2807#L554-4 assume true; 2820#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2914#L555-4 assume true; 2913#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 2912#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 2910#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8; 2911#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2922#L555-4 assume true; 2906#L555-1 assume !(lis_~j~0 < lis_~i~0); 2786#L554-3 [2018-11-18 12:44:18,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:44:18,705 INFO L82 PathProgramCache]: Analyzing trace with hash 963661759, now seen corresponding path program 1 times [2018-11-18 12:44:18,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:44:18,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:44:18,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:18,706 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:44:18,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:18,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:44:18,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:44:18,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:44:18,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1826216110, now seen corresponding path program 3 times [2018-11-18 12:44:18,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:44:18,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:44:18,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:18,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:44:18,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:18,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:44:18,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:44:18,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:44:18,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1355803924, now seen corresponding path program 1 times [2018-11-18 12:44:18,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:44:18,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:44:18,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:18,734 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:44:18,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:18,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:44:18,792 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-18 12:44:18,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:44:18,792 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_564e3793-cc27-4c48-b0d5-76f0bde905ba/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:44:18,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:44:18,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:44:18,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:44:18,855 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-18 12:44:18,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:44:18,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 11 [2018-11-18 12:44:18,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 12:44:18,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-11-18 12:44:18,982 INFO L87 Difference]: Start difference. First operand 175 states and 243 transitions. cyclomatic complexity: 82 Second operand 12 states. [2018-11-18 12:44:19,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:44:19,082 INFO L93 Difference]: Finished difference Result 214 states and 288 transitions. [2018-11-18 12:44:19,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 12:44:19,082 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 214 states and 288 transitions. [2018-11-18 12:44:19,083 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 43 [2018-11-18 12:44:19,084 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 214 states to 90 states and 119 transitions. [2018-11-18 12:44:19,084 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2018-11-18 12:44:19,084 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2018-11-18 12:44:19,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 119 transitions. [2018-11-18 12:44:19,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:44:19,084 INFO L705 BuchiCegarLoop]: Abstraction has 90 states and 119 transitions. [2018-11-18 12:44:19,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 119 transitions. [2018-11-18 12:44:19,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 56. [2018-11-18 12:44:19,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-18 12:44:19,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 72 transitions. [2018-11-18 12:44:19,086 INFO L728 BuchiCegarLoop]: Abstraction has 56 states and 72 transitions. [2018-11-18 12:44:19,086 INFO L608 BuchiCegarLoop]: Abstraction has 56 states and 72 transitions. [2018-11-18 12:44:19,086 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-18 12:44:19,086 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 72 transitions. [2018-11-18 12:44:19,087 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2018-11-18 12:44:19,087 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:44:19,087 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:44:19,087 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:44:19,087 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 2, 1, 1, 1, 1] [2018-11-18 12:44:19,088 INFO L794 eck$LassoCheckResult]: Stem: 3308#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3304#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 3297#L565 assume !(main_~array_size~0 < 1); 3298#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;assume { :begin_inline_lis } true;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 3283#L552-4 assume true; 3284#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 3323#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3285#L552-4 assume true; 3286#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 3312#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3317#L552-4 assume true; 3320#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 3321#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3319#L552-4 assume true; 3311#L552-1 assume !(lis_~i~0 < lis_~N); 3287#L552-5 lis_~i~0 := 1; 3288#L554-4 assume true; 3305#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 3306#L555-4 assume true; 3324#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 3329#L556 assume !lis_#t~short11; 3328#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8; 3303#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3310#L555-4 assume true; 3325#L555-1 assume !(lis_~j~0 < lis_~i~0); 3314#L554-3 [2018-11-18 12:44:19,088 INFO L796 eck$LassoCheckResult]: Loop: 3314#L554-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 3315#L554-4 assume true; 3316#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 3322#L555-4 assume true; 3337#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 3336#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 3301#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 3302#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3309#L555-4 assume true; 3299#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 3291#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 3292#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 3330#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3331#L555-4 assume true; 3338#L555-1 assume !(lis_~j~0 < lis_~i~0); 3314#L554-3 [2018-11-18 12:44:19,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:44:19,088 INFO L82 PathProgramCache]: Analyzing trace with hash 963661759, now seen corresponding path program 2 times [2018-11-18 12:44:19,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:44:19,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:44:19,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:19,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:44:19,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:19,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:44:19,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:44:19,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:44:19,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1340824322, now seen corresponding path program 3 times [2018-11-18 12:44:19,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:44:19,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:44:19,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:19,108 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:44:19,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:19,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:44:19,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:44:19,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:44:19,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1983240068, now seen corresponding path program 1 times [2018-11-18 12:44:19,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:44:19,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:44:19,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:19,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:44:19,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:19,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:44:19,578 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 12 proven. 32 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 12:44:19,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:44:19,578 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_564e3793-cc27-4c48-b0d5-76f0bde905ba/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:44:19,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:44:19,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:44:19,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:44:19,614 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 11 treesize of output 14 [2018-11-18 12:44:19,619 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:19,619 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:19,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 12:44:19,620 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:44:19,623 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:44:19,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:44:19,626 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:8 [2018-11-18 12:44:19,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 28 [2018-11-18 12:44:19,650 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 12 treesize of output 11 [2018-11-18 12:44:19,650 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:44:19,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-11-18 12:44:19,661 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 12 treesize of output 11 [2018-11-18 12:44:19,661 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:44:19,666 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:44:19,669 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:44:19,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:44:19,674 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:47, output treesize:30 [2018-11-18 12:44:19,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2018-11-18 12:44:19,716 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:19,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-18 12:44:19,717 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:44:19,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2018-11-18 12:44:19,731 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:19,731 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:19,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-18 12:44:19,732 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:44:19,739 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:44:19,743 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:44:19,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:44:19,748 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:56, output treesize:41 [2018-11-18 12:44:19,867 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:19,868 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 105 [2018-11-18 12:44:19,872 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:19,872 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:19,873 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:44:19,874 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:19,877 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:19,878 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 119 [2018-11-18 12:44:19,878 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:44:19,895 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:19,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 82 [2018-11-18 12:44:19,899 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:19,899 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:19,899 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:44:19,900 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:19,901 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:19,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 72 [2018-11-18 12:44:19,902 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:44:19,914 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:44:19,921 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:44:19,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 12:44:19,932 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:125, output treesize:72 [2018-11-18 12:44:20,036 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 34 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 12:44:20,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:44:20,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2018-11-18 12:44:20,348 WARN L180 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 112 [2018-11-18 12:44:20,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-18 12:44:20,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=570, Unknown=0, NotChecked=0, Total=650 [2018-11-18 12:44:20,417 INFO L87 Difference]: Start difference. First operand 56 states and 72 transitions. cyclomatic complexity: 20 Second operand 26 states. [2018-11-18 12:44:22,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:44:22,037 INFO L93 Difference]: Finished difference Result 182 states and 231 transitions. [2018-11-18 12:44:22,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-18 12:44:22,037 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 182 states and 231 transitions. [2018-11-18 12:44:22,038 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 82 [2018-11-18 12:44:22,038 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 182 states to 180 states and 229 transitions. [2018-11-18 12:44:22,038 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 156 [2018-11-18 12:44:22,039 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 159 [2018-11-18 12:44:22,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 180 states and 229 transitions. [2018-11-18 12:44:22,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:44:22,039 INFO L705 BuchiCegarLoop]: Abstraction has 180 states and 229 transitions. [2018-11-18 12:44:22,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states and 229 transitions. [2018-11-18 12:44:22,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 109. [2018-11-18 12:44:22,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-11-18 12:44:22,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 139 transitions. [2018-11-18 12:44:22,042 INFO L728 BuchiCegarLoop]: Abstraction has 109 states and 139 transitions. [2018-11-18 12:44:22,042 INFO L608 BuchiCegarLoop]: Abstraction has 109 states and 139 transitions. [2018-11-18 12:44:22,042 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-18 12:44:22,042 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 109 states and 139 transitions. [2018-11-18 12:44:22,043 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 44 [2018-11-18 12:44:22,043 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:44:22,043 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:44:22,043 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:44:22,043 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:44:22,044 INFO L794 eck$LassoCheckResult]: Stem: 3769#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3765#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 3757#L565 assume !(main_~array_size~0 < 1); 3758#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;assume { :begin_inline_lis } true;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 3743#L552-4 assume true; 3744#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 3777#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3778#L552-4 assume true; 3789#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 3790#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3745#L552-4 assume true; 3746#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 3776#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3779#L552-4 assume true; 3775#L552-1 assume !(lis_~i~0 < lis_~N); 3747#L552-5 lis_~i~0 := 1; 3748#L554-4 assume true; 3787#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 3788#L555-4 assume true; 3803#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 3802#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 3796#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 3797#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3849#L555-4 assume true; 3794#L555-1 assume !(lis_~j~0 < lis_~i~0); 3836#L554-3 [2018-11-18 12:44:22,044 INFO L796 eck$LassoCheckResult]: Loop: 3836#L554-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 3834#L554-4 assume true; 3832#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 3830#L555-4 assume true; 3828#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 3825#L556 assume !lis_#t~short11; 3826#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8; 3801#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3850#L555-4 assume true; 3848#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 3845#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 3843#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 3841#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3839#L555-4 assume true; 3840#L555-1 assume !(lis_~j~0 < lis_~i~0); 3836#L554-3 [2018-11-18 12:44:22,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:44:22,044 INFO L82 PathProgramCache]: Analyzing trace with hash 961755135, now seen corresponding path program 1 times [2018-11-18 12:44:22,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:44:22,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:44:22,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:22,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:44:22,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:22,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:44:22,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:44:22,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:44:22,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1627855682, now seen corresponding path program 1 times [2018-11-18 12:44:22,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:44:22,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:44:22,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:22,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:44:22,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:22,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:44:22,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:44:22,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:44:22,081 INFO L82 PathProgramCache]: Analyzing trace with hash 481896324, now seen corresponding path program 2 times [2018-11-18 12:44:22,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:44:22,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:44:22,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:22,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:44:22,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:22,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:44:22,633 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 12 proven. 32 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 12:44:22,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:44:22,633 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_564e3793-cc27-4c48-b0d5-76f0bde905ba/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:44:22,642 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 12:44:22,668 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 12:44:22,668 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 12:44:22,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:44:22,679 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:22,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-18 12:44:22,691 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:22,691 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:22,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-18 12:44:22,692 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:44:22,694 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:44:22,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:44:22,698 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:16 [2018-11-18 12:44:22,794 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 0 case distinctions, treesize of input 61 treesize of output 47 [2018-11-18 12:44:22,796 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:22,797 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:22,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 36 [2018-11-18 12:44:22,798 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:44:22,810 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 44 treesize of output 53 [2018-11-18 12:44:22,813 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-18 12:44:22,813 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:44:22,819 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:44:22,823 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:44:22,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-18 12:44:22,831 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:76, output treesize:55 [2018-11-18 12:44:23,077 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 17 proven. 14 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-18 12:44:23,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:44:23,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 28 [2018-11-18 12:44:23,257 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 93 [2018-11-18 12:44:23,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-18 12:44:23,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2018-11-18 12:44:23,310 INFO L87 Difference]: Start difference. First operand 109 states and 139 transitions. cyclomatic complexity: 36 Second operand 28 states. [2018-11-18 12:44:25,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:44:25,105 INFO L93 Difference]: Finished difference Result 202 states and 252 transitions. [2018-11-18 12:44:25,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-18 12:44:25,105 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 202 states and 252 transitions. [2018-11-18 12:44:25,106 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 83 [2018-11-18 12:44:25,107 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 202 states to 199 states and 249 transitions. [2018-11-18 12:44:25,107 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 187 [2018-11-18 12:44:25,107 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 190 [2018-11-18 12:44:25,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 199 states and 249 transitions. [2018-11-18 12:44:25,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:44:25,108 INFO L705 BuchiCegarLoop]: Abstraction has 199 states and 249 transitions. [2018-11-18 12:44:25,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states and 249 transitions. [2018-11-18 12:44:25,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 137. [2018-11-18 12:44:25,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-11-18 12:44:25,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 172 transitions. [2018-11-18 12:44:25,112 INFO L728 BuchiCegarLoop]: Abstraction has 137 states and 172 transitions. [2018-11-18 12:44:25,112 INFO L608 BuchiCegarLoop]: Abstraction has 137 states and 172 transitions. [2018-11-18 12:44:25,112 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-18 12:44:25,112 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 137 states and 172 transitions. [2018-11-18 12:44:25,112 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 65 [2018-11-18 12:44:25,112 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:44:25,112 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:44:25,113 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:44:25,113 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-18 12:44:25,113 INFO L794 eck$LassoCheckResult]: Stem: 4289#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4285#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 4280#L565 assume !(main_~array_size~0 < 1); 4281#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;assume { :begin_inline_lis } true;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 4268#L552-4 assume true; 4269#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 4296#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 4270#L552-4 assume true; 4271#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 4297#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 4298#L552-4 assume true; 4301#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 4302#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 4300#L552-4 assume true; 4295#L552-1 assume !(lis_~i~0 < lis_~N); 4272#L552-5 lis_~i~0 := 1; 4273#L554-4 assume true; 4286#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 4288#L555-4 assume true; 4315#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 4314#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 4310#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 4311#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 4367#L555-4 assume true; 4306#L555-1 assume !(lis_~j~0 < lis_~i~0); 4293#L554-3 [2018-11-18 12:44:25,113 INFO L796 eck$LassoCheckResult]: Loop: 4293#L554-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 4294#L554-4 assume true; 4373#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 4372#L555-4 assume true; 4371#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 4368#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 4369#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8; 4393#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 4398#L555-4 assume true; 4397#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 4320#L556 assume !lis_#t~short11; 4396#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8; 4382#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 4385#L555-4 assume true; 4319#L555-1 assume !(lis_~j~0 < lis_~i~0); 4293#L554-3 [2018-11-18 12:44:25,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:44:25,113 INFO L82 PathProgramCache]: Analyzing trace with hash 961755135, now seen corresponding path program 2 times [2018-11-18 12:44:25,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:44:25,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:44:25,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:25,114 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:44:25,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:25,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:44:25,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:44:25,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:44:25,139 INFO L82 PathProgramCache]: Analyzing trace with hash 2022789316, now seen corresponding path program 1 times [2018-11-18 12:44:25,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:44:25,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:44:25,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:25,140 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:44:25,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:25,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:44:25,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:44:25,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:44:25,146 INFO L82 PathProgramCache]: Analyzing trace with hash 876829958, now seen corresponding path program 3 times [2018-11-18 12:44:25,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:44:25,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:44:25,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:25,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:44:25,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:25,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:44:25,617 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 18 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 12:44:25,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:44:25,617 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_564e3793-cc27-4c48-b0d5-76f0bde905ba/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:44:25,630 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 12:44:25,671 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-18 12:44:25,671 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 12:44:25,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:44:25,695 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:25,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-18 12:44:25,711 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:25,712 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:25,713 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-18 12:44:25,713 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:44:25,717 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:44:25,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:44:25,722 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:11 [2018-11-18 12:44:25,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 28 [2018-11-18 12:44:25,740 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 12 treesize of output 11 [2018-11-18 12:44:25,741 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:44:25,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-11-18 12:44:25,750 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 12 treesize of output 11 [2018-11-18 12:44:25,750 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:44:25,755 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:44:25,758 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:44:25,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:44:25,764 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:50, output treesize:33 [2018-11-18 12:44:25,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 44 [2018-11-18 12:44:25,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2018-11-18 12:44:25,815 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:44:25,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2018-11-18 12:44:25,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 19 [2018-11-18 12:44:25,834 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:44:25,840 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:44:25,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:44:25,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:44:25,853 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:64, output treesize:47 [2018-11-18 12:44:25,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 68 [2018-11-18 12:44:25,918 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:25,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 44 [2018-11-18 12:44:25,920 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:44:25,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 64 [2018-11-18 12:44:25,942 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:25,944 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:25,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 59 [2018-11-18 12:44:25,953 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:44:25,969 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:44:25,977 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:44:25,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:44:25,990 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:90, output treesize:73 [2018-11-18 12:44:26,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 92 [2018-11-18 12:44:26,216 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:26,221 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:26,225 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:26,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 104 [2018-11-18 12:44:26,241 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-11-18 12:44:26,308 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:26,309 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 95 treesize of output 100 [2018-11-18 12:44:26,312 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:26,313 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:26,314 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:44:26,316 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:26,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 95 [2018-11-18 12:44:26,320 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:44:26,340 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:44:26,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 90 [2018-11-18 12:44:26,349 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:26,356 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:26,360 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:26,361 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:26,361 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:26,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 111 [2018-11-18 12:44:26,367 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 12:44:26,390 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:44:26,395 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:26,396 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 95 treesize of output 100 [2018-11-18 12:44:26,400 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:26,400 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:44:26,401 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:26,403 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:26,411 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:26,412 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 109 [2018-11-18 12:44:26,412 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 12:44:26,431 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:44:26,470 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 12:44:26,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 3 xjuncts. [2018-11-18 12:44:26,526 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:132, output treesize:284 [2018-11-18 12:44:26,964 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 18 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 12:44:26,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:44:26,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 29 [2018-11-18 12:44:27,104 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 78 [2018-11-18 12:44:27,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-18 12:44:27,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=733, Unknown=0, NotChecked=0, Total=812 [2018-11-18 12:44:27,127 INFO L87 Difference]: Start difference. First operand 137 states and 172 transitions. cyclomatic complexity: 41 Second operand 29 states. [2018-11-18 12:44:29,345 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 107 [2018-11-18 12:44:43,067 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 105 [2018-11-18 12:44:44,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:44:44,036 INFO L93 Difference]: Finished difference Result 465 states and 590 transitions. [2018-11-18 12:44:44,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-11-18 12:44:44,036 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 465 states and 590 transitions. [2018-11-18 12:44:44,038 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 239 [2018-11-18 12:44:44,040 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 465 states to 464 states and 589 transitions. [2018-11-18 12:44:44,040 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 450 [2018-11-18 12:44:44,040 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 450 [2018-11-18 12:44:44,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 464 states and 589 transitions. [2018-11-18 12:44:44,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:44:44,041 INFO L705 BuchiCegarLoop]: Abstraction has 464 states and 589 transitions. [2018-11-18 12:44:44,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states and 589 transitions. [2018-11-18 12:44:44,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 261. [2018-11-18 12:44:44,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-11-18 12:44:44,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 328 transitions. [2018-11-18 12:44:44,047 INFO L728 BuchiCegarLoop]: Abstraction has 261 states and 328 transitions. [2018-11-18 12:44:44,047 INFO L608 BuchiCegarLoop]: Abstraction has 261 states and 328 transitions. [2018-11-18 12:44:44,047 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-18 12:44:44,047 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 261 states and 328 transitions. [2018-11-18 12:44:44,048 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 141 [2018-11-18 12:44:44,048 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:44:44,048 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:44:44,048 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:44:44,049 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 2, 1, 1, 1, 1] [2018-11-18 12:44:44,049 INFO L794 eck$LassoCheckResult]: Stem: 5144#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5140#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 5135#L565 assume !(main_~array_size~0 < 1); 5136#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;assume { :begin_inline_lis } true;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 5123#L552-4 assume true; 5124#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 5156#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 5157#L552-4 assume true; 5158#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 5159#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 5125#L552-4 assume true; 5126#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 5153#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 5154#L552-4 assume true; 5149#L552-1 assume !(lis_~i~0 < lis_~N); 5127#L552-5 lis_~i~0 := 1; 5128#L554-4 assume true; 5161#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 5212#L555-4 assume true; 5185#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 5186#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 5301#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 5296#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 5234#L555-4 assume true; 5231#L555-1 assume !(lis_~j~0 < lis_~i~0); 5230#L554-3 [2018-11-18 12:44:44,049 INFO L796 eck$LassoCheckResult]: Loop: 5230#L554-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 5229#L554-4 assume true; 5228#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 5227#L555-4 assume true; 5226#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 5223#L556 assume !lis_#t~short11; 5225#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8; 5308#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 5307#L555-4 assume true; 5306#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 5277#L556 assume !lis_#t~short11; 5276#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8; 5255#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 5235#L555-4 assume true; 5232#L555-1 assume !(lis_~j~0 < lis_~i~0); 5230#L554-3 [2018-11-18 12:44:44,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:44:44,049 INFO L82 PathProgramCache]: Analyzing trace with hash 961755135, now seen corresponding path program 3 times [2018-11-18 12:44:44,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:44:44,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:44:44,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:44,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:44:44,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:44,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:44:44,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:44:44,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:44:44,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1629762306, now seen corresponding path program 1 times [2018-11-18 12:44:44,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:44:44,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:44:44,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:44,074 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:44:44,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:44,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:44:44,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:44:44,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:44:44,080 INFO L82 PathProgramCache]: Analyzing trace with hash 483802948, now seen corresponding path program 4 times [2018-11-18 12:44:44,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:44:44,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:44:44,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:44,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:44:44,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:44,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:44:44,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:44:45,330 WARN L180 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 222 DAG size of output: 164 [2018-11-18 12:44:46,057 WARN L180 SmtUtils]: Spent 721.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2018-11-18 12:44:46,059 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:44:46,059 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:44:46,059 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:44:46,059 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:44:46,059 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 12:44:46,059 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:44:46,059 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:44:46,059 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:44:46,059 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-termination.c.i_Iteration13_Lasso [2018-11-18 12:44:46,059 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:44:46,060 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:44:46,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-18 12:44:46,062 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-18 12:44:46,064 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-18 12:44:46,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-18 12:44:46,066 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-18 12:44:46,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-18 12:44:46,068 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-18 12:44:47,001 WARN L180 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 102 [2018-11-18 12:44:47,166 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 69 [2018-11-18 12:44:47,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-18 12:44:47,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:44:47,170 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-18 12:44:47,171 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-18 12:44:47,172 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-18 12:44:47,173 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-18 12:44:47,173 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-18 12:44:47,175 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-18 12:44:47,176 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-18 12:44:47,177 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-18 12:44:47,178 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-18 12:44:47,179 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-18 12:44:47,180 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-18 12:44:47,180 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-18 12:44:47,182 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-18 12:44:47,183 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-18 12:44:47,516 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:44:47,516 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 12:44:47,517 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:44:47,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:47,517 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:44:47,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:47,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:47,517 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:47,518 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:44:47,518 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:44:47,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:47,518 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:44:47,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:47,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:47,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:47,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:47,519 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:44:47,519 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:44:47,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:47,520 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:44:47,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:47,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:44:47,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:47,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:47,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:47,521 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:44:47,522 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:44:47,522 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:47,522 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:44:47,522 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:47,522 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:44:47,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:47,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:47,523 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:47,523 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:44:47,523 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:44:47,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:47,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:44:47,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:47,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:47,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:47,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:47,524 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:44:47,524 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:44:47,527 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:47,527 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:44:47,527 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:47,527 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:44:47,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:47,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:47,528 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:47,528 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:44:47,528 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:44:47,528 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:47,528 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:44:47,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:47,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:47,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:47,529 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:47,529 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:44:47,529 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:44:47,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:47,531 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:44:47,531 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:47,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:47,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:47,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:47,531 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:44:47,532 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:44:47,532 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:47,533 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:44:47,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:47,533 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:44:47,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:47,533 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:47,534 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:44:47,534 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:44:47,539 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:47,539 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:44:47,540 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:47,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:47,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:47,540 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:47,541 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:44:47,541 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:44:47,543 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 12:44:47,545 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 12:44:47,545 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 12:44:47,546 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 12:44:47,546 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-18 12:44:47,546 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 12:44:47,547 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_lis_~best~0.base) (+ (* 4 ULTIMATE.start_lis_~i~0) ULTIMATE.start_lis_~best~0.offset))_3, v_rep(select (select #memory_int ULTIMATE.start_lis_~best~0.base) (+ ULTIMATE.start_lis_~best~0.offset 4))_3) = 2*v_rep(select (select #memory_int ULTIMATE.start_lis_~best~0.base) (+ (* 4 ULTIMATE.start_lis_~i~0) ULTIMATE.start_lis_~best~0.offset))_3 - 2*v_rep(select (select #memory_int ULTIMATE.start_lis_~best~0.base) (+ ULTIMATE.start_lis_~best~0.offset 4))_3 + 1 Supporting invariants [-1*v_rep(select (select #memory_int ULTIMATE.start_lis_~best~0.base) (+ ULTIMATE.start_lis_~best~0.offset 8))_1 + 1*v_rep(select (select #memory_int ULTIMATE.start_lis_~best~0.base) (+ ULTIMATE.start_lis_~best~0.offset 4))_3 - 1 >= 0] [2018-11-18 12:44:47,744 INFO L297 tatePredicateManager]: 54 out of 55 supporting invariants were superfluous and have been removed [2018-11-18 12:44:47,745 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 12:44:47,746 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 12:44:47,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:44:47,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:44:47,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:44:47,777 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 11 treesize of output 14 [2018-11-18 12:44:47,783 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:47,783 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:47,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 12:44:47,784 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:44:47,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:44:47,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:44:47,790 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:9 [2018-11-18 12:44:47,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 28 [2018-11-18 12:44:47,801 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 12 treesize of output 11 [2018-11-18 12:44:47,802 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:44:47,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-11-18 12:44:47,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-18 12:44:47,810 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:44:47,814 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:44:47,817 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:44:47,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:44:47,823 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:48, output treesize:31 [2018-11-18 12:44:47,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 44 [2018-11-18 12:44:47,855 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:47,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-18 12:44:47,856 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:44:47,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2018-11-18 12:44:47,869 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:47,870 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:47,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 35 [2018-11-18 12:44:47,870 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:44:47,877 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:44:47,881 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:44:47,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:44:47,889 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:62, output treesize:45 [2018-11-18 12:44:47,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 56 [2018-11-18 12:44:47,939 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:47,940 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:47,941 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:47,941 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-11-18 12:44:47,942 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:44:47,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 52 [2018-11-18 12:44:47,959 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:47,959 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:47,960 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:47,961 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:47,961 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:47,962 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:47,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 78 [2018-11-18 12:44:47,963 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:44:47,975 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:44:47,981 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:44:47,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:44:47,990 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:71, output treesize:56 [2018-11-18 12:44:48,057 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:48,058 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 88 [2018-11-18 12:44:48,061 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:48,062 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:48,064 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:48,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 62 [2018-11-18 12:44:48,066 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:44:48,083 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:48,084 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 70 treesize of output 73 [2018-11-18 12:44:48,086 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:48,087 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:48,088 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:48,088 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:44:48,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 70 [2018-11-18 12:44:48,089 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:44:48,101 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:44:48,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:44:48,116 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 12:44:48,116 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:101, output treesize:62 [2018-11-18 12:44:48,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:44:48,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:44:48,247 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:44:48,248 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.10 stem predicates 6 loop predicates [2018-11-18 12:44:48,248 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 261 states and 328 transitions. cyclomatic complexity: 79 Second operand 16 states. [2018-11-18 12:44:48,529 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 261 states and 328 transitions. cyclomatic complexity: 79. Second operand 16 states. Result 381 states and 478 transitions. Complement of second has 24 states. [2018-11-18 12:44:48,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 18 states 11 stem states 5 non-accepting loop states 2 accepting loop states [2018-11-18 12:44:48,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-18 12:44:48,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 63 transitions. [2018-11-18 12:44:48,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 63 transitions. Stem has 25 letters. Loop has 15 letters. [2018-11-18 12:44:48,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:44:48,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 63 transitions. Stem has 40 letters. Loop has 15 letters. [2018-11-18 12:44:48,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:44:48,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 63 transitions. Stem has 25 letters. Loop has 30 letters. [2018-11-18 12:44:48,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:44:48,531 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 381 states and 478 transitions. [2018-11-18 12:44:48,532 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 153 [2018-11-18 12:44:48,533 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 381 states to 357 states and 447 transitions. [2018-11-18 12:44:48,533 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 304 [2018-11-18 12:44:48,533 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 309 [2018-11-18 12:44:48,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 357 states and 447 transitions. [2018-11-18 12:44:48,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:44:48,533 INFO L705 BuchiCegarLoop]: Abstraction has 357 states and 447 transitions. [2018-11-18 12:44:48,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states and 447 transitions. [2018-11-18 12:44:48,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 329. [2018-11-18 12:44:48,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-11-18 12:44:48,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 409 transitions. [2018-11-18 12:44:48,537 INFO L728 BuchiCegarLoop]: Abstraction has 329 states and 409 transitions. [2018-11-18 12:44:48,537 INFO L608 BuchiCegarLoop]: Abstraction has 329 states and 409 transitions. [2018-11-18 12:44:48,537 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-18 12:44:48,537 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 329 states and 409 transitions. [2018-11-18 12:44:48,537 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 141 [2018-11-18 12:44:48,537 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:44:48,537 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:44:48,538 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:44:48,538 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 12:44:48,538 INFO L794 eck$LassoCheckResult]: Stem: 6213#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6207#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 6197#L565 assume !(main_~array_size~0 < 1); 6198#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;assume { :begin_inline_lis } true;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 6183#L552-4 assume true; 6184#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 6224#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 6185#L552-4 assume true; 6186#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 6250#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 6249#L552-4 assume true; 6248#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 6247#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 6244#L552-4 assume true; 6223#L552-1 assume !(lis_~i~0 < lis_~N); 6187#L552-5 lis_~i~0 := 1; 6188#L554-4 assume true; 6208#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 6209#L555-4 assume true; 6332#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 6331#L556 assume !lis_#t~short11; 6330#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8; 6329#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 6328#L555-4 assume true; 6327#L555-1 assume !(lis_~j~0 < lis_~i~0); 6325#L554-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 6326#L554-4 assume true; 6321#L554-1 assume !(lis_~i~0 < lis_~N); 6227#L554-5 lis_~i~0 := 0; 6196#L558-4 [2018-11-18 12:44:48,538 INFO L796 eck$LassoCheckResult]: Loop: 6196#L558-4 assume true; 6189#L558-1 assume !!(lis_~i~0 < lis_~N);call lis_#t~mem14 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4); 6190#L559 assume lis_~max~0 < lis_#t~mem14;havoc lis_#t~mem14;call lis_#t~mem15 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);lis_~max~0 := lis_#t~mem15;havoc lis_#t~mem15; 6195#L558-3 lis_#t~post13 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post13;havoc lis_#t~post13; 6196#L558-4 [2018-11-18 12:44:48,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:44:48,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1699714880, now seen corresponding path program 1 times [2018-11-18 12:44:48,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:44:48,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:44:48,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:48,539 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:44:48,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:48,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:44:48,612 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 12:44:48,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:44:48,613 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_564e3793-cc27-4c48-b0d5-76f0bde905ba/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:44:48,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:44:48,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:44:48,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:44:48,689 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 12:44:48,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:44:48,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2018-11-18 12:44:48,716 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 12:44:48,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:44:48,717 INFO L82 PathProgramCache]: Analyzing trace with hash 2991114, now seen corresponding path program 1 times [2018-11-18 12:44:48,717 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:44:48,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:44:48,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:48,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:44:48,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:48,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:44:48,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:44:48,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 12:44:48,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-11-18 12:44:48,744 INFO L87 Difference]: Start difference. First operand 329 states and 409 transitions. cyclomatic complexity: 94 Second operand 14 states. [2018-11-18 12:44:48,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:44:48,885 INFO L93 Difference]: Finished difference Result 444 states and 544 transitions. [2018-11-18 12:44:48,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 12:44:48,886 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 444 states and 544 transitions. [2018-11-18 12:44:48,888 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 165 [2018-11-18 12:44:48,889 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 444 states to 444 states and 544 transitions. [2018-11-18 12:44:48,889 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 362 [2018-11-18 12:44:48,890 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 362 [2018-11-18 12:44:48,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 444 states and 544 transitions. [2018-11-18 12:44:48,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:44:48,890 INFO L705 BuchiCegarLoop]: Abstraction has 444 states and 544 transitions. [2018-11-18 12:44:48,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states and 544 transitions. [2018-11-18 12:44:48,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 333. [2018-11-18 12:44:48,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-11-18 12:44:48,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 410 transitions. [2018-11-18 12:44:48,895 INFO L728 BuchiCegarLoop]: Abstraction has 333 states and 410 transitions. [2018-11-18 12:44:48,895 INFO L608 BuchiCegarLoop]: Abstraction has 333 states and 410 transitions. [2018-11-18 12:44:48,895 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-18 12:44:48,896 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 333 states and 410 transitions. [2018-11-18 12:44:48,896 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 141 [2018-11-18 12:44:48,897 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:44:48,897 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:44:48,897 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:44:48,897 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 2, 1, 1, 1, 1] [2018-11-18 12:44:48,897 INFO L794 eck$LassoCheckResult]: Stem: 7100#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7095#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 7087#L565 assume !(main_~array_size~0 < 1); 7088#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;assume { :begin_inline_lis } true;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 7073#L552-4 assume true; 7074#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 7119#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 7075#L552-4 assume true; 7076#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 7106#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 7129#L552-4 assume true; 7130#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 7126#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 7127#L552-4 assume true; 7104#L552-1 assume !(lis_~i~0 < lis_~N); 7105#L552-5 lis_~i~0 := 1; 7152#L554-4 assume true; 7153#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 7147#L555-4 assume true; 7148#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 7143#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 7144#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 7139#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 7140#L555-4 assume true; 7135#L555-1 assume !(lis_~j~0 < lis_~i~0); 7136#L554-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 7172#L554-4 assume true; 7096#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 7097#L555-4 assume true; 7297#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 7396#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 7278#L556-2 [2018-11-18 12:44:48,897 INFO L796 eck$LassoCheckResult]: Loop: 7278#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 7279#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 7405#L555-4 assume true; 7404#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 7305#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 7200#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 7197#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 7198#L555-4 assume true; 7303#L555-1 assume !(lis_~j~0 < lis_~i~0); 7304#L554-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 7390#L554-4 assume true; 7389#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 7388#L555-4 assume true; 7387#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 7385#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 7278#L556-2 [2018-11-18 12:44:48,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:44:48,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1030425575, now seen corresponding path program 3 times [2018-11-18 12:44:48,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:44:48,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:44:48,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:48,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:44:48,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:48,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:44:48,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:44:48,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:44:48,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1784219666, now seen corresponding path program 4 times [2018-11-18 12:44:48,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:44:48,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:44:48,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:48,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:44:48,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:48,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:44:48,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:44:48,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:44:48,950 INFO L82 PathProgramCache]: Analyzing trace with hash 925102956, now seen corresponding path program 4 times [2018-11-18 12:44:48,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:44:48,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:44:48,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:48,951 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:44:48,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:48,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:44:49,048 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 13 proven. 43 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 12:44:49,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:44:49,048 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_564e3793-cc27-4c48-b0d5-76f0bde905ba/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:44:49,061 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 12:44:49,090 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 12:44:49,090 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 12:44:49,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:44:49,165 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 38 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 12:44:49,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:44:49,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2018-11-18 12:44:49,648 WARN L180 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 129 [2018-11-18 12:44:49,976 WARN L180 SmtUtils]: Spent 323.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-11-18 12:44:49,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-18 12:44:49,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2018-11-18 12:44:49,977 INFO L87 Difference]: Start difference. First operand 333 states and 410 transitions. cyclomatic complexity: 91 Second operand 19 states. [2018-11-18 12:44:50,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:44:50,244 INFO L93 Difference]: Finished difference Result 492 states and 602 transitions. [2018-11-18 12:44:50,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-18 12:44:50,245 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 492 states and 602 transitions. [2018-11-18 12:44:50,246 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 122 [2018-11-18 12:44:50,248 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 492 states to 446 states and 548 transitions. [2018-11-18 12:44:50,248 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 372 [2018-11-18 12:44:50,248 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 372 [2018-11-18 12:44:50,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 446 states and 548 transitions. [2018-11-18 12:44:50,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:44:50,249 INFO L705 BuchiCegarLoop]: Abstraction has 446 states and 548 transitions. [2018-11-18 12:44:50,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states and 548 transitions. [2018-11-18 12:44:50,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 237. [2018-11-18 12:44:50,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-11-18 12:44:50,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 288 transitions. [2018-11-18 12:44:50,253 INFO L728 BuchiCegarLoop]: Abstraction has 237 states and 288 transitions. [2018-11-18 12:44:50,253 INFO L608 BuchiCegarLoop]: Abstraction has 237 states and 288 transitions. [2018-11-18 12:44:50,253 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-18 12:44:50,253 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 237 states and 288 transitions. [2018-11-18 12:44:50,254 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 76 [2018-11-18 12:44:50,254 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:44:50,254 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:44:50,255 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:44:50,255 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 12:44:50,255 INFO L794 eck$LassoCheckResult]: Stem: 8108#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8103#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 8096#L565 assume !(main_~array_size~0 < 1); 8097#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;assume { :begin_inline_lis } true;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 8081#L552-4 assume true; 8082#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 8123#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 8124#L552-4 assume true; 8131#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 8132#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 8083#L552-4 assume true; 8084#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 8148#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 8126#L552-4 assume true; 8127#L552-1 assume !(lis_~i~0 < lis_~N); 8085#L552-5 lis_~i~0 := 1; 8086#L554-4 assume true; 8172#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 8173#L555-4 assume true; 8179#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 8177#L556 assume !lis_#t~short11; 8167#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8; 8168#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 8230#L555-4 assume true; 8226#L555-1 assume !(lis_~j~0 < lis_~i~0); 8227#L554-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 8223#L554-4 assume true; 8224#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 8310#L555-4 assume true; 8309#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 8308#L556 assume !lis_#t~short11; 8295#L556-2 [2018-11-18 12:44:50,255 INFO L796 eck$LassoCheckResult]: Loop: 8295#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8; 8317#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 8316#L555-4 assume true; 8314#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 8294#L556 assume !lis_#t~short11; 8295#L556-2 [2018-11-18 12:44:50,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:44:50,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1338463145, now seen corresponding path program 1 times [2018-11-18 12:44:50,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:44:50,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:44:50,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:50,256 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:44:50,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:50,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:44:50,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:44:50,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:44:50,272 INFO L82 PathProgramCache]: Analyzing trace with hash 79251175, now seen corresponding path program 1 times [2018-11-18 12:44:50,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:44:50,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:44:50,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:50,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:44:50,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:50,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:44:50,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:44:50,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:44:50,276 INFO L82 PathProgramCache]: Analyzing trace with hash 977009727, now seen corresponding path program 2 times [2018-11-18 12:44:50,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:44:50,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:44:50,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:50,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:44:50,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:50,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:44:50,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:44:51,356 WARN L180 SmtUtils]: Spent 1.00 s on a formula simplification. DAG size of input: 217 DAG size of output: 167 [2018-11-18 12:44:51,638 WARN L180 SmtUtils]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2018-11-18 12:44:51,639 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:44:51,639 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:44:51,639 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:44:51,639 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:44:51,639 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 12:44:51,639 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:44:51,640 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:44:51,640 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:44:51,640 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-termination.c.i_Iteration16_Lasso [2018-11-18 12:44:51,640 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:44:51,640 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:44:51,641 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-18 12:44:51,643 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-18 12:44:51,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:44:51,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-18 12:44:51,649 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-18 12:44:51,649 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-18 12:44:51,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-18 12:44:51,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:44:51,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:44:51,655 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-18 12:44:51,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-18 12:44:51,657 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-18 12:44:52,168 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 100 [2018-11-18 12:44:52,225 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-18 12:44:52,228 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-18 12:44:52,229 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-18 12:44:52,230 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-18 12:44:52,231 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-18 12:44:52,232 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-18 12:44:52,233 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-18 12:44:52,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:44:52,235 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-18 12:44:52,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:44:52,237 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-18 12:44:52,537 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:44:52,537 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 12:44:52,538 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:44:52,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:52,538 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:44:52,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:52,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:52,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:52,538 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:44:52,538 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:44:52,539 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:52,539 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:44:52,539 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:52,539 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:44:52,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:52,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:52,540 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:52,540 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:44:52,540 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:44:52,540 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:52,541 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:44:52,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:52,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:52,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:52,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:52,541 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:44:52,542 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:44:52,542 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:52,542 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:44:52,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:52,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:52,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:52,543 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:52,543 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:44:52,543 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:44:52,544 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:52,545 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:44:52,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:52,545 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:44:52,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:52,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:52,545 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:52,545 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:44:52,546 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:44:52,546 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:52,546 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:44:52,546 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:52,546 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:44:52,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:52,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:52,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:52,547 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:44:52,547 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:44:52,547 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:52,547 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:44:52,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:52,548 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:44:52,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:52,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:52,548 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:52,548 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:44:52,548 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:44:52,549 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:52,549 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:44:52,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:52,549 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:44:52,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:52,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:52,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:52,550 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:44:52,550 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:44:52,550 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:52,550 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:44:52,551 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:52,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:52,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:52,551 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:52,551 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:44:52,552 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:44:52,552 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:52,553 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:44:52,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:52,553 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:44:52,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:52,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:52,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:52,554 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:44:52,554 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:44:52,554 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:52,554 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:44:52,554 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:52,554 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:44:52,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:52,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:52,555 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:52,555 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:44:52,555 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:44:52,555 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:52,556 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:44:52,556 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:52,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:52,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:52,556 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:52,557 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:44:52,557 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:44:52,558 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:52,558 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:44:52,558 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:52,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:52,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:52,558 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:52,559 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:44:52,559 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:44:52,560 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:52,560 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:44:52,560 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:52,561 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:44:52,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:52,561 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:52,561 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:44:52,561 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:44:52,563 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:52,563 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:44:52,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:52,564 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:44:52,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:52,564 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:52,565 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:44:52,565 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:44:52,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:52,568 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:44:52,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:52,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:52,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:52,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:52,569 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:44:52,569 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:44:52,570 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:52,570 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:44:52,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:52,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:52,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:52,571 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:52,571 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:44:52,571 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:44:52,572 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:52,572 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:44:52,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:52,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:52,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:52,573 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:52,573 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:44:52,574 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:44:52,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:52,575 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:44:52,575 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:52,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:52,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:52,575 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:52,576 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:44:52,576 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:44:52,577 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:52,577 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:44:52,577 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:52,577 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:44:52,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:52,578 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:52,578 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:44:52,578 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:44:52,580 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:52,580 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:44:52,580 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:52,580 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:52,581 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:52,581 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:52,581 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:44:52,581 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:44:52,582 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:52,582 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:44:52,583 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:52,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:52,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:52,583 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:52,583 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:44:52,584 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:44:52,584 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:52,585 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:44:52,585 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:52,585 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:52,585 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:52,585 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:52,586 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:44:52,586 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:44:52,586 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:52,587 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:44:52,587 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:52,587 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:52,587 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:52,587 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:52,588 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:44:52,588 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:44:52,591 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:52,591 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:44:52,591 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:52,591 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:52,591 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:52,591 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:52,592 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:44:52,592 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:44:52,594 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:44:52,594 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:44:52,595 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:44:52,595 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:44:52,595 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:44:52,595 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:44:52,597 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:44:52,597 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:44:52,607 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 12:44:52,618 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-18 12:44:52,618 INFO L444 ModelExtractionUtils]: 40 out of 46 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-18 12:44:52,618 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 12:44:52,618 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 12:44:52,619 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 12:44:52,619 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_~i~0) = -4*ULTIMATE.start_lis_~j~0 + 1*ULTIMATE.start_lis_~i~0 Supporting invariants [] [2018-11-18 12:44:52,911 INFO L297 tatePredicateManager]: 61 out of 63 supporting invariants were superfluous and have been removed [2018-11-18 12:44:52,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:44:52,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:44:52,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:44:52,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:44:52,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:44:52,991 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-18 12:44:52,991 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 3 loop predicates [2018-11-18 12:44:52,991 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 237 states and 288 transitions. cyclomatic complexity: 60 Second operand 8 states. [2018-11-18 12:44:53,077 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 237 states and 288 transitions. cyclomatic complexity: 60. Second operand 8 states. Result 513 states and 647 transitions. Complement of second has 11 states. [2018-11-18 12:44:53,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 2 non-accepting loop states 2 accepting loop states [2018-11-18 12:44:53,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 12:44:53,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 59 transitions. [2018-11-18 12:44:53,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 59 transitions. Stem has 31 letters. Loop has 5 letters. [2018-11-18 12:44:53,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:44:53,078 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 12:44:53,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:44:53,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:44:53,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:44:53,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:44:53,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:44:53,162 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-18 12:44:53,162 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 3 loop predicates [2018-11-18 12:44:53,162 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 237 states and 288 transitions. cyclomatic complexity: 60 Second operand 8 states. [2018-11-18 12:44:53,263 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 237 states and 288 transitions. cyclomatic complexity: 60. Second operand 8 states. Result 520 states and 651 transitions. Complement of second has 13 states. [2018-11-18 12:44:53,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 4 stem states 3 non-accepting loop states 2 accepting loop states [2018-11-18 12:44:53,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 12:44:53,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 60 transitions. [2018-11-18 12:44:53,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 60 transitions. Stem has 31 letters. Loop has 5 letters. [2018-11-18 12:44:53,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:44:53,264 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 12:44:53,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:44:53,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:44:53,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:44:53,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:44:53,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:44:53,352 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-18 12:44:53,352 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 3 loop predicates [2018-11-18 12:44:53,352 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 237 states and 288 transitions. cyclomatic complexity: 60 Second operand 8 states. [2018-11-18 12:44:53,431 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 237 states and 288 transitions. cyclomatic complexity: 60. Second operand 8 states. Result 423 states and 525 transitions. Complement of second has 13 states. [2018-11-18 12:44:53,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 2 non-accepting loop states 2 accepting loop states [2018-11-18 12:44:53,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 12:44:53,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2018-11-18 12:44:53,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 62 transitions. Stem has 31 letters. Loop has 5 letters. [2018-11-18 12:44:53,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:44:53,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 62 transitions. Stem has 36 letters. Loop has 5 letters. [2018-11-18 12:44:53,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:44:53,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 62 transitions. Stem has 31 letters. Loop has 10 letters. [2018-11-18 12:44:53,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:44:53,433 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 423 states and 525 transitions. [2018-11-18 12:44:53,435 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 84 [2018-11-18 12:44:53,435 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 423 states to 354 states and 436 transitions. [2018-11-18 12:44:53,435 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 236 [2018-11-18 12:44:53,436 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 257 [2018-11-18 12:44:53,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 354 states and 436 transitions. [2018-11-18 12:44:53,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:44:53,436 INFO L705 BuchiCegarLoop]: Abstraction has 354 states and 436 transitions. [2018-11-18 12:44:53,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states and 436 transitions. [2018-11-18 12:44:53,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 299. [2018-11-18 12:44:53,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-11-18 12:44:53,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 377 transitions. [2018-11-18 12:44:53,440 INFO L728 BuchiCegarLoop]: Abstraction has 299 states and 377 transitions. [2018-11-18 12:44:53,440 INFO L608 BuchiCegarLoop]: Abstraction has 299 states and 377 transitions. [2018-11-18 12:44:53,440 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-11-18 12:44:53,440 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 299 states and 377 transitions. [2018-11-18 12:44:53,441 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 79 [2018-11-18 12:44:53,441 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:44:53,441 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:44:53,443 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:44:53,443 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 12:44:53,443 INFO L794 eck$LassoCheckResult]: Stem: 10479#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10474#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 10467#L565 assume !(main_~array_size~0 < 1); 10468#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;assume { :begin_inline_lis } true;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 10451#L552-4 assume true; 10452#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 10492#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 10453#L552-4 assume true; 10454#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 10495#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 10496#L552-4 assume true; 10516#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 10514#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 10511#L552-4 assume true; 10510#L552-1 assume !(lis_~i~0 < lis_~N); 10455#L552-5 lis_~i~0 := 1; 10456#L554-4 assume true; 10546#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 10545#L555-4 assume true; 10544#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 10543#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 10540#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 10539#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 10538#L555-4 assume true; 10537#L555-1 assume !(lis_~j~0 < lis_~i~0); 10485#L554-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 10486#L554-4 assume true; 10493#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 10732#L555-4 assume true; 10729#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 10726#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 10724#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 10719#L555-3 [2018-11-18 12:44:53,443 INFO L796 eck$LassoCheckResult]: Loop: 10719#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 10723#L555-4 assume true; 10722#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 10721#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 10718#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 10719#L555-3 [2018-11-18 12:44:53,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:44:53,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1878421804, now seen corresponding path program 5 times [2018-11-18 12:44:53,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:44:53,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:44:53,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:53,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:44:53,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:53,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:44:53,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:44:53,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:44:53,481 INFO L82 PathProgramCache]: Analyzing trace with hash 80566881, now seen corresponding path program 2 times [2018-11-18 12:44:53,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:44:53,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:44:53,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:53,482 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:44:53,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:53,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:44:53,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:44:53,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:44:53,487 INFO L82 PathProgramCache]: Analyzing trace with hash 999681046, now seen corresponding path program 6 times [2018-11-18 12:44:53,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:44:53,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:44:53,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:53,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:44:53,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:44:53,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:44:53,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:44:53,715 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 71 [2018-11-18 12:44:57,973 WARN L180 SmtUtils]: Spent 4.22 s on a formula simplification. DAG size of input: 288 DAG size of output: 207 [2018-11-18 12:44:59,986 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 149 [2018-11-18 12:44:59,988 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:44:59,988 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:44:59,988 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:44:59,988 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:44:59,988 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 12:44:59,988 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:44:59,988 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:44:59,989 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:44:59,989 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-termination.c.i_Iteration17_Lasso [2018-11-18 12:44:59,989 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:44:59,989 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:44:59,992 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-18 12:44:59,995 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-18 12:44:59,996 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-18 12:44:59,998 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-18 12:44:59,999 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-18 12:45:00,000 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-18 12:45:00,002 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-18 12:45:00,003 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-18 12:45:00,003 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-18 12:45:00,004 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-18 12:45:00,005 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-18 12:45:00,006 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-18 12:45:00,007 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-18 12:45:00,008 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-18 12:45:04,855 WARN L180 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 106 [2018-11-18 12:45:05,063 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 106 [2018-11-18 12:45:05,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-18 12:45:05,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-18 12:45:05,066 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-18 12:45:05,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-18 12:45:05,068 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-18 12:45:05,071 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-18 12:45:05,072 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-18 12:45:05,073 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-18 12:45:05,074 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-18 12:45:05,075 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-18 12:45:05,075 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-18 12:45:05,484 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:45:05,484 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 12:45:05,484 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:45:05,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:45:05,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:45:05,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:45:05,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:45:05,485 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:45:05,485 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:45:05,486 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:45:05,486 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:45:05,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:45:05,486 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:45:05,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:45:05,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:45:05,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:45:05,487 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:45:05,487 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:45:05,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:45:05,487 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:45:05,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:45:05,488 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:45:05,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:45:05,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:45:05,488 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:45:05,488 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:45:05,488 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:45:05,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:45:05,489 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:45:05,489 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:45:05,489 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:45:05,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:45:05,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:45:05,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:45:05,490 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:45:05,490 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:45:05,490 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:45:05,490 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:45:05,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:45:05,490 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:45:05,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:45:05,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:45:05,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:45:05,491 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:45:05,491 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:45:05,491 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:45:05,491 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:45:05,492 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:45:05,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:45:05,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:45:05,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:45:05,492 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:45:05,493 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:45:05,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:45:05,494 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:45:05,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:45:05,494 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:45:05,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:45:05,494 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:45:05,494 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:45:05,494 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:45:05,495 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:45:05,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:45:05,495 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:45:05,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:45:05,495 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:45:05,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:45:05,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:45:05,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:45:05,496 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:45:05,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:45:05,496 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:45:05,496 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:45:05,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:45:05,497 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:45:05,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:45:05,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:45:05,497 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:45:05,497 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:45:05,497 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:45:05,498 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:45:05,498 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:45:05,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:45:05,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:45:05,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:45:05,498 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:45:05,499 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:45:05,499 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:45:05,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:45:05,500 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:45:05,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:45:05,500 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:45:05,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:45:05,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:45:05,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:45:05,500 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:45:05,501 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:45:05,501 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:45:05,501 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:45:05,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:45:05,501 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:45:05,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:45:05,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:45:05,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:45:05,502 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:45:05,502 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:45:05,502 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:45:05,502 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:45:05,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:45:05,503 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:45:05,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:45:05,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:45:05,503 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:45:05,503 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:45:05,503 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:45:05,504 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:45:05,504 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:45:05,504 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:45:05,504 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:45:05,504 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:45:05,504 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:45:05,505 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:45:05,505 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:45:05,506 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:45:05,507 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:45:05,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:45:05,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:45:05,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:45:05,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:45:05,510 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:45:05,510 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:45:05,532 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 12:45:05,543 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 12:45:05,544 INFO L444 ModelExtractionUtils]: 51 out of 55 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 12:45:05,544 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 12:45:05,544 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 12:45:05,545 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 12:45:05,545 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~j~0) = -2*ULTIMATE.start_lis_~j~0 + 1 Supporting invariants [] [2018-11-18 12:45:06,983 INFO L297 tatePredicateManager]: 101 out of 102 supporting invariants were superfluous and have been removed [2018-11-18 12:45:06,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:45:07,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:45:07,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:45:07,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:45:07,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:45:07,042 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-18 12:45:07,042 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2018-11-18 12:45:07,042 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 299 states and 377 transitions. cyclomatic complexity: 91 Second operand 6 states. [2018-11-18 12:45:07,103 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 299 states and 377 transitions. cyclomatic complexity: 91. Second operand 6 states. Result 404 states and 531 transitions. Complement of second has 10 states. [2018-11-18 12:45:07,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 3 stem states 2 non-accepting loop states 2 accepting loop states [2018-11-18 12:45:07,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 12:45:07,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2018-11-18 12:45:07,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 59 transitions. Stem has 32 letters. Loop has 5 letters. [2018-11-18 12:45:07,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:45:07,104 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 12:45:07,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:45:07,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:45:07,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:45:07,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:45:07,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:45:07,162 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-18 12:45:07,162 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 3 loop predicates [2018-11-18 12:45:07,162 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 299 states and 377 transitions. cyclomatic complexity: 91 Second operand 6 states. [2018-11-18 12:45:07,222 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 299 states and 377 transitions. cyclomatic complexity: 91. Second operand 6 states. Result 414 states and 535 transitions. Complement of second has 10 states. [2018-11-18 12:45:07,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 3 stem states 2 non-accepting loop states 2 accepting loop states [2018-11-18 12:45:07,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 12:45:07,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2018-11-18 12:45:07,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 59 transitions. Stem has 32 letters. Loop has 5 letters. [2018-11-18 12:45:07,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:45:07,223 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 12:45:07,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:45:07,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:45:07,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:45:07,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:45:07,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:45:07,305 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-18 12:45:07,305 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2018-11-18 12:45:07,306 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 299 states and 377 transitions. cyclomatic complexity: 91 Second operand 6 states. [2018-11-18 12:45:07,382 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 299 states and 377 transitions. cyclomatic complexity: 91. Second operand 6 states. Result 452 states and 597 transitions. Complement of second has 12 states. [2018-11-18 12:45:07,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 3 stem states 2 non-accepting loop states 2 accepting loop states [2018-11-18 12:45:07,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 12:45:07,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2018-11-18 12:45:07,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 62 transitions. Stem has 32 letters. Loop has 5 letters. [2018-11-18 12:45:07,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:45:07,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 62 transitions. Stem has 37 letters. Loop has 5 letters. [2018-11-18 12:45:07,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:45:07,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 62 transitions. Stem has 32 letters. Loop has 10 letters. [2018-11-18 12:45:07,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:45:07,384 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 452 states and 597 transitions. [2018-11-18 12:45:07,386 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 73 [2018-11-18 12:45:07,387 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 452 states to 349 states and 452 transitions. [2018-11-18 12:45:07,387 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 198 [2018-11-18 12:45:07,388 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 217 [2018-11-18 12:45:07,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 349 states and 452 transitions. [2018-11-18 12:45:07,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:45:07,388 INFO L705 BuchiCegarLoop]: Abstraction has 349 states and 452 transitions. [2018-11-18 12:45:07,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states and 452 transitions. [2018-11-18 12:45:07,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 240. [2018-11-18 12:45:07,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-11-18 12:45:07,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 312 transitions. [2018-11-18 12:45:07,393 INFO L728 BuchiCegarLoop]: Abstraction has 240 states and 312 transitions. [2018-11-18 12:45:07,393 INFO L608 BuchiCegarLoop]: Abstraction has 240 states and 312 transitions. [2018-11-18 12:45:07,393 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-11-18 12:45:07,393 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 240 states and 312 transitions. [2018-11-18 12:45:07,394 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 69 [2018-11-18 12:45:07,394 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:45:07,394 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:45:07,394 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:45:07,394 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 12:45:07,394 INFO L794 eck$LassoCheckResult]: Stem: 12877#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12872#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 12863#L565 assume !(main_~array_size~0 < 1); 12864#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;assume { :begin_inline_lis } true;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 12847#L552-4 assume true; 12848#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 12890#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 12849#L552-4 assume true; 12850#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 12903#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 12900#L552-4 assume true; 12899#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 12898#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 12897#L552-4 assume true; 12894#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 12895#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 12893#L552-4 assume true; 12889#L552-1 assume !(lis_~i~0 < lis_~N); 12851#L552-5 lis_~i~0 := 1; 12852#L554-4 assume true; 12911#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 12912#L555-4 assume true; 12937#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 12935#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 12934#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8; 12933#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 12932#L555-4 assume true; 12931#L555-1 assume !(lis_~j~0 < lis_~i~0); 12930#L554-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 12929#L554-4 assume true; 12873#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 12874#L555-4 assume true; 12947#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 12945#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 12946#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8; 12962#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 12963#L555-4 assume true; 12959#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 12957#L556 [2018-11-18 12:45:07,395 INFO L796 eck$LassoCheckResult]: Loop: 12957#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 12954#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8; 12956#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 12950#L555-4 assume true; 12951#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 12957#L556 [2018-11-18 12:45:07,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:45:07,395 INFO L82 PathProgramCache]: Analyzing trace with hash 630795431, now seen corresponding path program 2 times [2018-11-18 12:45:07,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:45:07,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:45:07,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:45:07,396 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:45:07,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:45:07,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:45:07,769 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 13 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 12:45:07,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:45:07,769 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_564e3793-cc27-4c48-b0d5-76f0bde905ba/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:45:07,788 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 12:45:07,815 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 12:45:07,815 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 12:45:07,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:45:07,847 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:07,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-18 12:45:07,864 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:07,865 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:07,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-18 12:45:07,866 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:45:07,869 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:45:07,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:45:07,873 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:11 [2018-11-18 12:45:07,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 28 [2018-11-18 12:45:07,887 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 12 treesize of output 11 [2018-11-18 12:45:07,888 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:45:07,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-11-18 12:45:07,900 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 12 treesize of output 11 [2018-11-18 12:45:07,900 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:45:07,906 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:45:07,909 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:45:07,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:45:07,914 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:50, output treesize:33 [2018-11-18 12:45:07,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 44 [2018-11-18 12:45:07,955 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:07,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-18 12:45:07,957 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:45:07,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2018-11-18 12:45:07,971 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:07,972 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:07,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 35 [2018-11-18 12:45:07,973 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:45:07,981 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:45:07,986 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:45:07,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:45:07,994 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:64, output treesize:47 [2018-11-18 12:45:08,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 60 [2018-11-18 12:45:08,046 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:08,047 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:08,048 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:08,048 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2018-11-18 12:45:08,049 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:45:08,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 56 [2018-11-18 12:45:08,069 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:08,070 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:08,071 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:08,073 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:08,074 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:08,075 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:08,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 84 [2018-11-18 12:45:08,076 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:45:08,090 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:45:08,096 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:45:08,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:45:08,106 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:82, output treesize:65 [2018-11-18 12:45:08,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 76 [2018-11-18 12:45:08,164 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:08,165 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:08,166 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:08,167 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:08,168 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:08,168 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:08,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 85 [2018-11-18 12:45:08,169 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:45:08,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 72 [2018-11-18 12:45:08,194 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:08,194 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:08,195 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:08,196 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:08,197 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:08,197 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:08,198 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:08,199 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:08,199 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:08,200 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:08,201 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:08,201 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:08,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 157 [2018-11-18 12:45:08,202 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:45:08,224 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:45:08,232 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:45:08,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-18 12:45:08,245 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:100, output treesize:83 [2018-11-18 12:45:08,457 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 7 proven. 34 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 12:45:08,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:45:08,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 27 [2018-11-18 12:45:08,473 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 12:45:08,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:45:08,473 INFO L82 PathProgramCache]: Analyzing trace with hash 71820563, now seen corresponding path program 1 times [2018-11-18 12:45:08,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:45:08,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:45:08,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:45:08,474 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:45:08,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:45:08,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:45:08,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:45:08,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-18 12:45:08,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2018-11-18 12:45:08,622 INFO L87 Difference]: Start difference. First operand 240 states and 312 transitions. cyclomatic complexity: 83 Second operand 27 states. [2018-11-18 12:45:10,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:45:10,475 INFO L93 Difference]: Finished difference Result 320 states and 408 transitions. [2018-11-18 12:45:10,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-18 12:45:10,476 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 320 states and 408 transitions. [2018-11-18 12:45:10,477 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 106 [2018-11-18 12:45:10,478 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 320 states to 319 states and 407 transitions. [2018-11-18 12:45:10,478 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 226 [2018-11-18 12:45:10,478 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 226 [2018-11-18 12:45:10,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 319 states and 407 transitions. [2018-11-18 12:45:10,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:45:10,479 INFO L705 BuchiCegarLoop]: Abstraction has 319 states and 407 transitions. [2018-11-18 12:45:10,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states and 407 transitions. [2018-11-18 12:45:10,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 222. [2018-11-18 12:45:10,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-11-18 12:45:10,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 288 transitions. [2018-11-18 12:45:10,483 INFO L728 BuchiCegarLoop]: Abstraction has 222 states and 288 transitions. [2018-11-18 12:45:10,483 INFO L608 BuchiCegarLoop]: Abstraction has 222 states and 288 transitions. [2018-11-18 12:45:10,483 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-11-18 12:45:10,483 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 222 states and 288 transitions. [2018-11-18 12:45:10,484 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 64 [2018-11-18 12:45:10,484 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:45:10,484 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:45:10,484 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:45:10,484 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:45:10,484 INFO L794 eck$LassoCheckResult]: Stem: 13641#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 13636#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 13626#L565 assume !(main_~array_size~0 < 1); 13627#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;assume { :begin_inline_lis } true;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 13612#L552-4 assume true; 13613#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 13654#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 13614#L552-4 assume true; 13615#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 13665#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 13664#L552-4 assume true; 13663#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 13662#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 13661#L552-4 assume true; 13658#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 13659#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 13657#L552-4 assume true; 13653#L552-1 assume !(lis_~i~0 < lis_~N); 13616#L552-5 lis_~i~0 := 1; 13617#L554-4 assume true; 13675#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 13674#L555-4 assume true; 13673#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 13672#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 13671#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 13670#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 13669#L555-4 assume true; 13668#L555-1 assume !(lis_~j~0 < lis_~i~0); 13666#L554-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 13667#L554-4 assume true; 13637#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 13638#L555-4 assume true; 13741#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 13739#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 13733#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 13732#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 13729#L555-4 assume true; 13730#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 13720#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 13721#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8; 13815#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 13760#L555-4 assume true; 13830#L555-1 assume !(lis_~j~0 < lis_~i~0); 13648#L554-3 [2018-11-18 12:45:10,485 INFO L796 eck$LassoCheckResult]: Loop: 13648#L554-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 13649#L554-4 assume true; 13655#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 13692#L555-4 assume true; 13764#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 13763#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 13761#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 13642#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 13643#L555-4 assume true; 13632#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 13633#L556 assume !lis_#t~short11; 13621#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8; 13788#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 13757#L555-4 assume true; 13758#L555-1 assume !(lis_~j~0 < lis_~i~0); 13648#L554-3 [2018-11-18 12:45:10,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:45:10,485 INFO L82 PathProgramCache]: Analyzing trace with hash -487518553, now seen corresponding path program 1 times [2018-11-18 12:45:10,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:45:10,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:45:10,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:45:10,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:45:10,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:45:10,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:45:11,239 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 2 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:45:11,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:45:11,239 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_564e3793-cc27-4c48-b0d5-76f0bde905ba/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:45:11,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:45:11,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:45:11,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:45:11,267 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 11 treesize of output 14 [2018-11-18 12:45:11,271 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:11,272 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:11,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 12:45:11,272 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:45:11,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:45:11,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:45:11,277 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:8 [2018-11-18 12:45:11,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 32 [2018-11-18 12:45:11,348 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:11,349 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:11,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 40 [2018-11-18 12:45:11,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:45:11,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-11-18 12:45:11,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-18 12:45:11,363 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:45:11,367 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:45:11,370 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:45:11,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:45:11,375 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:59, output treesize:36 [2018-11-18 12:45:11,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 60 [2018-11-18 12:45:11,460 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:11,461 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:45:11,461 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:11,464 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:11,465 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:11,465 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:11,466 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:45:11,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 120 [2018-11-18 12:45:11,467 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:45:11,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 64 [2018-11-18 12:45:11,491 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:11,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-11-18 12:45:11,492 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:45:11,500 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:45:11,506 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:45:11,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 12:45:11,515 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:94, output treesize:71 [2018-11-18 12:45:11,599 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-18 12:45:11,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:45:11,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 12] total 32 [2018-11-18 12:45:11,615 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 12:45:11,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:45:11,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1342730946, now seen corresponding path program 2 times [2018-11-18 12:45:11,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:45:11,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:45:11,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:45:11,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:45:11,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:45:11,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:45:11,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:45:11,802 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 95 [2018-11-18 12:45:11,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-18 12:45:11,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=859, Unknown=0, NotChecked=0, Total=992 [2018-11-18 12:45:11,842 INFO L87 Difference]: Start difference. First operand 222 states and 288 transitions. cyclomatic complexity: 77 Second operand 32 states. [2018-11-18 12:45:16,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:45:16,093 INFO L93 Difference]: Finished difference Result 494 states and 636 transitions. [2018-11-18 12:45:16,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-11-18 12:45:16,094 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 494 states and 636 transitions. [2018-11-18 12:45:16,095 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 198 [2018-11-18 12:45:16,096 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 494 states to 494 states and 636 transitions. [2018-11-18 12:45:16,097 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 412 [2018-11-18 12:45:16,097 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 412 [2018-11-18 12:45:16,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 494 states and 636 transitions. [2018-11-18 12:45:16,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:45:16,097 INFO L705 BuchiCegarLoop]: Abstraction has 494 states and 636 transitions. [2018-11-18 12:45:16,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states and 636 transitions. [2018-11-18 12:45:16,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 364. [2018-11-18 12:45:16,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-11-18 12:45:16,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 481 transitions. [2018-11-18 12:45:16,103 INFO L728 BuchiCegarLoop]: Abstraction has 364 states and 481 transitions. [2018-11-18 12:45:16,103 INFO L608 BuchiCegarLoop]: Abstraction has 364 states and 481 transitions. [2018-11-18 12:45:16,103 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2018-11-18 12:45:16,103 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 364 states and 481 transitions. [2018-11-18 12:45:16,104 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 158 [2018-11-18 12:45:16,104 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:45:16,104 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:45:16,104 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:45:16,105 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-18 12:45:16,105 INFO L794 eck$LassoCheckResult]: Stem: 14651#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 14646#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 14637#L565 assume !(main_~array_size~0 < 1); 14638#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;assume { :begin_inline_lis } true;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 14623#L552-4 assume true; 14624#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 14701#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 14625#L552-4 assume true; 14626#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 14663#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 14667#L552-4 assume true; 14700#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 14699#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 14698#L552-4 assume true; 14696#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 14697#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 14695#L552-4 assume true; 14662#L552-1 assume !(lis_~i~0 < lis_~N); 14627#L552-5 lis_~i~0 := 1; 14628#L554-4 assume true; 14691#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 14688#L555-4 assume true; 14685#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 14682#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 14679#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 14676#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 14674#L555-4 assume true; 14672#L555-1 assume !(lis_~j~0 < lis_~i~0); 14669#L554-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 14670#L554-4 assume true; 14647#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 14648#L555-4 assume true; 14745#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 14742#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 14743#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 14747#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 14748#L555-4 assume true; 14753#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 14714#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 14715#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 14896#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 14761#L555-4 assume true; 14909#L555-1 assume !(lis_~j~0 < lis_~i~0); 14910#L554-3 [2018-11-18 12:45:16,105 INFO L796 eck$LassoCheckResult]: Loop: 14910#L554-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 14664#L554-4 assume true; 14665#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 14882#L555-4 assume true; 14883#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 14877#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 14878#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8; 14983#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 14982#L555-4 assume true; 14979#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 14960#L556 assume !lis_#t~short11; 14784#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8; 14966#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 14967#L555-4 assume true; 14962#L555-1 assume !(lis_~j~0 < lis_~i~0); 14910#L554-3 [2018-11-18 12:45:16,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:45:16,105 INFO L82 PathProgramCache]: Analyzing trace with hash -487578135, now seen corresponding path program 7 times [2018-11-18 12:45:16,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:45:16,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:45:16,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:45:16,106 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:45:16,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:45:16,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:45:16,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:45:16,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:45:16,154 INFO L82 PathProgramCache]: Analyzing trace with hash 2022789316, now seen corresponding path program 2 times [2018-11-18 12:45:16,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:45:16,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:45:16,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:45:16,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:45:16,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:45:16,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:45:16,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:45:16,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:45:16,160 INFO L82 PathProgramCache]: Analyzing trace with hash -656171556, now seen corresponding path program 5 times [2018-11-18 12:45:16,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:45:16,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:45:16,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:45:16,161 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:45:16,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:45:16,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:45:16,271 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 46 proven. 39 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-18 12:45:16,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:45:16,271 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_564e3793-cc27-4c48-b0d5-76f0bde905ba/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:45:16,279 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 12:45:16,545 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-11-18 12:45:16,545 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 12:45:16,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:45:16,579 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 73 proven. 9 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-18 12:45:16,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:45:16,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 16 [2018-11-18 12:45:16,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-18 12:45:16,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2018-11-18 12:45:16,715 INFO L87 Difference]: Start difference. First operand 364 states and 481 transitions. cyclomatic complexity: 133 Second operand 17 states. [2018-11-18 12:45:16,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:45:16,895 INFO L93 Difference]: Finished difference Result 472 states and 618 transitions. [2018-11-18 12:45:16,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 12:45:16,895 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 472 states and 618 transitions. [2018-11-18 12:45:16,897 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 220 [2018-11-18 12:45:16,899 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 472 states to 453 states and 597 transitions. [2018-11-18 12:45:16,899 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 378 [2018-11-18 12:45:16,899 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 398 [2018-11-18 12:45:16,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 453 states and 597 transitions. [2018-11-18 12:45:16,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:45:16,900 INFO L705 BuchiCegarLoop]: Abstraction has 453 states and 597 transitions. [2018-11-18 12:45:16,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states and 597 transitions. [2018-11-18 12:45:16,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 251. [2018-11-18 12:45:16,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-11-18 12:45:16,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 329 transitions. [2018-11-18 12:45:16,904 INFO L728 BuchiCegarLoop]: Abstraction has 251 states and 329 transitions. [2018-11-18 12:45:16,904 INFO L608 BuchiCegarLoop]: Abstraction has 251 states and 329 transitions. [2018-11-18 12:45:16,904 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2018-11-18 12:45:16,905 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 251 states and 329 transitions. [2018-11-18 12:45:16,905 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 110 [2018-11-18 12:45:16,905 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:45:16,905 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:45:16,906 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:45:16,906 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1] [2018-11-18 12:45:16,906 INFO L794 eck$LassoCheckResult]: Stem: 15697#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 15694#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 15687#L565 assume !(main_~array_size~0 < 1); 15688#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;assume { :begin_inline_lis } true;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 15672#L552-4 assume true; 15673#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 15707#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 15674#L552-4 assume true; 15675#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 15709#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 15710#L552-4 assume true; 15718#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 15717#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 15716#L552-4 assume true; 15713#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 15714#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 15712#L552-4 assume true; 15706#L552-1 assume !(lis_~i~0 < lis_~N); 15676#L552-5 lis_~i~0 := 1; 15677#L554-4 assume true; 15737#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 15735#L555-4 assume true; 15733#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 15731#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 15728#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 15726#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 15727#L555-4 assume true; 15722#L555-1 assume !(lis_~j~0 < lis_~i~0); 15723#L554-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 15763#L554-4 assume true; 15762#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 15761#L555-4 assume true; 15760#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 15758#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 15756#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 15753#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 15754#L555-4 assume true; 15771#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 15741#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 15742#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 15807#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 15791#L555-4 assume true; 15883#L555-1 assume !(lis_~j~0 < lis_~i~0); 15882#L554-3 [2018-11-18 12:45:16,906 INFO L796 eck$LassoCheckResult]: Loop: 15882#L554-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 15881#L554-4 assume true; 15880#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 15879#L555-4 assume true; 15878#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 15840#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 15841#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8; 15893#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 15892#L555-4 assume true; 15891#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 15890#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 15889#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 15830#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 15888#L555-4 assume true; 15865#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 15866#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 15886#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 15863#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 15858#L555-4 assume true; 15859#L555-1 assume !(lis_~j~0 < lis_~i~0); 15882#L554-3 [2018-11-18 12:45:16,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:45:16,906 INFO L82 PathProgramCache]: Analyzing trace with hash -487578135, now seen corresponding path program 8 times [2018-11-18 12:45:16,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:45:16,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:45:16,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:45:16,907 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:45:16,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:45:16,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:45:16,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:45:16,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:45:16,949 INFO L82 PathProgramCache]: Analyzing trace with hash 18259566, now seen corresponding path program 1 times [2018-11-18 12:45:16,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:45:16,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:45:16,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:45:16,950 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:45:16,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:45:16,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:45:16,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:45:16,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:45:16,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1843347370, now seen corresponding path program 2 times [2018-11-18 12:45:16,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:45:16,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:45:16,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:45:16,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:45:16,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:45:16,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:45:29,940 WARN L180 SmtUtils]: Spent 12.10 s on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2018-11-18 12:45:42,054 WARN L180 SmtUtils]: Spent 12.09 s on a formula simplification. DAG size of input: 63 DAG size of output: 38 [2018-11-18 12:45:42,275 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 3 proven. 136 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 12:45:42,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:45:42,275 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_564e3793-cc27-4c48-b0d5-76f0bde905ba/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:45:42,284 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 12:45:42,311 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 12:45:42,311 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 12:45:42,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:45:42,320 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:42,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-18 12:45:42,330 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:42,331 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:42,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-18 12:45:42,332 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:45:42,335 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:45:42,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:45:42,339 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:11 [2018-11-18 12:45:42,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 28 [2018-11-18 12:45:42,394 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 12 treesize of output 11 [2018-11-18 12:45:42,394 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:45:42,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-11-18 12:45:42,403 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 12 treesize of output 11 [2018-11-18 12:45:42,403 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:45:42,406 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:45:42,409 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:45:42,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:45:42,415 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:50, output treesize:33 [2018-11-18 12:45:42,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2018-11-18 12:45:42,469 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:42,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-18 12:45:42,470 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:45:42,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2018-11-18 12:45:42,487 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:42,487 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:42,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-18 12:45:42,488 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:45:42,495 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:45:42,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:45:42,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:45:42,506 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:59, output treesize:44 [2018-11-18 12:45:42,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 72 [2018-11-18 12:45:42,575 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:42,576 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:42,576 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:42,579 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:42,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 89 [2018-11-18 12:45:42,589 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-18 12:45:42,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 70 [2018-11-18 12:45:42,627 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:42,627 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:42,628 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:42,630 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:42,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 74 [2018-11-18 12:45:42,633 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:45:42,648 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:45:42,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 60 [2018-11-18 12:45:42,656 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:42,656 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:42,658 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:42,659 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:42,660 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:42,661 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:42,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 94 [2018-11-18 12:45:42,662 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 12:45:42,677 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:45:42,698 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 12:45:42,722 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-18 12:45:42,723 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:106, output treesize:139 [2018-11-18 12:45:43,043 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:43,043 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 117 [2018-11-18 12:45:43,048 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:43,049 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:45:43,050 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:43,051 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:43,054 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:43,055 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 91 [2018-11-18 12:45:43,056 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:45:43,079 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:43,081 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 85 treesize of output 90 [2018-11-18 12:45:43,083 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:43,084 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:43,085 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:43,085 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:43,086 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:43,086 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:45:43,087 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:43,088 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:43,089 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:43,089 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:43,090 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:43,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 166 [2018-11-18 12:45:43,091 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:45:43,109 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:45:43,120 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:45:43,173 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:43,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 126 [2018-11-18 12:45:43,181 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:43,182 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:45:43,183 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:43,183 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:43,185 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:43,185 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:43,186 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:43,191 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:43,194 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:43,204 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:43,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 239 [2018-11-18 12:45:43,216 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 3 xjuncts. [2018-11-18 12:45:43,295 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:43,297 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 108 treesize of output 113 [2018-11-18 12:45:43,299 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:43,300 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:43,300 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:43,301 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:43,302 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:43,302 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:45:43,303 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:43,303 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:45:43,304 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:43,304 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 151 [2018-11-18 12:45:43,305 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 12:45:43,325 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:45:43,329 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:43,331 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 128 treesize of output 131 [2018-11-18 12:45:43,334 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:43,342 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:43,343 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:43,344 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:43,345 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:43,346 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:45:43,347 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:43,349 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:43,350 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:43,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 168 [2018-11-18 12:45:43,351 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 12:45:43,372 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:45:43,402 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 12:45:43,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 12:45:43,448 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 2 variables, input treesize:276, output treesize:291 [2018-11-18 12:45:43,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 133 [2018-11-18 12:45:43,562 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:43,563 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:43,564 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:43,565 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:43,566 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:43,567 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:43,568 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:43,570 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:43,579 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:43,581 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:43,584 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:43,587 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:43,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 73 treesize of output 263 [2018-11-18 12:45:43,614 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-11-18 12:45:43,688 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:43,688 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 132 treesize of output 135 [2018-11-18 12:45:43,691 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:43,692 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:43,692 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:43,693 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:43,695 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:43,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 131 [2018-11-18 12:45:43,696 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:45:43,714 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:45:43,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 118 [2018-11-18 12:45:43,725 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:43,730 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:43,732 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:43,733 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:43,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 117 [2018-11-18 12:45:43,740 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 12:45:43,756 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:45:43,787 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 12:45:44,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 115 [2018-11-18 12:45:44,077 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:44,078 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:44,079 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:44,081 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:44,082 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:44,084 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:44,089 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:44,090 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:44,094 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:44,104 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:44,116 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 2 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 190 [2018-11-18 12:45:44,117 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 3 xjuncts. [2018-11-18 12:45:44,189 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:44,190 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 104 treesize of output 109 [2018-11-18 12:45:44,193 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:44,194 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:44,194 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:44,195 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:44,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 100 [2018-11-18 12:45:44,196 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 12:45:44,213 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:45:44,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 92 [2018-11-18 12:45:44,220 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:44,221 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:44,221 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:44,222 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:44,223 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:44,225 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:44,227 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:44,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 122 [2018-11-18 12:45:44,228 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-18 12:45:44,244 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:45:44,273 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 12:45:44,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 109 [2018-11-18 12:45:44,447 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:44,448 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:44,452 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:44,454 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:44,455 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:44,460 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:44,474 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 2 new quantified variables, introduced 5 case distinctions, treesize of input 46 treesize of output 126 [2018-11-18 12:45:44,475 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 3 xjuncts. [2018-11-18 12:45:44,516 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:44,518 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 98 treesize of output 103 [2018-11-18 12:45:44,520 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:44,521 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:44,522 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:44,522 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:44,523 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:44,524 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:44,525 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:44,525 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:44,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 142 [2018-11-18 12:45:44,526 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-18 12:45:44,545 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:45:44,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 86 [2018-11-18 12:45:44,552 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:44,552 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:44,553 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:44,554 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:44,555 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:44,556 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:45:44,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 115 [2018-11-18 12:45:44,558 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-18 12:45:44,572 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:45:44,597 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 12:45:44,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-2 vars, End of recursive call: 12 dim-0 vars, and 6 xjuncts. [2018-11-18 12:45:44,720 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 12 variables, input treesize:460, output treesize:596 [2018-11-18 12:45:44,956 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2018-11-18 12:45:45,191 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 171 [2018-11-18 12:45:45,439 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2018-11-18 12:45:45,458 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-18 12:45:45,458 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 12:45:45,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 18 dim-0 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:45:45,485 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 24 variables, input treesize:567, output treesize:5 [2018-11-18 12:45:45,555 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 63 proven. 76 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 12:45:45,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:45:45,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 38 [2018-11-18 12:45:46,152 WARN L180 SmtUtils]: Spent 579.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 135 [2018-11-18 12:45:46,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-18 12:45:46,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1272, Unknown=0, NotChecked=0, Total=1406 [2018-11-18 12:45:46,256 INFO L87 Difference]: Start difference. First operand 251 states and 329 transitions. cyclomatic complexity: 89 Second operand 38 states. [2018-11-18 12:46:00,104 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 87 [2018-11-18 12:46:00,430 WARN L180 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 75 [2018-11-18 12:46:00,616 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 62 [2018-11-18 12:46:00,909 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2018-11-18 12:46:01,264 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 88 [2018-11-18 12:46:01,779 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 85 [2018-11-18 12:46:03,113 WARN L180 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 97 [2018-11-18 12:46:16,205 WARN L180 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 97 [2018-11-18 12:46:16,443 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 88 [2018-11-18 12:46:17,655 WARN L180 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 205 [2018-11-18 12:46:18,293 WARN L180 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 193 [2018-11-18 12:46:18,716 WARN L180 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 85 [2018-11-18 12:46:18,883 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2018-11-18 12:46:19,210 WARN L180 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 76 [2018-11-18 12:46:19,435 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 62 [2018-11-18 12:46:19,812 WARN L180 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 165 [2018-11-18 12:46:20,262 WARN L180 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 162 [2018-11-18 12:46:20,717 WARN L180 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 205 [2018-11-18 12:46:21,534 WARN L180 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 217 DAG size of output: 207 [2018-11-18 12:46:34,081 WARN L180 SmtUtils]: Spent 12.10 s on a formula simplification. DAG size of input: 61 DAG size of output: 43 [2018-11-18 12:46:46,968 WARN L180 SmtUtils]: Spent 521.00 ms on a formula simplification. DAG size of input: 240 DAG size of output: 203 [2018-11-18 12:46:47,163 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2018-11-18 12:46:47,360 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 79 [2018-11-18 12:46:47,993 WARN L180 SmtUtils]: Spent 497.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 204 [2018-11-18 12:46:48,254 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2018-11-18 12:46:48,555 WARN L180 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 87 [2018-11-18 12:46:48,815 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 81 [2018-11-18 12:46:49,028 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 62 [2018-11-18 12:46:50,155 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 72 [2018-11-18 12:46:50,695 WARN L180 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 216 [2018-11-18 12:47:03,656 WARN L180 SmtUtils]: Spent 12.13 s on a formula simplification. DAG size of input: 89 DAG size of output: 74 [2018-11-18 12:47:04,142 WARN L180 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 175 [2018-11-18 12:47:04,890 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2018-11-18 12:47:05,349 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 80 [2018-11-18 12:47:06,467 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 69 [2018-11-18 12:47:06,670 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 81 [2018-11-18 12:47:07,243 WARN L180 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 217 [2018-11-18 12:47:07,466 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 54 [2018-11-18 12:47:07,945 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 55 [2018-11-18 12:47:08,190 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 64 [2018-11-18 12:47:08,738 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 72 [2018-11-18 12:47:09,088 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2018-11-18 12:47:09,665 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 73 [2018-11-18 12:47:10,513 WARN L180 SmtUtils]: Spent 721.00 ms on a formula simplification. DAG size of input: 234 DAG size of output: 209 [2018-11-18 12:47:11,097 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2018-11-18 12:47:11,340 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2018-11-18 12:47:11,577 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 71 [2018-11-18 12:47:12,165 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2018-11-18 12:47:13,045 WARN L180 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 96 [2018-11-18 12:47:13,357 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 84 [2018-11-18 12:47:13,849 WARN L180 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 96 [2018-11-18 12:47:38,780 WARN L180 SmtUtils]: Spent 24.82 s on a formula simplification. DAG size of input: 106 DAG size of output: 87 [2018-11-18 12:47:39,281 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 84 [2018-11-18 12:47:39,529 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 73 [2018-11-18 12:47:39,884 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 82 [2018-11-18 12:47:40,149 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 82 [2018-11-18 12:47:40,726 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 84 [2018-11-18 12:47:41,705 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 48 [2018-11-18 12:47:42,051 WARN L180 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 74 [2018-11-18 12:47:42,469 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 61 [2018-11-18 12:47:43,318 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2018-11-18 12:47:44,298 WARN L180 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 86 [2018-11-18 12:47:45,662 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2018-11-18 12:47:46,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:47:46,165 INFO L93 Difference]: Finished difference Result 1303 states and 1614 transitions. [2018-11-18 12:47:46,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2018-11-18 12:47:46,166 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1303 states and 1614 transitions. [2018-11-18 12:47:46,169 INFO L131 ngComponentsAnalysis]: Automaton has 29 accepting balls. 338 [2018-11-18 12:47:46,173 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1303 states to 1145 states and 1440 transitions. [2018-11-18 12:47:46,173 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1063 [2018-11-18 12:47:46,174 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1073 [2018-11-18 12:47:46,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1145 states and 1440 transitions. [2018-11-18 12:47:46,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:47:46,174 INFO L705 BuchiCegarLoop]: Abstraction has 1145 states and 1440 transitions. [2018-11-18 12:47:46,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states and 1440 transitions. [2018-11-18 12:47:46,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 682. [2018-11-18 12:47:46,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2018-11-18 12:47:46,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 870 transitions. [2018-11-18 12:47:46,186 INFO L728 BuchiCegarLoop]: Abstraction has 682 states and 870 transitions. [2018-11-18 12:47:46,186 INFO L608 BuchiCegarLoop]: Abstraction has 682 states and 870 transitions. [2018-11-18 12:47:46,186 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ [2018-11-18 12:47:46,186 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 682 states and 870 transitions. [2018-11-18 12:47:46,188 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 233 [2018-11-18 12:47:46,188 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:47:46,188 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:47:46,188 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:47:46,188 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 3, 3, 1, 1, 1, 1] [2018-11-18 12:47:46,189 INFO L794 eck$LassoCheckResult]: Stem: 17782#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 17779#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 17769#L565 assume !(main_~array_size~0 < 1); 17770#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;assume { :begin_inline_lis } true;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 17755#L552-4 assume true; 17756#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 17807#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 17804#L552-4 assume true; 17794#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 17795#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 17798#L552-4 assume true; 17806#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 17805#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 17757#L552-4 assume true; 17758#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 17843#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 17799#L552-4 assume true; 17801#L552-1 assume !(lis_~i~0 < lis_~N); 17759#L552-5 lis_~i~0 := 1; 17760#L554-4 assume true; 17909#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 17907#L555-4 assume true; 17905#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 17903#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 17900#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 17898#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 17899#L555-4 assume true; 17894#L555-1 assume !(lis_~j~0 < lis_~i~0); 17895#L554-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 17942#L554-4 assume true; 17940#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 17938#L555-4 assume true; 17936#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 17933#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 17929#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 17928#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 17927#L555-4 assume true; 17925#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 17926#L556 assume !lis_#t~short11; 17922#L556-2 [2018-11-18 12:47:46,189 INFO L796 eck$LassoCheckResult]: Loop: 17922#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8; 17918#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 17917#L555-4 assume true; 17910#L555-1 assume !(lis_~j~0 < lis_~i~0); 17911#L554-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 18407#L554-4 assume true; 18406#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 18405#L555-4 assume true; 18382#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 18381#L556 assume !lis_#t~short11; 18379#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8; 18377#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 18375#L555-4 assume true; 18373#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 18370#L556 assume !lis_#t~short11; 18371#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8; 18367#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 18404#L555-4 assume true; 18403#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 18383#L556 assume !lis_#t~short11; 17922#L556-2 [2018-11-18 12:47:46,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:47:46,189 INFO L82 PathProgramCache]: Analyzing trace with hash -642161436, now seen corresponding path program 1 times [2018-11-18 12:47:46,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:47:46,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:47:46,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:47:46,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:47:46,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:47:46,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:47:46,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:47:46,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:47:46,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1492253200, now seen corresponding path program 2 times [2018-11-18 12:47:46,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:47:46,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:47:46,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:47:46,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:47:46,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:47:46,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:47:46,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:47:46,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:47:46,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1439636307, now seen corresponding path program 6 times [2018-11-18 12:47:46,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:47:46,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:47:46,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:47:46,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:47:46,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:47:46,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:47:46,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:47:46,440 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 75 [2018-11-18 12:47:52,333 WARN L180 SmtUtils]: Spent 5.86 s on a formula simplification. DAG size of input: 332 DAG size of output: 230 [2018-11-18 12:47:54,352 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 162 [2018-11-18 12:47:54,354 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:47:54,354 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:47:54,354 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:47:54,354 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:47:54,354 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 12:47:54,354 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:47:54,354 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:47:54,355 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:47:54,355 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-termination.c.i_Iteration22_Lasso [2018-11-18 12:47:54,355 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:47:54,355 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:47:54,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:47:54,358 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-18 12:47:54,360 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-18 12:47:54,360 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-18 12:47:54,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-18 12:47:54,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-18 12:47:54,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-18 12:47:54,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-18 12:47:54,368 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-18 12:47:54,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-18 12:47:54,370 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-18 12:47:54,372 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-18 12:47:54,372 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-18 12:47:54,373 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-18 12:47:54,374 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-18 12:47:56,339 WARN L180 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 115 [2018-11-18 12:47:56,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:47:56,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:47:56,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:47:56,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:47:56,445 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-18 12:47:56,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:47:56,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:47:56,799 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:47:56,799 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 12:47:56,799 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:47:56,799 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:47:56,799 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:47:56,799 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:47:56,799 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:47:56,799 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:47:56,800 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:47:56,800 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:47:56,800 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:47:56,800 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:47:56,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:47:56,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:47:56,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:47:56,800 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:47:56,800 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:47:56,801 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:47:56,801 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:47:56,801 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:47:56,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:47:56,801 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:47:56,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:47:56,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:47:56,802 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:47:56,802 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:47:56,802 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:47:56,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:47:56,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:47:56,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:47:56,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:47:56,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:47:56,803 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:47:56,803 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:47:56,803 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:47:56,804 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:47:56,804 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:47:56,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:47:56,804 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:47:56,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:47:56,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:47:56,805 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:47:56,805 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:47:56,805 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:47:56,805 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:47:56,805 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:47:56,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:47:56,806 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:47:56,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:47:56,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:47:56,806 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:47:56,806 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:47:56,806 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:47:56,807 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:47:56,807 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:47:56,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:47:56,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:47:56,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:47:56,807 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:47:56,808 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:47:56,808 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:47:56,809 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:47:56,809 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:47:56,809 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:47:56,809 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:47:56,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:47:56,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:47:56,809 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:47:56,810 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:47:56,810 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:47:56,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:47:56,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:47:56,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:47:56,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:47:56,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:47:56,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:47:56,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:47:56,811 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:47:56,811 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:47:56,811 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:47:56,812 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:47:56,812 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:47:56,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:47:56,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:47:56,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:47:56,812 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:47:56,813 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:47:56,813 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:47:56,813 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:47:56,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:47:56,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:47:56,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:47:56,814 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:47:56,814 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:47:56,814 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:47:56,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:47:56,815 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:47:56,815 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:47:56,815 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:47:56,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:47:56,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:47:56,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:47:56,816 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:47:56,816 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:47:56,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:47:56,816 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:47:56,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:47:56,817 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:47:56,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:47:56,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:47:56,817 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:47:56,817 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:47:56,817 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:47:56,817 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:47:56,818 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:47:56,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:47:56,818 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:47:56,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:47:56,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:47:56,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:47:56,818 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:47:56,819 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:47:56,819 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:47:56,819 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:47:56,819 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:47:56,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:47:56,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:47:56,820 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:47:56,820 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:47:56,820 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:47:56,822 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:47:56,822 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:47:56,822 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:47:56,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:47:56,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:47:56,822 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:47:56,823 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:47:56,823 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:47:56,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:47:56,824 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:47:56,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:47:56,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:47:56,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:47:56,824 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:47:56,824 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:47:56,824 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:47:56,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:47:56,825 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:47:56,825 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:47:56,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:47:56,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:47:56,825 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:47:56,826 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:47:56,826 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:47:56,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:47:56,826 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:47:56,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:47:56,827 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:47:56,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:47:56,827 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:47:56,828 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:47:56,828 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:47:56,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:47:56,830 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:47:56,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:47:56,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:47:56,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:47:56,830 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:47:56,831 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:47:56,831 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:47:56,832 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:47:56,832 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:47:56,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:47:56,833 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:47:56,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:47:56,833 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:47:56,833 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:47:56,834 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:47:56,836 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:47:56,836 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:47:56,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:47:56,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:47:56,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:47:56,837 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:47:56,837 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:47:56,837 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:47:56,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:47:56,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:47:56,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:47:56,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:47:56,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:47:56,838 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:47:56,839 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:47:56,839 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:47:56,840 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:47:56,840 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:47:56,840 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:47:56,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:47:56,840 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:47:56,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:47:56,841 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:47:56,841 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:47:56,842 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:47:56,843 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:47:56,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:47:56,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:47:56,843 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:47:56,843 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:47:56,843 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:47:56,843 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:47:56,844 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:47:56,844 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:47:56,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:47:56,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:47:56,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:47:56,845 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:47:56,845 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:47:56,845 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:47:56,846 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:47:56,846 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:47:56,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:47:56,846 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:47:56,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:47:56,846 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:47:56,847 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:47:56,847 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:47:56,848 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:47:56,848 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:47:56,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:47:56,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:47:56,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:47:56,849 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:47:56,849 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:47:56,849 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:47:56,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:47:56,850 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:47:56,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:47:56,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:47:56,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:47:56,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:47:56,852 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:47:56,852 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:47:56,868 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 12:47:56,875 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 12:47:56,875 INFO L444 ModelExtractionUtils]: 48 out of 52 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 12:47:56,876 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 12:47:56,876 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 12:47:56,876 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 12:47:56,876 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~i~0, ULTIMATE.start_lis_~N) = -1*ULTIMATE.start_lis_~i~0 + 1*ULTIMATE.start_lis_~N Supporting invariants [] [2018-11-18 12:47:57,259 INFO L297 tatePredicateManager]: 72 out of 72 supporting invariants were superfluous and have been removed [2018-11-18 12:47:57,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:47:57,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:47:57,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:47:57,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:47:57,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:47:57,313 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 12:47:57,314 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-18 12:47:57,314 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 682 states and 870 transitions. cyclomatic complexity: 211 Second operand 5 states. [2018-11-18 12:47:57,338 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 682 states and 870 transitions. cyclomatic complexity: 211. Second operand 5 states. Result 1431 states and 1867 transitions. Complement of second has 7 states. [2018-11-18 12:47:57,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 12:47:57,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 12:47:57,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2018-11-18 12:47:57,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 42 transitions. Stem has 39 letters. Loop has 20 letters. [2018-11-18 12:47:57,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:47:57,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 42 transitions. Stem has 59 letters. Loop has 20 letters. [2018-11-18 12:47:57,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:47:57,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 42 transitions. Stem has 39 letters. Loop has 40 letters. [2018-11-18 12:47:57,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:47:57,340 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1431 states and 1867 transitions. [2018-11-18 12:47:57,344 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 133 [2018-11-18 12:47:57,349 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1431 states to 1418 states and 1840 transitions. [2018-11-18 12:47:57,349 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 735 [2018-11-18 12:47:57,350 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 775 [2018-11-18 12:47:57,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1418 states and 1840 transitions. [2018-11-18 12:47:57,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:47:57,350 INFO L705 BuchiCegarLoop]: Abstraction has 1418 states and 1840 transitions. [2018-11-18 12:47:57,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states and 1840 transitions. [2018-11-18 12:47:57,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 984. [2018-11-18 12:47:57,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2018-11-18 12:47:57,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1298 transitions. [2018-11-18 12:47:57,362 INFO L728 BuchiCegarLoop]: Abstraction has 984 states and 1298 transitions. [2018-11-18 12:47:57,362 INFO L608 BuchiCegarLoop]: Abstraction has 984 states and 1298 transitions. [2018-11-18 12:47:57,362 INFO L442 BuchiCegarLoop]: ======== Iteration 23============ [2018-11-18 12:47:57,362 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 984 states and 1298 transitions. [2018-11-18 12:47:57,364 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 75 [2018-11-18 12:47:57,365 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:47:57,365 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:47:57,365 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:47:57,365 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1] [2018-11-18 12:47:57,365 INFO L794 eck$LassoCheckResult]: Stem: 20385#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 20380#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 20372#L565 assume !(main_~array_size~0 < 1); 20373#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;assume { :begin_inline_lis } true;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 20358#L552-4 assume true; 20359#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 20390#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 20360#L552-4 assume true; 20361#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 20400#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 20401#L552-4 assume true; 20413#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 20412#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 20411#L552-4 assume true; 20408#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 20409#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 20403#L552-4 assume true; 20404#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 20406#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 20407#L552-4 assume true; 20388#L552-1 assume !(lis_~i~0 < lis_~N); 20389#L552-5 lis_~i~0 := 1; 20434#L554-4 assume true; 20435#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 20429#L555-4 assume true; 20430#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 20425#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 20426#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 20421#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 20422#L555-4 assume true; 20417#L555-1 assume !(lis_~j~0 < lis_~i~0); 20418#L554-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 20530#L554-4 assume true; 20529#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 20528#L555-4 assume true; 20527#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 20525#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 20514#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8; 20516#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 20542#L555-4 assume true; 20536#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 20537#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 20523#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 20510#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 20511#L555-4 assume true; 20601#L555-1 assume !(lis_~j~0 < lis_~i~0); 20602#L554-3 [2018-11-18 12:47:57,365 INFO L796 eck$LassoCheckResult]: Loop: 20602#L554-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 20598#L554-4 assume true; 20599#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 20595#L555-4 assume true; 20593#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 20594#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 20588#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8; 20587#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 20586#L555-4 assume true; 20585#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 20583#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 20581#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 20582#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 20629#L555-4 assume true; 20628#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 20604#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 20615#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 20616#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 20806#L555-4 assume true; 20603#L555-1 assume !(lis_~j~0 < lis_~i~0); 20602#L554-3 [2018-11-18 12:47:57,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:47:57,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1905297190, now seen corresponding path program 3 times [2018-11-18 12:47:57,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:47:57,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:47:57,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:47:57,366 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:47:57,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:47:57,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:47:58,418 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 2 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:47:58,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:47:58,418 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_564e3793-cc27-4c48-b0d5-76f0bde905ba/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:47:58,427 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 12:47:58,488 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-18 12:47:58,488 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 12:47:58,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:47:58,498 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:58,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-18 12:47:58,514 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:58,514 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:58,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-18 12:47:58,515 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:58,518 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:47:58,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:47:58,523 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:11 [2018-11-18 12:47:58,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 28 [2018-11-18 12:47:58,558 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 12 treesize of output 11 [2018-11-18 12:47:58,558 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:58,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-11-18 12:47:58,568 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 12 treesize of output 11 [2018-11-18 12:47:58,568 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:58,572 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:47:58,575 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:47:58,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:47:58,580 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:50, output treesize:33 [2018-11-18 12:47:58,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 48 [2018-11-18 12:47:58,634 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:58,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-11-18 12:47:58,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:58,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 44 [2018-11-18 12:47:58,648 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:58,649 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:58,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 41 [2018-11-18 12:47:58,649 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:58,657 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:47:58,662 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:47:58,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:47:58,670 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:68, output treesize:51 [2018-11-18 12:47:58,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 64 [2018-11-18 12:47:58,736 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:58,737 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:58,738 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:58,739 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 58 [2018-11-18 12:47:58,739 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:58,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 60 [2018-11-18 12:47:58,758 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:58,759 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:58,760 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:58,760 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:58,761 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:58,762 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:58,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 94 [2018-11-18 12:47:58,762 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:58,776 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:47:58,783 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:47:58,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:47:58,794 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:86, output treesize:69 [2018-11-18 12:47:58,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 80 [2018-11-18 12:47:58,873 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:58,874 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:58,875 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:58,876 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:58,876 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:58,877 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:58,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 93 [2018-11-18 12:47:58,878 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:58,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 76 [2018-11-18 12:47:58,904 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:58,905 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:58,905 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:58,906 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:58,907 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:58,907 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:58,908 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:58,909 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:58,910 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:58,910 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:58,911 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:58,912 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:58,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 171 [2018-11-18 12:47:58,913 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:58,944 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:47:58,953 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:47:58,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:47:58,966 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:104, output treesize:87 [2018-11-18 12:47:59,263 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:59,264 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 125 [2018-11-18 12:47:59,267 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:59,267 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:47:59,268 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:59,269 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:59,270 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:59,271 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:59,271 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:59,272 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:59,273 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:59,274 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:59,275 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:59,281 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:59,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 165 [2018-11-18 12:47:59,282 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:59,319 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:59,320 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 103 treesize of output 106 [2018-11-18 12:47:59,322 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:59,323 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:59,324 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:59,325 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:59,325 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:59,326 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:59,327 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:59,327 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:59,328 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:47:59,328 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:59,329 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:59,330 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:59,331 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:59,331 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:59,332 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:59,333 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:59,334 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:59,334 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:59,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 224 [2018-11-18 12:47:59,335 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:59,371 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:47:59,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:47:59,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 12:47:59,399 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:152, output treesize:103 [2018-11-18 12:47:59,612 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 18 proven. 50 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 12:47:59,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:47:59,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20] total 42 [2018-11-18 12:47:59,627 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 12:47:59,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:47:59,627 INFO L82 PathProgramCache]: Analyzing trace with hash 18259566, now seen corresponding path program 2 times [2018-11-18 12:47:59,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:47:59,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:47:59,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:47:59,628 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:47:59,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:47:59,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:47:59,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:48:00,334 WARN L180 SmtUtils]: Spent 695.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 137 [2018-11-18 12:48:00,464 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2018-11-18 12:48:00,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-18 12:48:00,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1553, Unknown=0, NotChecked=0, Total=1722 [2018-11-18 12:48:00,465 INFO L87 Difference]: Start difference. First operand 984 states and 1298 transitions. cyclomatic complexity: 348 Second operand 42 states. [2018-11-18 12:48:10,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:48:10,905 INFO L93 Difference]: Finished difference Result 2604 states and 3335 transitions. [2018-11-18 12:48:10,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-11-18 12:48:10,906 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2604 states and 3335 transitions. [2018-11-18 12:48:10,910 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 162 [2018-11-18 12:48:10,916 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2604 states to 2601 states and 3332 transitions. [2018-11-18 12:48:10,916 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 877 [2018-11-18 12:48:10,917 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 877 [2018-11-18 12:48:10,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2601 states and 3332 transitions. [2018-11-18 12:48:10,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:48:10,917 INFO L705 BuchiCegarLoop]: Abstraction has 2601 states and 3332 transitions. [2018-11-18 12:48:10,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2601 states and 3332 transitions. [2018-11-18 12:48:10,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2601 to 1016. [2018-11-18 12:48:10,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1016 states. [2018-11-18 12:48:10,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1319 transitions. [2018-11-18 12:48:10,931 INFO L728 BuchiCegarLoop]: Abstraction has 1016 states and 1319 transitions. [2018-11-18 12:48:10,931 INFO L608 BuchiCegarLoop]: Abstraction has 1016 states and 1319 transitions. [2018-11-18 12:48:10,931 INFO L442 BuchiCegarLoop]: ======== Iteration 24============ [2018-11-18 12:48:10,931 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1016 states and 1319 transitions. [2018-11-18 12:48:10,933 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 50 [2018-11-18 12:48:10,934 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:48:10,934 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:48:10,934 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:48:10,934 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 12:48:10,935 INFO L794 eck$LassoCheckResult]: Stem: 24382#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 24377#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 24369#L565 assume !(main_~array_size~0 < 1); 24370#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;assume { :begin_inline_lis } true;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 24354#L552-4 assume true; 24355#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 24404#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 24405#L552-4 assume true; 24406#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 24402#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 24403#L552-4 assume true; 24408#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 24407#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 24356#L552-4 assume true; 24357#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 24495#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 24493#L552-4 assume true; 24492#L552-1 assume !(lis_~i~0 < lis_~N); 24491#L552-5 lis_~i~0 := 1; 24490#L554-4 assume true; 24489#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 24487#L555-4 assume true; 24485#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 24483#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 24481#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 24479#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 24477#L555-4 assume true; 24475#L555-1 assume !(lis_~j~0 < lis_~i~0); 24472#L554-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 24470#L554-4 assume true; 24468#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 24465#L555-4 assume true; 24463#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 24460#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 24457#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 24455#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 24453#L555-4 assume true; 24451#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 24452#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 24717#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 24716#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 24715#L555-4 assume true; 24713#L555-1 assume !(lis_~j~0 < lis_~i~0); 24714#L554-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 24707#L554-4 assume true; 24708#L554-1 assume !(lis_~i~0 < lis_~N); 24399#L554-5 lis_~i~0 := 0; 24368#L558-4 [2018-11-18 12:48:10,935 INFO L796 eck$LassoCheckResult]: Loop: 24368#L558-4 assume true; 24360#L558-1 assume !!(lis_~i~0 < lis_~N);call lis_#t~mem14 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4); 24361#L559 assume lis_~max~0 < lis_#t~mem14;havoc lis_#t~mem14;call lis_#t~mem15 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);lis_~max~0 := lis_#t~mem15;havoc lis_#t~mem15; 24367#L558-3 lis_#t~post13 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post13;havoc lis_#t~post13; 24368#L558-4 [2018-11-18 12:48:10,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:48:10,935 INFO L82 PathProgramCache]: Analyzing trace with hash 21252202, now seen corresponding path program 1 times [2018-11-18 12:48:10,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:48:10,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:48:10,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:48:10,936 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:48:10,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:48:10,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:48:11,031 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 17 proven. 39 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-18 12:48:11,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:48:11,031 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_564e3793-cc27-4c48-b0d5-76f0bde905ba/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:48:11,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:48:11,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:48:11,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:48:11,123 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 15 proven. 36 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 12:48:11,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:48:11,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2018-11-18 12:48:11,140 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 12:48:11,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:48:11,141 INFO L82 PathProgramCache]: Analyzing trace with hash 2991114, now seen corresponding path program 2 times [2018-11-18 12:48:11,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:48:11,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:48:11,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:48:11,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:48:11,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:48:11,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:48:11,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:48:11,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-18 12:48:11,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2018-11-18 12:48:11,176 INFO L87 Difference]: Start difference. First operand 1016 states and 1319 transitions. cyclomatic complexity: 339 Second operand 20 states. [2018-11-18 12:48:11,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:48:11,415 INFO L93 Difference]: Finished difference Result 1370 states and 1762 transitions. [2018-11-18 12:48:11,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-18 12:48:11,415 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1370 states and 1762 transitions. [2018-11-18 12:48:11,418 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 66 [2018-11-18 12:48:11,422 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1370 states to 1312 states and 1674 transitions. [2018-11-18 12:48:11,422 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 425 [2018-11-18 12:48:11,422 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 425 [2018-11-18 12:48:11,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1312 states and 1674 transitions. [2018-11-18 12:48:11,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:48:11,422 INFO L705 BuchiCegarLoop]: Abstraction has 1312 states and 1674 transitions. [2018-11-18 12:48:11,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states and 1674 transitions. [2018-11-18 12:48:11,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 964. [2018-11-18 12:48:11,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 964 states. [2018-11-18 12:48:11,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1235 transitions. [2018-11-18 12:48:11,434 INFO L728 BuchiCegarLoop]: Abstraction has 964 states and 1235 transitions. [2018-11-18 12:48:11,434 INFO L608 BuchiCegarLoop]: Abstraction has 964 states and 1235 transitions. [2018-11-18 12:48:11,434 INFO L442 BuchiCegarLoop]: ======== Iteration 25============ [2018-11-18 12:48:11,434 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 964 states and 1235 transitions. [2018-11-18 12:48:11,436 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 50 [2018-11-18 12:48:11,436 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:48:11,436 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:48:11,436 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-18 12:48:11,437 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 3, 3, 1, 1, 1, 1] [2018-11-18 12:48:11,437 INFO L794 eck$LassoCheckResult]: Stem: 26949#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 26944#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 26936#L565 assume !(main_~array_size~0 < 1); 26937#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;assume { :begin_inline_lis } true;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 26921#L552-4 assume true; 26922#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 26960#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 26923#L552-4 assume true; 26924#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 26962#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 26963#L552-4 assume true; 26975#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 26974#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 26972#L552-4 assume true; 26973#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 27046#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 27044#L552-4 assume true; 27045#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 26969#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 26970#L552-4 assume true; 26958#L552-1 assume !(lis_~i~0 < lis_~N); 26959#L552-5 lis_~i~0 := 1; 27039#L554-4 assume true; 27040#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 27143#L555-4 assume true; 27033#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 27034#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 27029#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 27030#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 27025#L555-4 assume true; 27026#L555-1 assume !(lis_~j~0 < lis_~i~0); 27020#L554-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 27021#L554-4 assume true; 27016#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 27017#L555-4 assume true; 27012#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 27013#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 27009#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 27008#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 27007#L555-4 assume true; 27006#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 27003#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 27004#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 27567#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 27565#L555-4 assume true; 27563#L555-1 assume !(lis_~j~0 < lis_~i~0); 27561#L554-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 27559#L554-4 assume true; 27557#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 27553#L555-4 assume true; 27550#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 27551#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 27625#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 27540#L555-3 [2018-11-18 12:48:11,437 INFO L796 eck$LassoCheckResult]: Loop: 27540#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 27624#L555-4 assume true; 27623#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 27622#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 27621#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 27620#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 27619#L555-4 assume true; 27618#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 27612#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 27616#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 27615#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 27614#L555-4 assume true; 27611#L555-1 assume !(lis_~j~0 < lis_~i~0); 27608#L554-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 27607#L554-4 assume true; 27605#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 27600#L555-4 assume true; 27601#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 27626#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 27539#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 27540#L555-3 [2018-11-18 12:48:11,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:48:11,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1981570151, now seen corresponding path program 9 times [2018-11-18 12:48:11,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:48:11,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:48:11,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:48:11,438 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:48:11,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:48:11,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:48:11,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:48:11,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:48:11,508 INFO L82 PathProgramCache]: Analyzing trace with hash -2014879630, now seen corresponding path program 5 times [2018-11-18 12:48:11,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:48:11,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:48:11,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:48:11,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:48:11,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:48:11,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:48:11,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:48:11,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:48:11,524 INFO L82 PathProgramCache]: Analyzing trace with hash -718303784, now seen corresponding path program 10 times [2018-11-18 12:48:11,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:48:11,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:48:11,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:48:11,525 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:48:11,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:48:11,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:48:11,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:48:13,647 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification. DAG size of input: 209 DAG size of output: 153 [2018-11-18 12:48:14,019 WARN L180 SmtUtils]: Spent 367.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2018-11-18 12:48:34,286 WARN L180 SmtUtils]: Spent 20.26 s on a formula simplification. DAG size of input: 451 DAG size of output: 301 [2018-11-18 12:48:44,007 WARN L180 SmtUtils]: Spent 9.71 s on a formula simplification that was a NOOP. DAG size: 202 [2018-11-18 12:48:44,011 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:48:44,011 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:48:44,011 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:48:44,011 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:48:44,011 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 12:48:44,011 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:48:44,011 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:48:44,012 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:48:44,012 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-termination.c.i_Iteration25_Lasso [2018-11-18 12:48:44,012 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:48:44,012 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:48:44,015 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-18 12:48:44,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:48:44,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:48:44,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:48:44,030 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-18 12:48:44,035 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-18 12:48:44,036 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-18 12:48:44,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-18 12:48:44,041 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-18 12:48:44,042 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-18 12:48:44,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-18 12:48:44,044 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-18 12:48:44,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-18 12:48:44,046 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-18 12:48:44,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-18 12:48:44,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-18 12:48:44,049 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-18 12:48:44,050 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-18 12:48:44,052 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-18 12:49:20,366 WARN L180 SmtUtils]: Spent 665.00 ms on a formula simplification. DAG size of input: 299 DAG size of output: 154 [2018-11-18 12:49:22,128 WARN L180 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 370 DAG size of output: 171 [2018-11-18 12:49:22,129 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-18 12:49:22,135 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-18 12:49:22,136 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-18 12:49:22,138 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-18 12:49:22,512 WARN L180 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 92 [2018-11-18 12:49:23,053 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2018-11-18 12:49:23,082 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:49:23,082 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 12:49:23,082 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:49:23,083 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:49:23,083 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:49:23,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:49:23,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:49:23,083 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:49:23,083 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:49:23,083 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:49:23,083 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:49:23,084 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:49:23,084 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:49:23,084 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:49:23,084 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:49:23,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:49:23,084 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:49:23,084 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:49:23,084 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:49:23,085 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:49:23,085 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:49:23,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:49:23,085 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:49:23,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:49:23,085 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:49:23,085 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:49:23,086 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:49:23,086 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:49:23,086 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:49:23,086 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:49:23,086 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:49:23,086 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:49:23,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:49:23,087 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:49:23,087 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:49:23,087 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:49:23,087 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:49:23,087 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:49:23,087 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:49:23,087 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:49:23,088 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:49:23,088 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:49:23,088 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:49:23,088 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:49:23,088 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:49:23,089 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:49:23,089 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:49:23,089 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:49:23,090 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:49:23,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:49:23,090 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:49:23,090 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:49:23,090 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:49:23,090 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:49:23,090 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:49:23,091 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:49:23,091 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:49:23,091 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:49:23,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:49:23,091 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:49:23,091 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:49:23,091 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:49:23,092 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:49:23,092 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:49:23,092 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:49:23,092 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:49:23,093 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:49:23,093 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:49:23,093 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:49:23,093 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:49:23,094 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:49:23,094 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:49:23,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:49:23,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:49:23,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:49:23,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:49:23,095 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:49:23,095 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:49:23,095 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:49:23,095 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:49:23,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:49:23,096 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:49:23,096 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:49:23,096 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:49:23,096 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:49:23,096 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:49:23,096 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:49:23,097 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:49:23,097 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:49:23,097 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:49:23,097 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:49:23,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:49:23,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:49:23,097 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:49:23,097 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:49:23,098 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:49:23,098 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:49:23,098 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:49:23,098 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:49:23,098 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:49:23,099 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:49:23,099 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:49:23,099 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:49:23,099 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:49:23,099 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:49:23,099 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:49:23,099 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:49:23,100 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:49:23,100 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:49:23,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:49:23,100 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:49:23,100 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:49:23,100 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:49:23,100 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:49:23,100 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:49:23,100 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:49:23,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:49:23,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:49:23,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:49:23,101 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:49:23,101 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:49:23,101 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:49:23,102 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:49:23,102 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:49:23,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:49:23,103 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:49:23,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:49:23,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:49:23,103 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:49:23,103 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:49:23,103 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:49:23,103 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:49:23,103 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:49:23,104 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:49:23,104 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:49:23,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:49:23,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:49:23,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:49:23,104 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:49:23,104 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:49:23,105 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:49:23,105 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:49:23,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:49:23,105 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:49:23,105 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:49:23,105 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:49:23,105 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:49:23,106 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:49:23,106 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:49:23,106 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:49:23,106 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:49:23,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:49:23,106 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:49:23,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:49:23,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:49:23,107 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:49:23,107 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:49:23,107 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:49:23,107 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:49:23,107 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:49:23,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:49:23,108 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:49:23,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:49:23,108 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:49:23,108 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:49:23,109 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:49:23,110 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:49:23,110 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:49:23,110 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:49:23,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:49:23,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:49:23,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:49:23,111 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:49:23,111 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:49:23,113 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:49:23,113 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:49:23,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:49:23,114 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:49:23,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:49:23,114 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:49:23,114 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:49:23,114 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:49:23,116 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:49:23,116 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:49:23,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:49:23,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:49:23,117 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:49:23,117 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:49:23,117 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:49:23,117 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:49:23,119 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:49:23,119 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:49:23,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:49:23,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:49:23,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:49:23,120 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:49:23,120 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:49:23,120 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:49:23,121 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:49:23,121 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:49:23,121 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:49:23,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:49:23,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:49:23,122 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:49:23,122 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:49:23,122 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:49:23,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:49:23,123 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:49:23,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:49:23,124 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:49:23,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:49:23,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:49:23,124 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:49:23,125 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:49:23,127 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:49:23,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-18 12:49:23,127 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:49:23,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:49:23,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:49:23,127 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:49:23,130 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:49:23,130 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:49:23,182 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 12:49:23,215 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-18 12:49:23,215 INFO L444 ModelExtractionUtils]: 29 out of 37 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-18 12:49:23,216 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 12:49:23,216 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 12:49:23,216 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 12:49:23,217 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_lis_~best~0.base) (+ ULTIMATE.start_lis_~best~0.offset 12))_2, v_rep(select (select #memory_int ULTIMATE.start_lis_~best~0.base) (+ ULTIMATE.start_lis_~best~0.offset 4))_7) = -1*v_rep(select (select #memory_int ULTIMATE.start_lis_~best~0.base) (+ ULTIMATE.start_lis_~best~0.offset 12))_2 + 1*v_rep(select (select #memory_int ULTIMATE.start_lis_~best~0.base) (+ ULTIMATE.start_lis_~best~0.offset 4))_7 + 1 Supporting invariants [] [2018-11-18 12:49:24,598 INFO L297 tatePredicateManager]: 153 out of 155 supporting invariants were superfluous and have been removed [2018-11-18 12:49:24,602 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 12:49:24,602 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 12:49:24,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:49:24,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:49:24,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:49:24,642 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 11 treesize of output 14 [2018-11-18 12:49:24,646 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:24,647 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:24,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 12:49:24,647 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:49:24,650 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:49:24,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:49:24,653 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-11-18 12:49:24,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:49:24,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:49:24,712 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:24,713 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 84 [2018-11-18 12:49:24,717 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:49:24,718 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:24,725 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:24,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 69 treesize of output 127 [2018-11-18 12:49:24,745 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 9 xjuncts. [2018-11-18 12:49:24,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 50 [2018-11-18 12:49:24,784 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 12 treesize of output 11 [2018-11-18 12:49:24,785 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:49:24,791 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:49:24,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 69 [2018-11-18 12:49:24,797 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 12 treesize of output 11 [2018-11-18 12:49:24,797 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 12:49:24,804 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:49:24,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2018-11-18 12:49:24,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-18 12:49:24,810 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 12:49:24,815 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:49:24,834 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 12:49:24,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 12:49:24,856 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 1 variables, input treesize:105, output treesize:173 [2018-11-18 12:49:25,073 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:25,074 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 118 [2018-11-18 12:49:25,077 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:25,078 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:25,079 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:25,080 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:25,081 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:25,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 157 [2018-11-18 12:49:25,082 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:49:25,106 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:25,106 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 72 treesize of output 81 [2018-11-18 12:49:25,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2018-11-18 12:49:25,108 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:49:25,114 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:49:25,123 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:49:25,177 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:25,180 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 134 [2018-11-18 12:49:25,183 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:25,184 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:25,185 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:25,186 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:25,187 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:25,187 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:25,190 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:25,194 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:25,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 210 [2018-11-18 12:49:25,196 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 12:49:25,225 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:25,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 103 [2018-11-18 12:49:25,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2018-11-18 12:49:25,229 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 12:49:25,237 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:49:25,249 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:49:25,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 12:49:25,274 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:285, output treesize:168 [2018-11-18 12:49:25,452 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:49:25,452 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 12 loop predicates [2018-11-18 12:49:25,452 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 964 states and 1235 transitions. cyclomatic complexity: 305 Second operand 15 states. [2018-11-18 12:49:25,578 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 964 states and 1235 transitions. cyclomatic complexity: 305. Second operand 15 states. Result 1205 states and 1515 transitions. Complement of second has 12 states. [2018-11-18 12:49:25,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 3 stem states 3 non-accepting loop states 2 accepting loop states [2018-11-18 12:49:25,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 12:49:25,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 51 transitions. [2018-11-18 12:49:25,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 51 transitions. Stem has 53 letters. Loop has 20 letters. [2018-11-18 12:49:25,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:49:25,579 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 12:49:25,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:49:25,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:49:25,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:49:25,630 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 11 treesize of output 14 [2018-11-18 12:49:25,639 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:25,639 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:25,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 12:49:25,640 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:49:25,642 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:49:25,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:49:25,649 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-11-18 12:49:25,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:49:25,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:49:25,713 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:25,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 84 [2018-11-18 12:49:25,718 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:49:25,719 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:25,725 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:25,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 69 treesize of output 127 [2018-11-18 12:49:25,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 9 xjuncts. [2018-11-18 12:49:25,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 69 [2018-11-18 12:49:25,786 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 12 treesize of output 11 [2018-11-18 12:49:25,786 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:49:25,793 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:49:25,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2018-11-18 12:49:25,799 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 12 treesize of output 11 [2018-11-18 12:49:25,799 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 12:49:25,805 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:49:25,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 50 [2018-11-18 12:49:25,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-18 12:49:25,811 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 12:49:25,817 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:49:25,836 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 12:49:25,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 12:49:25,859 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 1 variables, input treesize:107, output treesize:179 [2018-11-18 12:49:26,076 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:26,078 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 120 [2018-11-18 12:49:26,081 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:26,081 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:26,082 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:26,083 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:26,085 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:26,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 157 [2018-11-18 12:49:26,086 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:49:26,107 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:26,108 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 72 treesize of output 81 [2018-11-18 12:49:26,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2018-11-18 12:49:26,110 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:49:26,117 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:49:26,126 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:49:26,175 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:26,176 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 136 [2018-11-18 12:49:26,179 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:26,180 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:26,181 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:26,182 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:26,182 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:26,183 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:26,186 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:26,189 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:26,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 210 [2018-11-18 12:49:26,191 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 12:49:26,220 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:26,221 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 94 treesize of output 103 [2018-11-18 12:49:26,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2018-11-18 12:49:26,224 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 12:49:26,232 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:49:26,243 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:49:26,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 12:49:26,271 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:289, output treesize:172 [2018-11-18 12:49:26,502 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:49:26,503 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 12 loop predicates [2018-11-18 12:49:26,503 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 964 states and 1235 transitions. cyclomatic complexity: 305 Second operand 15 states. [2018-11-18 12:49:26,683 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 964 states and 1235 transitions. cyclomatic complexity: 305. Second operand 15 states. Result 1205 states and 1515 transitions. Complement of second has 12 states. [2018-11-18 12:49:26,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 3 stem states 3 non-accepting loop states 2 accepting loop states [2018-11-18 12:49:26,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 12:49:26,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 51 transitions. [2018-11-18 12:49:26,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 51 transitions. Stem has 53 letters. Loop has 20 letters. [2018-11-18 12:49:26,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:49:26,685 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 12:49:26,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:49:26,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:49:26,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:49:26,744 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 11 treesize of output 14 [2018-11-18 12:49:26,749 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:26,750 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:26,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 12:49:26,750 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:49:26,756 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:49:26,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:49:26,759 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-11-18 12:49:26,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:49:26,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:49:26,817 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:26,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 84 [2018-11-18 12:49:26,822 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:49:26,823 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:26,830 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:26,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 69 treesize of output 127 [2018-11-18 12:49:26,848 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 9 xjuncts. [2018-11-18 12:49:26,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2018-11-18 12:49:26,890 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 12 treesize of output 11 [2018-11-18 12:49:26,890 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:49:26,896 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:49:26,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 50 [2018-11-18 12:49:26,903 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 12 treesize of output 11 [2018-11-18 12:49:26,903 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 12:49:26,913 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:49:26,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 69 [2018-11-18 12:49:26,921 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 12 treesize of output 11 [2018-11-18 12:49:26,921 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 12:49:26,931 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:49:26,952 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 12:49:26,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 12:49:26,975 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 1 variables, input treesize:105, output treesize:173 [2018-11-18 12:49:27,192 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:27,195 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 118 [2018-11-18 12:49:27,198 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:27,199 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:27,200 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:27,201 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:27,203 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:27,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 157 [2018-11-18 12:49:27,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:49:27,226 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:27,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 81 [2018-11-18 12:49:27,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2018-11-18 12:49:27,229 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:49:27,236 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:49:27,245 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:49:27,289 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:27,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 134 [2018-11-18 12:49:27,293 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:27,294 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:27,295 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:27,296 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:27,296 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:27,297 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:27,300 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:27,304 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:27,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 210 [2018-11-18 12:49:27,306 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 12:49:27,335 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:27,337 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 94 treesize of output 103 [2018-11-18 12:49:27,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2018-11-18 12:49:27,340 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 12:49:27,348 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:49:27,360 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:49:27,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 12:49:27,387 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:285, output treesize:168 [2018-11-18 12:49:27,582 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:49:27,582 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 12 loop predicates [2018-11-18 12:49:27,582 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 964 states and 1235 transitions. cyclomatic complexity: 305 Second operand 15 states. [2018-11-18 12:49:27,865 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 964 states and 1235 transitions. cyclomatic complexity: 305. Second operand 15 states. Result 1615 states and 2005 transitions. Complement of second has 23 states. [2018-11-18 12:49:27,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 3 stem states 9 non-accepting loop states 2 accepting loop states [2018-11-18 12:49:27,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 12:49:27,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 69 transitions. [2018-11-18 12:49:27,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 69 transitions. Stem has 53 letters. Loop has 20 letters. [2018-11-18 12:49:27,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:49:27,866 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 12:49:27,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:49:27,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:49:27,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:49:27,918 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 11 treesize of output 14 [2018-11-18 12:49:27,924 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:27,924 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:27,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 12:49:27,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:49:27,931 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:49:27,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:49:27,935 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-11-18 12:49:27,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:49:27,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:49:28,006 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:28,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 84 [2018-11-18 12:49:28,027 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:49:28,028 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:28,036 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:28,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, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 69 treesize of output 127 [2018-11-18 12:49:28,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 9 xjuncts. [2018-11-18 12:49:28,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2018-11-18 12:49:28,110 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 12 treesize of output 11 [2018-11-18 12:49:28,110 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:49:28,116 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:49:28,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 50 [2018-11-18 12:49:28,124 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 12 treesize of output 11 [2018-11-18 12:49:28,124 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 12:49:28,132 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:49:28,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 69 [2018-11-18 12:49:28,139 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 12 treesize of output 11 [2018-11-18 12:49:28,139 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 12:49:28,148 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:49:28,171 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 12:49:28,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 12:49:28,199 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 1 variables, input treesize:105, output treesize:173 [2018-11-18 12:49:28,470 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:28,471 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 118 [2018-11-18 12:49:28,474 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:28,476 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:28,477 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:28,479 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:28,481 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:28,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 157 [2018-11-18 12:49:28,483 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:49:28,509 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:28,510 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 72 treesize of output 81 [2018-11-18 12:49:28,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2018-11-18 12:49:28,512 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:49:28,523 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:49:28,533 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:49:28,600 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:28,601 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 134 [2018-11-18 12:49:28,605 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:28,606 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:28,607 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:28,608 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:28,609 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:28,610 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:28,612 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:28,617 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:28,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 210 [2018-11-18 12:49:28,619 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 12:49:28,654 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:28,656 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 94 treesize of output 103 [2018-11-18 12:49:28,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2018-11-18 12:49:28,659 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 12:49:28,668 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:49:28,682 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:49:28,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 12:49:28,718 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:285, output treesize:168 [2018-11-18 12:49:28,928 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:49:28,928 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.3 stem predicates 12 loop predicates [2018-11-18 12:49:28,929 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 964 states and 1235 transitions. cyclomatic complexity: 305 Second operand 15 states. [2018-11-18 12:49:29,500 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 964 states and 1235 transitions. cyclomatic complexity: 305. Second operand 15 states. Result 2219 states and 2770 transitions. Complement of second has 33 states. [2018-11-18 12:49:29,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 19 states 3 stem states 14 non-accepting loop states 2 accepting loop states [2018-11-18 12:49:29,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 12:49:29,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 96 transitions. [2018-11-18 12:49:29,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 96 transitions. Stem has 53 letters. Loop has 20 letters. [2018-11-18 12:49:29,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:49:29,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 96 transitions. Stem has 73 letters. Loop has 20 letters. [2018-11-18 12:49:29,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:49:29,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 96 transitions. Stem has 53 letters. Loop has 40 letters. [2018-11-18 12:49:29,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:49:29,502 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2219 states and 2770 transitions. [2018-11-18 12:49:29,505 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 134 [2018-11-18 12:49:29,509 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2219 states to 1958 states and 2453 transitions. [2018-11-18 12:49:29,509 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 452 [2018-11-18 12:49:29,510 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 507 [2018-11-18 12:49:29,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1958 states and 2453 transitions. [2018-11-18 12:49:29,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:49:29,510 INFO L705 BuchiCegarLoop]: Abstraction has 1958 states and 2453 transitions. [2018-11-18 12:49:29,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1958 states and 2453 transitions. [2018-11-18 12:49:29,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1958 to 1607. [2018-11-18 12:49:29,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1607 states. [2018-11-18 12:49:29,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1607 states to 1607 states and 2050 transitions. [2018-11-18 12:49:29,527 INFO L728 BuchiCegarLoop]: Abstraction has 1607 states and 2050 transitions. [2018-11-18 12:49:29,527 INFO L608 BuchiCegarLoop]: Abstraction has 1607 states and 2050 transitions. [2018-11-18 12:49:29,527 INFO L442 BuchiCegarLoop]: ======== Iteration 26============ [2018-11-18 12:49:29,527 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1607 states and 2050 transitions. [2018-11-18 12:49:29,530 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 116 [2018-11-18 12:49:29,530 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:49:29,530 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:49:29,531 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-18 12:49:29,531 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1] [2018-11-18 12:49:29,531 INFO L794 eck$LassoCheckResult]: Stem: 35859#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 35854#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 35846#L565 assume !(main_~array_size~0 < 1); 35847#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;assume { :begin_inline_lis } true;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 35831#L552-4 assume true; 35832#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 35885#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 35833#L552-4 assume true; 35834#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 35877#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 35878#L552-4 assume true; 35889#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 35888#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 35886#L552-4 assume true; 35887#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 35964#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 35961#L552-4 assume true; 35962#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 35883#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 35884#L552-4 assume true; 35864#L552-1 assume !(lis_~i~0 < lis_~N); 35865#L552-5 lis_~i~0 := 1; 35973#L554-4 assume true; 35974#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 35944#L555-4 assume true; 35945#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 35938#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 35939#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 35934#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 35935#L555-4 assume true; 35930#L555-1 assume !(lis_~j~0 < lis_~i~0); 35931#L554-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 35926#L554-4 assume true; 35927#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 35922#L555-4 assume true; 35923#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 35918#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 35917#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 35915#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 35914#L555-4 assume true; 35913#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 35909#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 35897#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 35896#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 35895#L555-4 assume true; 35893#L555-1 assume !(lis_~j~0 < lis_~i~0); 35894#L554-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 36635#L554-4 assume true; 36279#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 36239#L555-4 assume true; 36240#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 36632#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 36231#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 36230#L555-3 [2018-11-18 12:49:29,531 INFO L796 eck$LassoCheckResult]: Loop: 36230#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 36229#L555-4 assume true; 36614#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 36609#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 36610#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 36605#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 36606#L555-4 assume true; 36601#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 36602#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 36596#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8; 36203#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 36638#L555-4 assume true; 36298#L555-1 assume !(lis_~j~0 < lis_~i~0); 36299#L554-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 36284#L554-4 assume true; 36285#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 36634#L555-4 assume true; 36633#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 36232#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 36233#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 36230#L555-3 [2018-11-18 12:49:29,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:49:29,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1981570151, now seen corresponding path program 11 times [2018-11-18 12:49:29,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:49:29,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:49:29,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:49:29,532 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:49:29,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:49:29,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:49:29,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:49:29,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:49:29,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1313815052, now seen corresponding path program 3 times [2018-11-18 12:49:29,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:49:29,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:49:29,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:49:29,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:49:29,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:49:29,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:49:29,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:49:29,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:49:29,626 INFO L82 PathProgramCache]: Analyzing trace with hash -17239206, now seen corresponding path program 4 times [2018-11-18 12:49:29,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:49:29,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:49:29,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:49:29,627 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:49:29,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:49:29,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:49:30,605 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 54 proven. 144 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 12:49:30,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:49:30,605 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_564e3793-cc27-4c48-b0d5-76f0bde905ba/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:49:30,613 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 12:49:30,641 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 12:49:30,641 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 12:49:30,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:49:30,646 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 11 treesize of output 14 [2018-11-18 12:49:30,652 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:30,653 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:30,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 12:49:30,653 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:49:30,660 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:49:30,663 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:49:30,663 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:8 [2018-11-18 12:49:30,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 34 [2018-11-18 12:49:30,761 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:30,762 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:30,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 48 [2018-11-18 12:49:30,762 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:49:30,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2018-11-18 12:49:30,774 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 12 treesize of output 11 [2018-11-18 12:49:30,774 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:49:30,778 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:49:30,782 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:49:30,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:49:30,787 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:63, output treesize:38 [2018-11-18 12:49:30,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 62 [2018-11-18 12:49:30,876 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:30,877 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:30,878 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:30,879 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:30,880 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:30,882 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:30,887 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:30,889 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:30,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 137 [2018-11-18 12:49:30,892 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:49:30,916 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 62 [2018-11-18 12:49:30,919 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:30,920 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:30,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 41 [2018-11-18 12:49:30,921 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:49:30,931 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:49:30,938 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:49:30,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:49:30,947 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:96, output treesize:69 [2018-11-18 12:49:31,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 111 [2018-11-18 12:49:31,045 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:31,046 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:31,047 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:31,048 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:31,049 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:31,049 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:49:31,050 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:31,051 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:31,053 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:31,059 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:31,060 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:31,063 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:49:31,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 231 [2018-11-18 12:49:31,064 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:49:31,090 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:31,091 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 76 treesize of output 83 [2018-11-18 12:49:31,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2018-11-18 12:49:31,093 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:49:31,103 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:49:31,111 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:49:31,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 12:49:31,121 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:146, output treesize:77 [2018-11-18 12:49:31,233 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 57 proven. 126 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-18 12:49:31,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:49:31,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 16] total 37 [2018-11-18 12:49:32,428 WARN L180 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 204 DAG size of output: 147 [2018-11-18 12:49:32,760 WARN L180 SmtUtils]: Spent 328.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2018-11-18 12:49:32,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-18 12:49:32,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1180, Unknown=0, NotChecked=0, Total=1332 [2018-11-18 12:49:32,761 INFO L87 Difference]: Start difference. First operand 1607 states and 2050 transitions. cyclomatic complexity: 484 Second operand 37 states. [2018-11-18 12:49:35,289 WARN L180 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 49 [2018-11-18 12:49:38,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:49:38,293 INFO L93 Difference]: Finished difference Result 4322 states and 5450 transitions. [2018-11-18 12:49:38,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-11-18 12:49:38,293 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4322 states and 5450 transitions. [2018-11-18 12:49:38,305 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 289 [2018-11-18 12:49:38,310 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4322 states to 2721 states and 3439 transitions. [2018-11-18 12:49:38,311 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 908 [2018-11-18 12:49:38,311 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1218 [2018-11-18 12:49:38,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2721 states and 3439 transitions. [2018-11-18 12:49:38,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:49:38,311 INFO L705 BuchiCegarLoop]: Abstraction has 2721 states and 3439 transitions. [2018-11-18 12:49:38,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2721 states and 3439 transitions. [2018-11-18 12:49:38,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2721 to 1919. [2018-11-18 12:49:38,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1919 states. [2018-11-18 12:49:38,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1919 states to 1919 states and 2475 transitions. [2018-11-18 12:49:38,328 INFO L728 BuchiCegarLoop]: Abstraction has 1919 states and 2475 transitions. [2018-11-18 12:49:38,328 INFO L608 BuchiCegarLoop]: Abstraction has 1919 states and 2475 transitions. [2018-11-18 12:49:38,329 INFO L442 BuchiCegarLoop]: ======== Iteration 27============ [2018-11-18 12:49:38,329 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1919 states and 2475 transitions. [2018-11-18 12:49:38,332 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 193 [2018-11-18 12:49:38,333 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:49:38,333 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:49:38,333 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:49:38,333 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 12:49:38,333 INFO L794 eck$LassoCheckResult]: Stem: 42173#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 42168#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 42159#L565 assume !(main_~array_size~0 < 1); 42160#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;assume { :begin_inline_lis } true;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 42144#L552-4 assume true; 42145#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 42194#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 42195#L552-4 assume true; 42196#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 42186#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 42187#L552-4 assume true; 42198#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 42197#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 42146#L552-4 assume true; 42147#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 42192#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 42193#L552-4 assume true; 42179#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 42180#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 42190#L552-4 assume true; 42177#L552-1 assume !(lis_~i~0 < lis_~N); 42178#L552-5 lis_~i~0 := 1; 43188#L554-4 assume true; 43186#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 43185#L555-4 assume true; 43184#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 43183#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 43182#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 43181#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 43180#L555-4 assume true; 43179#L555-1 assume !(lis_~j~0 < lis_~i~0); 43177#L554-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 43176#L554-4 assume true; 43175#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 43174#L555-4 assume true; 43173#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 43171#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 43170#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 43169#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 43168#L555-4 assume true; 43167#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 43165#L556 assume !lis_#t~short11; 43156#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8; 43157#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 43415#L555-4 assume true; 43416#L555-1 assume !(lis_~j~0 < lis_~i~0); 43411#L554-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 43412#L554-4 assume true; 43407#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 43408#L555-4 assume true; 42161#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 42162#L556 assume !lis_#t~short11; 42153#L556-2 [2018-11-18 12:49:38,333 INFO L796 eck$LassoCheckResult]: Loop: 42153#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8; 42165#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 42170#L555-4 assume true; 42175#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 43718#L556 assume !lis_#t~short11; 42153#L556-2 [2018-11-18 12:49:38,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:49:38,334 INFO L82 PathProgramCache]: Analyzing trace with hash 233411854, now seen corresponding path program 7 times [2018-11-18 12:49:38,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:49:38,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:49:38,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:49:38,335 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:49:38,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:49:38,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:49:38,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:49:38,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:49:38,375 INFO L82 PathProgramCache]: Analyzing trace with hash 79251175, now seen corresponding path program 2 times [2018-11-18 12:49:38,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:49:38,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:49:38,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:49:38,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:49:38,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:49:38,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:49:38,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:49:38,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:49:38,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1733045766, now seen corresponding path program 8 times [2018-11-18 12:49:38,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:49:38,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:49:38,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:49:38,379 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:49:38,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:49:38,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:49:38,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:49:49,986 WARN L180 SmtUtils]: Spent 11.49 s on a formula simplification. DAG size of input: 388 DAG size of output: 267 [2018-11-18 12:49:53,415 WARN L180 SmtUtils]: Spent 3.42 s on a formula simplification that was a NOOP. DAG size: 180 [2018-11-18 12:49:53,418 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:49:53,418 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:49:53,418 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:49:53,418 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:49:53,418 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 12:49:53,418 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:49:53,418 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:49:53,418 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:49:53,419 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-termination.c.i_Iteration27_Lasso [2018-11-18 12:49:53,419 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:49:53,419 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:49:53,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:49:53,422 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-18 12:49:53,424 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-18 12:49:53,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:49:53,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:49:53,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:49:53,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:49:53,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:49:53,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:49:53,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:49:53,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:49:53,437 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-18 12:49:53,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:49:53,439 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-18 12:49:53,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:49:53,442 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-18 12:49:53,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:49:58,194 WARN L180 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 128 [2018-11-18 12:49:58,311 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-18 12:49:58,312 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-18 12:49:58,314 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-18 12:49:58,315 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-18 12:49:58,712 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:49:58,712 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 12:49:58,712 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:49:58,712 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:49:58,713 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:49:58,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:49:58,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:49:58,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:49:58,713 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:49:58,713 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:49:58,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:49:58,714 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:49:58,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:49:58,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:49:58,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:49:58,714 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:49:58,715 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:49:58,715 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:49:58,715 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:49:58,716 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:49:58,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:49:58,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:49:58,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:49:58,716 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:49:58,717 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:49:58,717 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:49:58,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:49:58,717 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:49:58,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:49:58,718 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:49:58,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:49:58,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:49:58,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:49:58,718 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:49:58,718 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:49:58,719 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:49:58,719 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:49:58,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:49:58,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:49:58,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:49:58,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:49:58,720 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:49:58,720 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:49:58,721 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:49:58,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:49:58,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:49:58,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:49:58,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:49:58,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:49:58,722 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:49:58,722 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:49:58,722 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:49:58,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:49:58,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:49:58,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:49:58,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:49:58,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:49:58,724 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:49:58,724 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:49:58,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:49:58,724 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:49:58,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:49:58,725 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:49:58,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:49:58,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:49:58,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:49:58,725 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:49:58,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:49:58,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:49:58,726 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:49:58,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:49:58,726 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:49:58,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:49:58,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:49:58,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:49:58,726 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:49:58,726 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:49:58,727 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:49:58,727 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:49:58,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:49:58,727 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:49:58,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:49:58,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:49:58,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:49:58,728 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:49:58,728 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:49:58,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:49:58,728 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:49:58,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:49:58,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:49:58,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:49:58,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:49:58,729 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:49:58,729 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:49:58,729 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:49:58,730 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:49:58,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:49:58,730 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:49:58,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:49:58,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:49:58,730 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:49:58,730 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:49:58,731 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:49:58,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:49:58,731 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:49:58,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:49:58,731 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:49:58,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:49:58,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:49:58,732 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:49:58,732 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:49:58,732 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:49:58,732 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:49:58,732 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:49:58,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:49:58,733 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:49:58,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:49:58,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:49:58,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:49:58,733 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:49:58,733 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:49:58,733 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:49:58,734 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:49:58,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:49:58,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:49:58,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:49:58,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:49:58,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:49:58,734 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:49:58,734 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:49:58,735 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:49:58,735 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:49:58,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:49:58,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:49:58,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:49:58,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:49:58,736 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:49:58,736 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:49:58,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:49:58,737 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:49:58,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:49:58,737 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:49:58,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:49:58,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:49:58,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:49:58,738 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:49:58,738 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:49:58,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:49:58,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:49:58,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:49:58,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:49:58,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:49:58,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:49:58,739 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:49:58,739 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:49:58,740 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:49:58,740 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:49:58,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:49:58,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:49:58,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:49:58,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:49:58,741 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:49:58,741 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:49:58,742 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:49:58,742 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:49:58,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:49:58,742 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:49:58,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:49:58,742 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:49:58,743 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:49:58,743 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:49:58,744 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:49:58,744 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:49:58,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:49:58,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:49:58,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:49:58,745 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:49:58,745 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:49:58,745 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:49:58,746 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:49:58,746 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:49:58,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:49:58,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:49:58,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:49:58,747 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:49:58,747 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:49:58,747 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:49:58,748 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:49:58,748 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:49:58,748 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:49:58,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:49:58,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:49:58,749 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:49:58,749 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:49:58,749 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:49:58,750 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:49:58,751 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:49:58,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:49:58,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:49:58,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:49:58,751 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:49:58,751 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:49:58,751 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:49:58,752 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:49:58,752 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:49:58,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:49:58,752 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:49:58,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:49:58,752 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:49:58,753 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:49:58,753 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:49:58,754 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:49:58,754 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:49:58,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:49:58,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:49:58,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:49:58,755 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:49:58,755 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:49:58,755 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:49:58,756 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:49:58,756 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:49:58,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:49:58,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:49:58,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:49:58,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:49:58,757 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:49:58,757 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:49:58,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:49:58,759 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:49:58,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:49:58,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:49:58,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:49:58,759 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:49:58,760 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:49:58,760 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:49:58,761 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:49:58,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:49:58,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:49:58,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:49:58,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:49:58,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:49:58,763 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:49:58,763 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:49:58,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:49:58,764 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:49:58,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:49:58,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:49:58,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:49:58,764 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:49:58,765 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:49:58,765 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:49:58,766 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:49:58,767 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:49:58,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:49:58,767 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:49:58,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:49:58,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:49:58,768 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:49:58,768 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:49:58,769 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:49:58,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:49:58,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:49:58,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:49:58,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:49:58,770 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:49:58,770 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:49:58,770 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:49:58,771 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:49:58,772 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:49:58,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:49:58,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:49:58,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:49:58,772 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:49:58,774 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:49:58,774 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:49:58,783 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 12:49:58,790 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 12:49:58,790 INFO L444 ModelExtractionUtils]: 42 out of 46 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 12:49:58,790 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 12:49:58,791 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 12:49:58,791 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 12:49:58,791 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~j~0) = -2*ULTIMATE.start_lis_~j~0 + 3 Supporting invariants [] [2018-11-18 12:49:59,696 INFO L297 tatePredicateManager]: 153 out of 155 supporting invariants were superfluous and have been removed [2018-11-18 12:49:59,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:49:59,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:49:59,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:49:59,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:49:59,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:49:59,798 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-18 12:49:59,798 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 3 loop predicates [2018-11-18 12:49:59,798 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1919 states and 2475 transitions. cyclomatic complexity: 607 Second operand 9 states. [2018-11-18 12:49:59,901 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1919 states and 2475 transitions. cyclomatic complexity: 607. Second operand 9 states. Result 2508 states and 3265 transitions. Complement of second has 12 states. [2018-11-18 12:49:59,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 5 stem states 2 non-accepting loop states 2 accepting loop states [2018-11-18 12:49:59,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 12:49:59,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 69 transitions. [2018-11-18 12:49:59,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 69 transitions. Stem has 52 letters. Loop has 5 letters. [2018-11-18 12:49:59,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:49:59,901 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 12:49:59,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:49:59,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:49:59,952 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:49:59,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:49:59,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:50:00,024 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-18 12:50:00,025 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.5 stem predicates 3 loop predicates [2018-11-18 12:50:00,025 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1919 states and 2475 transitions. cyclomatic complexity: 607 Second operand 9 states. [2018-11-18 12:50:00,124 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1919 states and 2475 transitions. cyclomatic complexity: 607. Second operand 9 states. Result 2551 states and 3304 transitions. Complement of second has 14 states. [2018-11-18 12:50:00,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 5 stem states 3 non-accepting loop states 2 accepting loop states [2018-11-18 12:50:00,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 12:50:00,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 70 transitions. [2018-11-18 12:50:00,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 70 transitions. Stem has 52 letters. Loop has 5 letters. [2018-11-18 12:50:00,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:50:00,125 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 12:50:00,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:50:00,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:50:00,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:50:00,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:50:00,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:50:00,229 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-18 12:50:00,229 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.5 stem predicates 3 loop predicates [2018-11-18 12:50:00,229 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1919 states and 2475 transitions. cyclomatic complexity: 607 Second operand 9 states. [2018-11-18 12:50:00,328 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1919 states and 2475 transitions. cyclomatic complexity: 607. Second operand 9 states. Result 3356 states and 4447 transitions. Complement of second has 15 states. [2018-11-18 12:50:00,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 5 stem states 2 non-accepting loop states 2 accepting loop states [2018-11-18 12:50:00,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 12:50:00,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 74 transitions. [2018-11-18 12:50:00,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 74 transitions. Stem has 52 letters. Loop has 5 letters. [2018-11-18 12:50:00,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:50:00,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 74 transitions. Stem has 57 letters. Loop has 5 letters. [2018-11-18 12:50:00,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:50:00,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 74 transitions. Stem has 52 letters. Loop has 10 letters. [2018-11-18 12:50:00,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:50:00,329 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3356 states and 4447 transitions. [2018-11-18 12:50:00,335 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 224 [2018-11-18 12:50:00,342 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3356 states to 3031 states and 3982 transitions. [2018-11-18 12:50:00,342 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 786 [2018-11-18 12:50:00,342 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1020 [2018-11-18 12:50:00,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3031 states and 3982 transitions. [2018-11-18 12:50:00,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:50:00,343 INFO L705 BuchiCegarLoop]: Abstraction has 3031 states and 3982 transitions. [2018-11-18 12:50:00,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3031 states and 3982 transitions. [2018-11-18 12:50:00,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3031 to 2646. [2018-11-18 12:50:00,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2646 states. [2018-11-18 12:50:00,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2646 states to 2646 states and 3541 transitions. [2018-11-18 12:50:00,362 INFO L728 BuchiCegarLoop]: Abstraction has 2646 states and 3541 transitions. [2018-11-18 12:50:00,362 INFO L608 BuchiCegarLoop]: Abstraction has 2646 states and 3541 transitions. [2018-11-18 12:50:00,362 INFO L442 BuchiCegarLoop]: ======== Iteration 28============ [2018-11-18 12:50:00,362 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2646 states and 3541 transitions. [2018-11-18 12:50:00,366 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 218 [2018-11-18 12:50:00,366 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:50:00,366 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:50:00,367 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:50:00,367 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 12:50:00,367 INFO L794 eck$LassoCheckResult]: Stem: 53751#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 53746#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 53737#L565 assume !(main_~array_size~0 < 1); 53738#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;assume { :begin_inline_lis } true;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 53722#L552-4 assume true; 53723#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 53777#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 53778#L552-4 assume true; 53779#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 53775#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 53776#L552-4 assume true; 53781#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 53780#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 53724#L552-4 assume true; 53725#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 53768#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 53769#L552-4 assume true; 53763#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 53764#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 53878#L552-4 assume true; 53761#L552-1 assume !(lis_~i~0 < lis_~N); 53762#L552-5 lis_~i~0 := 1; 55237#L554-4 assume true; 55235#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 55234#L555-4 assume true; 55233#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 55232#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 55231#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 55230#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 55229#L555-4 assume true; 55228#L555-1 assume !(lis_~j~0 < lis_~i~0); 55226#L554-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 55227#L554-4 assume true; 55361#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 55362#L555-4 assume true; 55357#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 55358#L556 assume !lis_#t~short11; 55353#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8; 55354#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 55349#L555-4 assume true; 55350#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 55339#L556 assume !lis_#t~short11; 55340#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8; 55549#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 55547#L555-4 assume true; 55545#L555-1 assume !(lis_~j~0 < lis_~i~0); 55543#L554-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 55541#L554-4 assume true; 55539#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 55523#L555-4 assume true; 55524#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 55921#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 55933#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8; 55599#L555-3 [2018-11-18 12:50:00,367 INFO L796 eck$LassoCheckResult]: Loop: 55599#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 55923#L555-4 assume true; 55929#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 55927#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 55924#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 55599#L555-3 [2018-11-18 12:50:00,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:50:00,367 INFO L82 PathProgramCache]: Analyzing trace with hash 331383913, now seen corresponding path program 9 times [2018-11-18 12:50:00,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:50:00,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:50:00,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:50:00,368 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:50:00,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:50:00,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:50:00,929 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 2 proven. 81 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 12:50:00,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:50:00,929 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_564e3793-cc27-4c48-b0d5-76f0bde905ba/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:50:00,936 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 12:50:01,005 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-18 12:50:01,006 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 12:50:01,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:50:01,017 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-18 12:50:01,027 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,030 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-18 12:50:01,030 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:50:01,037 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:50:01,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:50:01,043 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:14 [2018-11-18 12:50:01,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 28 [2018-11-18 12:50:01,059 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 12 treesize of output 11 [2018-11-18 12:50:01,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:50:01,065 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,066 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 27 treesize of output 41 [2018-11-18 12:50:01,068 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 26 treesize of output 20 [2018-11-18 12:50:01,069 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:50:01,073 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:50:01,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:50:01,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:50:01,083 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:53, output treesize:32 [2018-11-18 12:50:01,118 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,119 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,121 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,122 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 0 case distinctions, treesize of input 54 treesize of output 63 [2018-11-18 12:50:01,125 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,134 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 58 [2018-11-18 12:50:01,135 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 12:50:01,151 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,152 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,153 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,154 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 59 [2018-11-18 12:50:01,160 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,162 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,171 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 66 [2018-11-18 12:50:01,172 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 12:50:01,191 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:50:01,195 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:50:01,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:50:01,203 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:63, output treesize:46 [2018-11-18 12:50:01,248 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,249 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,250 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 79 [2018-11-18 12:50:01,255 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,257 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,258 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,259 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,268 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 89 [2018-11-18 12:50:01,269 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 12:50:01,293 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,294 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,296 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,296 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 75 [2018-11-18 12:50:01,299 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,302 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,303 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,305 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,308 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,309 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,310 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,317 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 121 [2018-11-18 12:50:01,317 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 12:50:01,347 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:50:01,354 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:50:01,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:50:01,365 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:81, output treesize:64 [2018-11-18 12:50:01,424 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,425 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,426 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,428 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 0 case distinctions, treesize of input 90 treesize of output 95 [2018-11-18 12:50:01,432 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,435 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,436 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,437 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,438 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,439 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,440 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,453 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 122 [2018-11-18 12:50:01,454 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 12:50:01,488 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,489 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,490 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,491 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 91 [2018-11-18 12:50:01,494 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,498 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,499 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,500 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,500 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,501 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,502 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,508 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,509 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,510 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,510 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,517 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,518 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,527 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 194 [2018-11-18 12:50:01,528 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 12:50:01,574 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:50:01,583 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:50:01,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:50:01,595 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:99, output treesize:82 [2018-11-18 12:50:01,663 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,664 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,665 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,667 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 0 case distinctions, treesize of input 108 treesize of output 111 [2018-11-18 12:50:01,671 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,677 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,678 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,679 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,680 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,681 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,683 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,684 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,685 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,686 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,687 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,704 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 58 treesize of output 163 [2018-11-18 12:50:01,705 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 12:50:01,750 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,751 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,751 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 107 [2018-11-18 12:50:01,757 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,760 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,761 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,761 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,762 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,763 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,764 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,764 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,765 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,766 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,767 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,772 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,772 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,773 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,774 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,775 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,776 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,776 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,777 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,778 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,779 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:01,790 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 22 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 58 treesize of output 291 [2018-11-18 12:50:01,791 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 12:50:01,859 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:50:01,871 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:50:01,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:50:01,886 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:117, output treesize:100 [2018-11-18 12:50:02,097 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:02,098 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:02,100 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:02,101 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:02,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 139 [2018-11-18 12:50:02,105 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:02,106 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:02,107 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:50:02,107 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:02,108 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:02,109 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:02,111 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:02,112 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:02,113 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:02,118 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:02,119 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:02,119 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:02,128 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 14 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 87 treesize of output 179 [2018-11-18 12:50:02,129 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 12:50:02,168 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:02,169 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:02,170 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:02,171 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:02,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 126 [2018-11-18 12:50:02,176 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:02,182 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:02,182 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:02,183 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:50:02,187 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:02,188 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:02,189 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:02,190 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:02,196 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:02,198 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:02,199 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:02,200 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:02,217 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 24 disjoint index pairs (out of 28 index pairs), introduced 2 new quantified variables, introduced 13 case distinctions, treesize of input 71 treesize of output 208 [2018-11-18 12:50:02,218 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-18 12:50:02,275 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:50:02,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 12:50:02,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 12:50:02,308 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:137, output treesize:118 [2018-11-18 12:50:02,542 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 12:50:02,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:50:02,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20] total 33 [2018-11-18 12:50:02,558 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 12:50:02,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:50:02,558 INFO L82 PathProgramCache]: Analyzing trace with hash 80566881, now seen corresponding path program 3 times [2018-11-18 12:50:02,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:50:02,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:50:02,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:50:02,559 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:50:02,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:50:02,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:50:02,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:50:02,672 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 71 [2018-11-18 12:50:02,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-18 12:50:02,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1008, Unknown=0, NotChecked=0, Total=1122 [2018-11-18 12:50:02,703 INFO L87 Difference]: Start difference. First operand 2646 states and 3541 transitions. cyclomatic complexity: 978 Second operand 34 states. [2018-11-18 12:50:07,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:50:07,500 INFO L93 Difference]: Finished difference Result 3218 states and 4216 transitions. [2018-11-18 12:50:07,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-11-18 12:50:07,501 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3218 states and 4216 transitions. [2018-11-18 12:50:07,506 INFO L131 ngComponentsAnalysis]: Automaton has 27 accepting balls. 279 [2018-11-18 12:50:07,512 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3218 states to 3216 states and 4214 transitions. [2018-11-18 12:50:07,513 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1126 [2018-11-18 12:50:07,513 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1127 [2018-11-18 12:50:07,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3216 states and 4214 transitions. [2018-11-18 12:50:07,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:50:07,513 INFO L705 BuchiCegarLoop]: Abstraction has 3216 states and 4214 transitions. [2018-11-18 12:50:07,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3216 states and 4214 transitions. [2018-11-18 12:50:07,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3216 to 2546. [2018-11-18 12:50:07,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2546 states. [2018-11-18 12:50:07,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2546 states to 2546 states and 3382 transitions. [2018-11-18 12:50:07,537 INFO L728 BuchiCegarLoop]: Abstraction has 2546 states and 3382 transitions. [2018-11-18 12:50:07,537 INFO L608 BuchiCegarLoop]: Abstraction has 2546 states and 3382 transitions. [2018-11-18 12:50:07,537 INFO L442 BuchiCegarLoop]: ======== Iteration 29============ [2018-11-18 12:50:07,537 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2546 states and 3382 transitions. [2018-11-18 12:50:07,541 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 213 [2018-11-18 12:50:07,541 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:50:07,541 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:50:07,541 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:50:07,541 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 12:50:07,542 INFO L794 eck$LassoCheckResult]: Stem: 59916#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 59911#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 59901#L565 assume !(main_~array_size~0 < 1); 59902#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;assume { :begin_inline_lis } true;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 59887#L552-4 assume true; 59888#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 59928#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 59945#L552-4 assume true; 59946#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 59933#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 59934#L552-4 assume true; 59948#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 59947#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 59889#L552-4 assume true; 59890#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 60021#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 59936#L552-4 assume true; 59938#L552-1 assume !(lis_~i~0 < lis_~N); 59891#L552-5 lis_~i~0 := 1; 59892#L554-4 assume true; 61286#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 61287#L555-4 assume true; 61304#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 61303#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 61302#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 61301#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 61300#L555-4 assume true; 61299#L555-1 assume !(lis_~j~0 < lis_~i~0); 61297#L554-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 61296#L554-4 assume true; 61295#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 61294#L555-4 assume true; 61293#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 61292#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 61291#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 61289#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 61290#L555-4 assume true; 61371#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 61368#L556 assume !lis_#t~short11; 61370#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8; 61453#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 61448#L555-4 assume true; 61449#L555-1 assume !(lis_~j~0 < lis_~i~0); 61444#L554-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 61445#L554-4 assume true; 61440#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 61441#L555-4 assume true; 61438#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 62408#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 62307#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 62308#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 62246#L555-4 assume true; 62247#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 62344#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 62375#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 61581#L555-3 [2018-11-18 12:50:07,542 INFO L796 eck$LassoCheckResult]: Loop: 61581#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 62374#L555-4 assume true; 62345#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 61852#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 61853#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 61581#L555-3 [2018-11-18 12:50:07,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:50:07,542 INFO L82 PathProgramCache]: Analyzing trace with hash 275956416, now seen corresponding path program 10 times [2018-11-18 12:50:07,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:50:07,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:50:07,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:50:07,543 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:50:07,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:50:07,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:50:07,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:50:07,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:50:07,598 INFO L82 PathProgramCache]: Analyzing trace with hash 80566881, now seen corresponding path program 4 times [2018-11-18 12:50:07,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:50:07,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:50:07,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:50:07,599 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:50:07,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:50:07,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:50:07,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:50:07,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:50:07,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1112443134, now seen corresponding path program 11 times [2018-11-18 12:50:07,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:50:07,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:50:07,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:50:07,616 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:50:07,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:50:07,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:50:08,360 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 125 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 12:50:08,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:50:08,360 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_564e3793-cc27-4c48-b0d5-76f0bde905ba/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:50:08,400 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 12:50:08,729 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-11-18 12:50:08,729 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 12:50:08,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:50:08,735 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 11 treesize of output 14 [2018-11-18 12:50:08,739 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:08,740 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:08,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 12:50:08,740 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:50:08,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:50:08,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:50:08,753 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2018-11-18 12:50:08,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 36 [2018-11-18 12:50:08,874 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:08,874 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:08,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 56 [2018-11-18 12:50:08,875 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:50:08,885 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 38 [2018-11-18 12:50:08,886 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 12 treesize of output 11 [2018-11-18 12:50:08,886 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:50:08,891 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:50:08,894 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:50:08,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:50:08,903 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:76, output treesize:49 [2018-11-18 12:50:09,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 89 [2018-11-18 12:50:09,086 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:09,087 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:50:09,088 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:09,088 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:09,089 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:09,090 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:09,091 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:50:09,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 204 [2018-11-18 12:50:09,092 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:50:09,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 96 [2018-11-18 12:50:09,115 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:09,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 112 [2018-11-18 12:50:09,115 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:50:09,125 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:50:09,132 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:50:09,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:50:09,145 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:122, output treesize:112 [2018-11-18 12:50:09,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 130 [2018-11-18 12:50:09,305 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:09,305 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:09,306 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:09,307 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:09,309 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:09,309 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:50:09,310 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:09,311 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:09,312 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:09,312 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:50:09,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 239 [2018-11-18 12:50:09,313 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:50:09,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 133 [2018-11-18 12:50:09,348 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:09,349 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:09,350 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:09,350 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 178 [2018-11-18 12:50:09,350 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:50:09,366 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:50:09,376 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:50:09,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 12:50:09,397 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:179, output treesize:161 [2018-11-18 12:50:09,525 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:09,527 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:09,527 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 0 case distinctions, treesize of input 188 treesize of output 195 [2018-11-18 12:50:09,531 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:09,531 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:50:09,532 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:09,534 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:09,535 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:09,536 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:09,537 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:09,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 268 [2018-11-18 12:50:09,538 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:50:09,571 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:09,572 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:09,573 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 129 [2018-11-18 12:50:09,577 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:09,578 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:09,581 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:09,594 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 103 treesize of output 152 [2018-11-18 12:50:09,596 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-18 12:50:09,665 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-18 12:50:09,708 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-18 12:50:09,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-11-18 12:50:09,766 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:206, output treesize:407 [2018-11-18 12:50:11,669 WARN L180 SmtUtils]: Spent 1.83 s on a formula simplification. DAG size of input: 99 DAG size of output: 44 [2018-11-18 12:50:11,771 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 15 proven. 104 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-18 12:50:11,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:50:11,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19] total 40 [2018-11-18 12:50:11,899 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 73 [2018-11-18 12:50:11,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-18 12:50:11,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1489, Unknown=0, NotChecked=0, Total=1640 [2018-11-18 12:50:11,928 INFO L87 Difference]: Start difference. First operand 2546 states and 3382 transitions. cyclomatic complexity: 916 Second operand 41 states. [2018-11-18 12:50:20,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:50:20,750 INFO L93 Difference]: Finished difference Result 3448 states and 4497 transitions. [2018-11-18 12:50:20,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-11-18 12:50:20,751 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3448 states and 4497 transitions. [2018-11-18 12:50:20,757 INFO L131 ngComponentsAnalysis]: Automaton has 29 accepting balls. 299 [2018-11-18 12:50:20,764 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3448 states to 3415 states and 4463 transitions. [2018-11-18 12:50:20,764 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1387 [2018-11-18 12:50:20,765 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1387 [2018-11-18 12:50:20,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3415 states and 4463 transitions. [2018-11-18 12:50:20,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:50:20,765 INFO L705 BuchiCegarLoop]: Abstraction has 3415 states and 4463 transitions. [2018-11-18 12:50:20,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3415 states and 4463 transitions. [2018-11-18 12:50:20,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3415 to 2870. [2018-11-18 12:50:20,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2870 states. [2018-11-18 12:50:20,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2870 states to 2870 states and 3812 transitions. [2018-11-18 12:50:20,785 INFO L728 BuchiCegarLoop]: Abstraction has 2870 states and 3812 transitions. [2018-11-18 12:50:20,785 INFO L608 BuchiCegarLoop]: Abstraction has 2870 states and 3812 transitions. [2018-11-18 12:50:20,785 INFO L442 BuchiCegarLoop]: ======== Iteration 30============ [2018-11-18 12:50:20,785 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2870 states and 3812 transitions. [2018-11-18 12:50:20,789 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 213 [2018-11-18 12:50:20,790 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:50:20,790 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:50:20,790 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 5, 5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-18 12:50:20,790 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 12:50:20,790 INFO L794 eck$LassoCheckResult]: Stem: 66369#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 66364#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 66355#L565 assume !(main_~array_size~0 < 1); 66356#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;assume { :begin_inline_lis } true;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 66340#L552-4 assume true; 66341#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 66380#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 66342#L552-4 assume true; 66343#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 66391#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 66392#L552-4 assume true; 66396#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 66395#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 66393#L552-4 assume true; 66394#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 66475#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 66388#L552-4 assume true; 66390#L552-1 assume !(lis_~i~0 < lis_~N); 66344#L552-5 lis_~i~0 := 1; 66345#L554-4 assume true; 67846#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 67847#L555-4 assume true; 67863#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 67862#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 67861#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 67860#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 67859#L555-4 assume true; 67858#L555-1 assume !(lis_~j~0 < lis_~i~0); 67856#L554-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 67857#L554-4 assume true; 67962#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 67958#L555-4 assume true; 67959#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 67954#L556 assume !lis_#t~short11; 67955#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8; 67950#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 67951#L555-4 assume true; 67946#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 67947#L556 assume !lis_#t~short11; 68001#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8; 68002#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 68057#L555-4 assume true; 68056#L555-1 assume !(lis_~j~0 < lis_~i~0); 68055#L554-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 68054#L554-4 assume true; 68053#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 68051#L555-4 assume true; 68052#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 68975#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 69199#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 69177#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 69175#L555-4 assume true; 69173#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 69174#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 69208#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 68238#L555-3 [2018-11-18 12:50:20,790 INFO L796 eck$LassoCheckResult]: Loop: 68238#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 69207#L555-4 assume true; 69206#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 68480#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 68481#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 68238#L555-3 [2018-11-18 12:50:20,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:50:20,790 INFO L82 PathProgramCache]: Analyzing trace with hash 917512960, now seen corresponding path program 12 times [2018-11-18 12:50:20,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:50:20,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:50:20,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:50:20,791 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:50:20,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:50:20,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:50:20,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:50:20,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:50:20,831 INFO L82 PathProgramCache]: Analyzing trace with hash 80566881, now seen corresponding path program 5 times [2018-11-18 12:50:20,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:50:20,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:50:20,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:50:20,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:50:20,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:50:20,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:50:20,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:50:20,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:50:20,836 INFO L82 PathProgramCache]: Analyzing trace with hash 872824514, now seen corresponding path program 13 times [2018-11-18 12:50:20,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:50:20,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:50:20,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:50:20,837 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:50:20,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:50:20,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:50:21,482 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 21 proven. 97 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 12:50:21,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:50:21,482 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_564e3793-cc27-4c48-b0d5-76f0bde905ba/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:50:21,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:50:21,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:50:21,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:50:21,518 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 11 treesize of output 14 [2018-11-18 12:50:21,523 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:21,524 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:21,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 12:50:21,524 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:50:21,527 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:50:21,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:50:21,530 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:8 [2018-11-18 12:50:21,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 28 [2018-11-18 12:50:21,588 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 12 treesize of output 11 [2018-11-18 12:50:21,588 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:50:21,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-11-18 12:50:21,598 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 12 treesize of output 11 [2018-11-18 12:50:21,598 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:50:21,605 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:50:21,608 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:50:21,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:50:21,614 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:47, output treesize:30 [2018-11-18 12:50:21,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2018-11-18 12:50:21,674 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:21,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-18 12:50:21,675 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:50:21,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2018-11-18 12:50:21,689 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:21,690 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:21,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-18 12:50:21,691 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:50:21,699 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:50:21,704 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:50:21,710 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:50:21,710 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:56, output treesize:41 [2018-11-18 12:50:21,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 72 [2018-11-18 12:50:21,790 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:21,791 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:21,792 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:21,795 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:21,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 89 [2018-11-18 12:50:21,807 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-18 12:50:21,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 60 [2018-11-18 12:50:21,840 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:21,841 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:21,842 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:21,842 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:21,843 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:21,844 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:21,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 94 [2018-11-18 12:50:21,844 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:50:21,859 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:50:21,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 70 [2018-11-18 12:50:21,867 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:21,868 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:21,869 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:21,870 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:21,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 74 [2018-11-18 12:50:21,872 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 12:50:21,886 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:50:21,906 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 12:50:21,930 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-18 12:50:21,930 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:103, output treesize:133 [2018-11-18 12:50:22,284 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:22,287 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 129 [2018-11-18 12:50:22,291 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:22,292 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:22,293 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:50:22,294 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:22,299 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:22,300 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 119 [2018-11-18 12:50:22,300 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:50:22,329 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:22,329 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 93 treesize of output 98 [2018-11-18 12:50:22,332 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:22,333 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:22,334 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:22,335 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:22,335 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:50:22,336 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:22,337 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:22,337 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:22,338 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:22,339 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:22,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 160 [2018-11-18 12:50:22,340 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:50:22,362 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:50:22,374 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:50:22,447 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:22,448 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 138 [2018-11-18 12:50:22,454 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:22,458 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:22,459 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:22,460 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:50:22,460 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:22,461 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:22,462 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:22,463 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:22,468 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:22,478 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:22,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 95 treesize of output 271 [2018-11-18 12:50:22,495 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 3 xjuncts. [2018-11-18 12:50:22,581 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:22,583 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 136 treesize of output 139 [2018-11-18 12:50:22,586 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:22,587 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:22,588 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:22,589 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:22,589 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:50:22,590 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:22,592 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:22,593 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:22,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 162 [2018-11-18 12:50:22,594 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 12:50:22,619 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:50:22,622 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:22,624 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 116 treesize of output 121 [2018-11-18 12:50:22,628 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:22,628 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:22,629 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:50:22,629 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:22,630 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:50:22,631 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:22,631 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:22,632 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 119 [2018-11-18 12:50:22,632 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 12:50:22,655 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:50:22,689 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 12:50:22,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 12:50:22,739 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 2 variables, input treesize:300, output treesize:315 [2018-11-18 12:50:23,120 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2018-11-18 12:50:23,130 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:23,131 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 200 treesize of output 178 [2018-11-18 12:50:23,139 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:23,141 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:23,142 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:23,146 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:23,148 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:23,149 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:23,152 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:23,152 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:50:23,153 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:23,155 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:23,157 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:23,161 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:23,164 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:23,167 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:23,168 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:23,169 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:23,172 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:23,174 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:23,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 116 treesize of output 428 [2018-11-18 12:50:23,177 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:50:23,242 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:23,244 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 132 treesize of output 137 [2018-11-18 12:50:23,247 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:23,248 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:23,249 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:23,252 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:23,252 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:23,253 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:23,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 126 [2018-11-18 12:50:23,254 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:50:23,276 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:50:23,291 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:50:23,530 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:23,530 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 154 [2018-11-18 12:50:23,534 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:23,535 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:23,536 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:23,537 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:23,538 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:23,539 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:23,541 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:23,543 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:23,544 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:23,545 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:23,546 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:23,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 257 [2018-11-18 12:50:23,547 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 12:50:23,589 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:23,590 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 120 treesize of output 125 [2018-11-18 12:50:23,594 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:23,594 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:23,595 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:23,596 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:23,597 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:23,597 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:23,598 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:23,598 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:50:23,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 147 [2018-11-18 12:50:23,599 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 12:50:23,627 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:50:23,641 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:50:23,762 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:23,763 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 160 [2018-11-18 12:50:23,767 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:23,768 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:23,769 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:23,770 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:23,771 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:23,772 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:23,773 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:50:23,774 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:23,775 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:23,775 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:50:23,776 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:23,777 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:50:23,778 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 255 [2018-11-18 12:50:23,778 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 12:50:23,819 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:23,821 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 105 treesize of output 110 [2018-11-18 12:50:23,827 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:23,828 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:23,828 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:23,829 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:23,830 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:23,836 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:23,837 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:23,838 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:23,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 142 [2018-11-18 12:50:23,839 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-18 12:50:23,859 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:50:23,873 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:50:23,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-11-18 12:50:23,928 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 9 variables, input treesize:553, output treesize:359 [2018-11-18 12:50:24,275 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 2 proven. 118 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 12:50:24,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:50:24,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19] total 40 [2018-11-18 12:50:24,409 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 71 [2018-11-18 12:50:24,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-18 12:50:24,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1506, Unknown=0, NotChecked=0, Total=1640 [2018-11-18 12:50:24,445 INFO L87 Difference]: Start difference. First operand 2870 states and 3812 transitions. cyclomatic complexity: 1031 Second operand 41 states. [2018-11-18 12:50:25,489 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 76 [2018-11-18 12:50:25,765 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 79 [2018-11-18 12:50:26,581 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 57 [2018-11-18 12:50:29,330 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 68 [2018-11-18 12:50:29,682 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 70 [2018-11-18 12:50:30,368 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 80 [2018-11-18 12:50:30,544 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 76 [2018-11-18 12:50:31,284 WARN L180 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 108 [2018-11-18 12:50:31,728 WARN L180 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 104 [2018-11-18 12:50:32,025 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2018-11-18 12:50:32,343 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 94 [2018-11-18 12:50:32,708 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 101 [2018-11-18 12:50:33,018 WARN L180 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 106 [2018-11-18 12:50:34,056 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 103 [2018-11-18 12:50:36,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:50:36,968 INFO L93 Difference]: Finished difference Result 3491 states and 4562 transitions. [2018-11-18 12:50:36,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-11-18 12:50:36,968 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3491 states and 4562 transitions. [2018-11-18 12:50:36,975 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 263 [2018-11-18 12:50:36,981 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3491 states to 3458 states and 4524 transitions. [2018-11-18 12:50:36,981 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1390 [2018-11-18 12:50:36,981 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1390 [2018-11-18 12:50:36,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3458 states and 4524 transitions. [2018-11-18 12:50:36,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:50:36,982 INFO L705 BuchiCegarLoop]: Abstraction has 3458 states and 4524 transitions. [2018-11-18 12:50:36,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3458 states and 4524 transitions. [2018-11-18 12:50:37,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3458 to 2957. [2018-11-18 12:50:37,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2957 states. [2018-11-18 12:50:37,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2957 states to 2957 states and 3913 transitions. [2018-11-18 12:50:37,006 INFO L728 BuchiCegarLoop]: Abstraction has 2957 states and 3913 transitions. [2018-11-18 12:50:37,006 INFO L608 BuchiCegarLoop]: Abstraction has 2957 states and 3913 transitions. [2018-11-18 12:50:37,006 INFO L442 BuchiCegarLoop]: ======== Iteration 31============ [2018-11-18 12:50:37,006 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2957 states and 3913 transitions. [2018-11-18 12:50:37,012 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 218 [2018-11-18 12:50:37,012 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:50:37,013 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:50:37,013 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 5, 5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-18 12:50:37,013 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 12:50:37,013 INFO L794 eck$LassoCheckResult]: Stem: 73167#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 73162#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 73153#L565 assume !(main_~array_size~0 < 1); 73154#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;assume { :begin_inline_lis } true;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 73138#L552-4 assume true; 73139#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 73191#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 73192#L552-4 assume true; 73193#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 73189#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 73190#L552-4 assume true; 73195#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 73194#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 73140#L552-4 assume true; 73141#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 73272#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 73187#L552-4 assume true; 73188#L552-1 assume !(lis_~i~0 < lis_~N); 73142#L552-5 lis_~i~0 := 1; 73143#L554-4 assume true; 74657#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 74659#L555-4 assume true; 74724#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 74723#L556 assume !lis_#t~short11; 74722#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8; 74721#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 74720#L555-4 assume true; 74719#L555-1 assume !(lis_~j~0 < lis_~i~0); 74718#L554-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 74717#L554-4 assume true; 74716#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 74715#L555-4 assume true; 74714#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 74712#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 74713#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 74757#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 74756#L555-4 assume true; 74753#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 74747#L556 assume !lis_#t~short11; 74748#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8; 74611#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 74612#L555-4 assume true; 74607#L555-1 assume !(lis_~j~0 < lis_~i~0); 74608#L554-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 73182#L554-4 assume true; 73183#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 74938#L555-4 assume true; 74940#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 76058#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 76035#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 76034#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 76033#L555-4 assume true; 76032#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 75929#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 75429#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8; 75198#L555-3 [2018-11-18 12:50:37,013 INFO L796 eck$LassoCheckResult]: Loop: 75198#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 75532#L555-4 assume true; 75531#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 75439#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 75425#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 75198#L555-3 [2018-11-18 12:50:37,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:50:37,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1252315906, now seen corresponding path program 14 times [2018-11-18 12:50:37,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:50:37,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:50:37,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:50:37,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:50:37,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:50:37,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:50:37,661 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 45 proven. 43 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-18 12:50:37,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:50:37,661 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_564e3793-cc27-4c48-b0d5-76f0bde905ba/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:50:37,667 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 12:50:37,689 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 12:50:37,689 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 12:50:37,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:50:37,698 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:37,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-18 12:50:37,710 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:37,712 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:37,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-18 12:50:37,712 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:50:37,720 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:50:37,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:50:37,724 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:16 [2018-11-18 12:50:37,901 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 0 case distinctions, treesize of input 94 treesize of output 74 [2018-11-18 12:50:37,904 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:37,906 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:50:37,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 56 [2018-11-18 12:50:37,906 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:50:37,928 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 71 treesize of output 80 [2018-11-18 12:50:37,930 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 12 treesize of output 11 [2018-11-18 12:50:37,930 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:50:37,940 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:50:37,947 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:50:37,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-18 12:50:37,960 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:112, output treesize:85 [2018-11-18 12:50:38,051 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 49 proven. 15 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-18 12:50:38,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:50:38,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 28 [2018-11-18 12:50:38,066 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 12:50:38,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:50:38,066 INFO L82 PathProgramCache]: Analyzing trace with hash 80566881, now seen corresponding path program 6 times [2018-11-18 12:50:38,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:50:38,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:50:38,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:50:38,067 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:50:38,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:50:38,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:50:38,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:50:38,180 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 71 [2018-11-18 12:50:38,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-18 12:50:38,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=648, Unknown=0, NotChecked=0, Total=756 [2018-11-18 12:50:38,213 INFO L87 Difference]: Start difference. First operand 2957 states and 3913 transitions. cyclomatic complexity: 1045 Second operand 28 states. [2018-11-18 12:50:40,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:50:40,415 INFO L93 Difference]: Finished difference Result 3225 states and 4193 transitions. [2018-11-18 12:50:40,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-18 12:50:40,415 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3225 states and 4193 transitions. [2018-11-18 12:50:40,422 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 259 [2018-11-18 12:50:40,429 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3225 states to 3220 states and 4188 transitions. [2018-11-18 12:50:40,429 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1269 [2018-11-18 12:50:40,430 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1269 [2018-11-18 12:50:40,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3220 states and 4188 transitions. [2018-11-18 12:50:40,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:50:40,430 INFO L705 BuchiCegarLoop]: Abstraction has 3220 states and 4188 transitions. [2018-11-18 12:50:40,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3220 states and 4188 transitions. [2018-11-18 12:50:40,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3220 to 2999. [2018-11-18 12:50:40,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2999 states. [2018-11-18 12:50:40,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2999 states to 2999 states and 3914 transitions. [2018-11-18 12:50:40,456 INFO L728 BuchiCegarLoop]: Abstraction has 2999 states and 3914 transitions. [2018-11-18 12:50:40,456 INFO L608 BuchiCegarLoop]: Abstraction has 2999 states and 3914 transitions. [2018-11-18 12:50:40,456 INFO L442 BuchiCegarLoop]: ======== Iteration 32============ [2018-11-18 12:50:40,456 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2999 states and 3914 transitions. [2018-11-18 12:50:40,462 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 218 [2018-11-18 12:50:40,462 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:50:40,463 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:50:40,463 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 5, 5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-18 12:50:40,463 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 12:50:40,463 INFO L794 eck$LassoCheckResult]: Stem: 79607#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 79602#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 79592#L565 assume !(main_~array_size~0 < 1); 79593#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;assume { :begin_inline_lis } true;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 79577#L552-4 assume true; 79578#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 79629#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 79579#L552-4 assume true; 79580#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 79627#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 79628#L552-4 assume true; 79633#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 79632#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 79630#L552-4 assume true; 79631#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 79710#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 79625#L552-4 assume true; 79626#L552-1 assume !(lis_~i~0 < lis_~N); 79581#L552-5 lis_~i~0 := 1; 79582#L554-4 assume true; 81159#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 81161#L555-4 assume true; 81176#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 81175#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 81174#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 81173#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 81172#L555-4 assume true; 81171#L555-1 assume !(lis_~j~0 < lis_~i~0); 81169#L554-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 81170#L554-4 assume true; 81272#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 81268#L555-4 assume true; 81269#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 81264#L556 assume !lis_#t~short11; 81265#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8; 81258#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 81259#L555-4 assume true; 81250#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 81251#L556 assume !lis_#t~short11; 81329#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8; 81330#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 81325#L555-4 assume true; 81326#L555-1 assume !(lis_~j~0 < lis_~i~0); 81321#L554-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 81322#L554-4 assume true; 81317#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 81318#L555-4 assume true; 81742#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 82559#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 82563#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 82562#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 82560#L555-4 assume true; 82561#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 79585#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 79586#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 79599#L555-3 [2018-11-18 12:50:40,463 INFO L796 eck$LassoCheckResult]: Loop: 79599#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 79608#L555-4 assume true; 79594#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 79595#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 79598#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8; 79599#L555-3 [2018-11-18 12:50:40,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:50:40,464 INFO L82 PathProgramCache]: Analyzing trace with hash 917512960, now seen corresponding path program 15 times [2018-11-18 12:50:40,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:50:40,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:50:40,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:50:40,464 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:50:40,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:50:40,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:50:40,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:50:40,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:50:40,514 INFO L82 PathProgramCache]: Analyzing trace with hash 80566883, now seen corresponding path program 2 times [2018-11-18 12:50:40,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:50:40,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:50:40,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:50:40,514 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:50:40,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:50:40,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:50:40,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:50:40,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:50:40,518 INFO L82 PathProgramCache]: Analyzing trace with hash 872824516, now seen corresponding path program 16 times [2018-11-18 12:50:40,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:50:40,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:50:40,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:50:40,518 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:50:40,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:50:40,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:50:40,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:51:02,343 WARN L180 SmtUtils]: Spent 21.68 s on a formula simplification. DAG size of input: 415 DAG size of output: 283 [2018-11-18 12:51:10,309 WARN L180 SmtUtils]: Spent 7.96 s on a formula simplification that was a NOOP. DAG size: 168 [2018-11-18 12:51:10,311 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:51:10,312 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:51:10,312 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:51:10,312 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:51:10,312 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 12:51:10,312 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:51:10,312 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:51:10,312 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:51:10,312 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-termination.c.i_Iteration32_Lasso [2018-11-18 12:51:10,312 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:51:10,312 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:51:10,314 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-18 12:51:10,315 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-18 12:51:10,317 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-18 12:51:10,319 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-18 12:51:10,320 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-18 12:51:10,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:51:10,322 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-18 12:51:10,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:51:10,325 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-18 12:51:10,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:51:10,328 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-18 12:51:10,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:51:10,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:51:10,331 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-18 12:51:10,332 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-18 12:51:10,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:51:10,334 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-18 12:51:10,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:51:10,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:51:10,337 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-18 12:51:10,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:51:10,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:51:10,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:51:10,341 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-18 12:51:10,341 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-18 12:51:25,602 WARN L180 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 114 [2018-11-18 12:51:25,761 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 76 [2018-11-18 12:51:25,957 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2018-11-18 12:51:26,190 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:51:26,190 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 12:51:26,190 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:51:26,190 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:51:26,190 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:51:26,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:51:26,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:51:26,191 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:51:26,191 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:51:26,191 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:51:26,191 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:51:26,191 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:51:26,191 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:51:26,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:51:26,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:51:26,191 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:51:26,192 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:51:26,192 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:51:26,192 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:51:26,192 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:51:26,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:51:26,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:51:26,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:51:26,193 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:51:26,193 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:51:26,193 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:51:26,194 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:51:26,194 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:51:26,194 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:51:26,194 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:51:26,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:51:26,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:51:26,194 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:51:26,194 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:51:26,194 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:51:26,194 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:51:26,194 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:51:26,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:51:26,195 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:51:26,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:51:26,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:51:26,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:51:26,195 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:51:26,195 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:51:26,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:51:26,195 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:51:26,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:51:26,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:51:26,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:51:26,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:51:26,196 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:51:26,196 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:51:26,196 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:51:26,196 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:51:26,196 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:51:26,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:51:26,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:51:26,196 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:51:26,196 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:51:26,197 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:51:26,197 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:51:26,197 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:51:26,197 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:51:26,197 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:51:26,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:51:26,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:51:26,197 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:51:26,197 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:51:26,197 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:51:26,198 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:51:26,198 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:51:26,198 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:51:26,198 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:51:26,198 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:51:26,198 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:51:26,198 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:51:26,198 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:51:26,199 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:51:26,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-18 12:51:26,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:51:26,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:51:26,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:51:26,199 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:51:26,199 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:51:26,199 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:51:26,200 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:51:26,200 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:51:26,200 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:51:26,200 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:51:26,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:51:26,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:51:26,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:51:26,200 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:51:26,200 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:51:26,200 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:51:26,200 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:51:26,201 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:51:26,201 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:51:26,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:51:26,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:51:26,201 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:51:26,201 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:51:26,201 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:51:26,201 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:51:26,201 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:51:26,201 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:51:26,201 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:51:26,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:51:26,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:51:26,201 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:51:26,202 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:51:26,202 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:51:26,202 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:51:26,202 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:51:26,202 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:51:26,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:51:26,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:51:26,202 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:51:26,202 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:51:26,202 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:51:26,203 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:51:26,203 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:51:26,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:51:26,203 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:51:26,203 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:51:26,203 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:51:26,203 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:51:26,203 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:51:26,203 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:51:26,203 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:51:26,204 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:51:26,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:51:26,204 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:51:26,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:51:26,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:51:26,204 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:51:26,204 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:51:26,204 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:51:26,204 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:51:26,204 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:51:26,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:51:26,204 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:51:26,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:51:26,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:51:26,204 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:51:26,205 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:51:26,205 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:51:26,205 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:51:26,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-18 12:51:26,205 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:51:26,205 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:51:26,205 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:51:26,205 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:51:26,205 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:51:26,205 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:51:26,205 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:51:26,205 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:51:26,206 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:51:26,206 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:51:26,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:51:26,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:51:26,206 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:51:26,206 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:51:26,206 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:51:26,207 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:51:26,207 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:51:26,207 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:51:26,207 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:51:26,207 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:51:26,207 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:51:26,207 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:51:26,207 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:51:26,207 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:51:26,207 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:51:26,207 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:51:26,208 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:51:26,208 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:51:26,208 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:51:26,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:51:26,208 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:51:26,208 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:51:26,208 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:51:26,208 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:51:26,208 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:51:26,208 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:51:26,208 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:51:26,208 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:51:26,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:51:26,209 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:51:26,209 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:51:26,209 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:51:26,209 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:51:26,209 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:51:26,209 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:51:26,209 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:51:26,209 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:51:26,209 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:51:26,209 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:51:26,209 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:51:26,209 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:51:26,210 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:51:26,210 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:51:26,210 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:51:26,210 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:51:26,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:51:26,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:51:26,210 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:51:26,210 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:51:26,210 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:51:26,210 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:51:26,210 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:51:26,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:51:26,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:51:26,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:51:26,211 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:51:26,211 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:51:26,211 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:51:26,211 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:51:26,212 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:51:26,212 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:51:26,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:51:26,212 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:51:26,212 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:51:26,212 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:51:26,212 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:51:26,213 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:51:26,213 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:51:26,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:51:26,213 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:51:26,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:51:26,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:51:26,213 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:51:26,213 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:51:26,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:51:26,213 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:51:26,214 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:51:26,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:51:26,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:51:26,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:51:26,214 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:51:26,214 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:51:26,215 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:51:26,216 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:51:26,216 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:51:26,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:51:26,217 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:51:26,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:51:26,217 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:51:26,217 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:51:26,217 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:51:26,218 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:51:26,218 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:51:26,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:51:26,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:51:26,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:51:26,218 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:51:26,218 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:51:26,218 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:51:26,219 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:51:26,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-18 12:51:26,219 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:51:26,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:51:26,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:51:26,219 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:51:26,220 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:51:26,220 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:51:26,221 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:51:26,222 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:51:26,222 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:51:26,222 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:51:26,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:51:26,222 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:51:26,222 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:51:26,222 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:51:26,223 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:51:26,224 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:51:26,224 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:51:26,224 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:51:26,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:51:26,224 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:51:26,224 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:51:26,224 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:51:26,225 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:51:26,225 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:51:26,226 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:51:26,226 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:51:26,226 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:51:26,226 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:51:26,227 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:51:26,227 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:51:26,228 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:51:26,228 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:51:26,229 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:51:26,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:51:26,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:51:26,229 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:51:26,229 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:51:26,229 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:51:26,229 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:51:26,230 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-18 12:51:26,230 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:51:26,230 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:51:26,230 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:51:26,230 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:51:26,231 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:51:26,231 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:51:26,241 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 12:51:26,254 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-18 12:51:26,254 INFO L444 ModelExtractionUtils]: 55 out of 61 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-18 12:51:26,254 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 12:51:26,255 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 12:51:26,255 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 12:51:26,255 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~j~0) = -2*ULTIMATE.start_lis_~j~0 + 3 Supporting invariants [] [2018-11-18 12:51:29,122 INFO L297 tatePredicateManager]: 131 out of 132 supporting invariants were superfluous and have been removed [2018-11-18 12:51:29,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:51:29,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:51:29,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:51:29,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:51:29,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:51:29,198 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-18 12:51:29,198 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 3 loop predicates [2018-11-18 12:51:29,198 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2999 states and 3914 transitions. cyclomatic complexity: 1004 Second operand 7 states. [2018-11-18 12:51:29,283 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2999 states and 3914 transitions. cyclomatic complexity: 1004. Second operand 7 states. Result 3363 states and 4399 transitions. Complement of second has 11 states. [2018-11-18 12:51:29,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 2 non-accepting loop states 2 accepting loop states [2018-11-18 12:51:29,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 12:51:29,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 70 transitions. [2018-11-18 12:51:29,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 70 transitions. Stem has 55 letters. Loop has 5 letters. [2018-11-18 12:51:29,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:51:29,284 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 12:51:29,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:51:29,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:51:29,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:51:29,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:51:29,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:51:29,381 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-18 12:51:29,381 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 3 loop predicates [2018-11-18 12:51:29,382 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2999 states and 3914 transitions. cyclomatic complexity: 1004 Second operand 7 states. [2018-11-18 12:51:29,493 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2999 states and 3914 transitions. cyclomatic complexity: 1004. Second operand 7 states. Result 3388 states and 4395 transitions. Complement of second has 11 states. [2018-11-18 12:51:29,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 2 non-accepting loop states 2 accepting loop states [2018-11-18 12:51:29,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 12:51:29,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 70 transitions. [2018-11-18 12:51:29,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 70 transitions. Stem has 55 letters. Loop has 5 letters. [2018-11-18 12:51:29,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:51:29,495 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 12:51:29,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:51:29,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:51:29,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:51:29,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:51:29,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:51:29,600 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-18 12:51:29,600 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 3 loop predicates [2018-11-18 12:51:29,600 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2999 states and 3914 transitions. cyclomatic complexity: 1004 Second operand 7 states. [2018-11-18 12:51:29,706 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2999 states and 3914 transitions. cyclomatic complexity: 1004. Second operand 7 states. Result 4422 states and 5856 transitions. Complement of second has 14 states. [2018-11-18 12:51:29,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 2 non-accepting loop states 2 accepting loop states [2018-11-18 12:51:29,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 12:51:29,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2018-11-18 12:51:29,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 74 transitions. Stem has 55 letters. Loop has 5 letters. [2018-11-18 12:51:29,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:51:29,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 74 transitions. Stem has 60 letters. Loop has 5 letters. [2018-11-18 12:51:29,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:51:29,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 74 transitions. Stem has 55 letters. Loop has 10 letters. [2018-11-18 12:51:29,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:51:29,708 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4422 states and 5856 transitions. [2018-11-18 12:51:29,720 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 199 [2018-11-18 12:51:29,730 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4422 states to 3560 states and 4595 transitions. [2018-11-18 12:51:29,730 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 935 [2018-11-18 12:51:29,731 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1198 [2018-11-18 12:51:29,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3560 states and 4595 transitions. [2018-11-18 12:51:29,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:51:29,731 INFO L705 BuchiCegarLoop]: Abstraction has 3560 states and 4595 transitions. [2018-11-18 12:51:29,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3560 states and 4595 transitions. [2018-11-18 12:51:29,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3560 to 2711. [2018-11-18 12:51:29,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2711 states. [2018-11-18 12:51:29,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2711 states to 2711 states and 3534 transitions. [2018-11-18 12:51:29,753 INFO L728 BuchiCegarLoop]: Abstraction has 2711 states and 3534 transitions. [2018-11-18 12:51:29,753 INFO L608 BuchiCegarLoop]: Abstraction has 2711 states and 3534 transitions. [2018-11-18 12:51:29,753 INFO L442 BuchiCegarLoop]: ======== Iteration 33============ [2018-11-18 12:51:29,753 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2711 states and 3534 transitions. [2018-11-18 12:51:29,759 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 183 [2018-11-18 12:51:29,759 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:51:29,759 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:51:29,760 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1] [2018-11-18 12:51:29,760 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 12:51:29,760 INFO L794 eck$LassoCheckResult]: Stem: 94944#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 94939#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 94929#L565 assume !(main_~array_size~0 < 1); 94930#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;assume { :begin_inline_lis } true;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 94913#L552-4 assume true; 94914#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 94970#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 94915#L552-4 assume true; 94916#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 94968#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 94969#L552-4 assume true; 94976#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 94975#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 94973#L552-4 assume true; 94974#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 94961#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 94962#L552-4 assume true; 94950#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 94951#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 95073#L552-4 assume true; 94948#L552-1 assume !(lis_~i~0 < lis_~N); 94949#L552-5 lis_~i~0 := 1; 96439#L554-4 assume true; 96437#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 96436#L555-4 assume true; 96435#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 96434#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 96433#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 96432#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 96431#L555-4 assume true; 96430#L555-1 assume !(lis_~j~0 < lis_~i~0); 96428#L554-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 96427#L554-4 assume true; 96426#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 96425#L555-4 assume true; 96424#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 96422#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 96421#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 96420#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 96419#L555-4 assume true; 96418#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 96416#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 96417#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 96491#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 96490#L555-4 assume true; 96489#L555-1 assume !(lis_~j~0 < lis_~i~0); 96488#L554-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 96487#L554-4 assume true; 96486#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 96485#L555-4 assume true; 96484#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 96483#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 96482#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 96480#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 96481#L555-4 assume true; 97062#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 97061#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 97060#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 97059#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 97058#L555-4 assume true; 97057#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 97053#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 97052#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 97051#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 97050#L555-4 assume true; 97049#L555-1 assume !(lis_~j~0 < lis_~i~0); 97048#L554-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 97047#L554-4 assume true; 97046#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 96996#L555-4 [2018-11-18 12:51:29,760 INFO L796 eck$LassoCheckResult]: Loop: 96996#L555-4 assume true; 96969#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 96627#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 96628#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8; 96595#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 96996#L555-4 [2018-11-18 12:51:29,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:51:29,760 INFO L82 PathProgramCache]: Analyzing trace with hash 8161101, now seen corresponding path program 12 times [2018-11-18 12:51:29,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:51:29,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:51:29,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:51:29,761 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:51:29,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:51:29,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:51:29,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:51:29,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:51:29,841 INFO L82 PathProgramCache]: Analyzing trace with hash 64095593, now seen corresponding path program 3 times [2018-11-18 12:51:29,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:51:29,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:51:29,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:51:29,842 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:51:29,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:51:29,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:51:29,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:51:29,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:51:29,845 INFO L82 PathProgramCache]: Analyzing trace with hash -792580707, now seen corresponding path program 5 times [2018-11-18 12:51:29,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:51:29,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:51:29,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:51:29,846 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:51:29,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:51:29,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:51:31,189 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 11 proven. 194 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 12:51:31,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:51:31,189 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_564e3793-cc27-4c48-b0d5-76f0bde905ba/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:51:31,197 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 12:51:32,515 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-11-18 12:51:32,515 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 12:51:32,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:51:32,524 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 11 treesize of output 14 [2018-11-18 12:51:32,540 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:32,542 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:32,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 12:51:32,542 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:51:32,545 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:51:32,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:51:32,558 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2018-11-18 12:51:32,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 28 [2018-11-18 12:51:32,586 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 12 treesize of output 11 [2018-11-18 12:51:32,586 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:51:32,593 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:32,594 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 27 treesize of output 41 [2018-11-18 12:51:32,597 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 26 treesize of output 20 [2018-11-18 12:51:32,597 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:51:32,602 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:51:32,606 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:51:32,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:51:32,614 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:56, output treesize:35 [2018-11-18 12:51:32,667 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:32,668 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:32,670 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:32,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 63 [2018-11-18 12:51:32,675 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:32,683 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 58 [2018-11-18 12:51:32,684 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 12:51:32,699 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:32,700 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:32,702 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:32,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 59 [2018-11-18 12:51:32,707 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:32,709 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:32,716 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 66 [2018-11-18 12:51:32,716 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 12:51:32,731 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:51:32,736 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:51:32,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:51:32,745 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:66, output treesize:49 [2018-11-18 12:51:32,804 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:32,805 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:32,807 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:32,808 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 0 case distinctions, treesize of input 72 treesize of output 79 [2018-11-18 12:51:32,812 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:32,815 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:32,815 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:32,816 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:32,826 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 89 [2018-11-18 12:51:32,827 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 12:51:32,851 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:32,852 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:32,853 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:32,854 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 75 [2018-11-18 12:51:32,857 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:32,859 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:32,860 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:32,861 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:32,864 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:32,865 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:32,866 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:32,874 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 121 [2018-11-18 12:51:32,874 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 12:51:32,900 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:51:32,907 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:51:32,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:51:32,918 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:84, output treesize:67 [2018-11-18 12:51:32,992 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:32,993 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:32,994 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:32,996 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 0 case distinctions, treesize of input 90 treesize of output 95 [2018-11-18 12:51:33,000 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,001 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,002 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,003 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,005 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,007 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,011 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,024 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 122 [2018-11-18 12:51:33,025 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 12:51:33,060 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,061 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,062 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,064 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 91 [2018-11-18 12:51:33,067 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,067 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,068 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,069 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,071 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,071 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,074 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,075 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,076 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,077 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,079 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,080 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,082 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,092 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 194 [2018-11-18 12:51:33,093 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 12:51:33,139 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:51:33,148 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:51:33,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:51:33,161 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:102, output treesize:85 [2018-11-18 12:51:33,248 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,249 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,250 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,252 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 0 case distinctions, treesize of input 102 treesize of output 105 [2018-11-18 12:51:33,255 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,255 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,256 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,257 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,258 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,259 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,261 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,262 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,263 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,264 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,268 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,282 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 54 treesize of output 151 [2018-11-18 12:51:33,282 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 12:51:33,326 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,329 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,339 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,341 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 101 [2018-11-18 12:51:33,344 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,345 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,346 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,348 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,348 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,349 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,350 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,350 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,351 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,353 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,354 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,356 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,357 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,357 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,359 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,360 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,361 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,362 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,363 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,365 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,366 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,379 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 22 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 54 treesize of output 279 [2018-11-18 12:51:33,380 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 12:51:33,447 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:51:33,458 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:51:33,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:51:33,473 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:111, output treesize:96 [2018-11-18 12:51:33,631 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,632 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,637 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,638 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 0 case distinctions, treesize of input 146 treesize of output 143 [2018-11-18 12:51:33,644 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,645 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,646 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,647 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,647 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:51:33,649 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,652 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,661 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,662 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,663 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,666 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,667 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,671 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,678 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:33,728 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 14 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 15 case distinctions, treesize of input 81 treesize of output 305 [2018-11-18 12:51:33,728 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-11-18 12:51:33,746 INFO L267 ElimStorePlain]: Start of recursive call 3: 32 dim-0 vars, End of recursive call: 32 dim-0 vars, and 64 xjuncts. [2018-11-18 12:51:34,274 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,277 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,277 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,279 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 181 [2018-11-18 12:51:34,284 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,285 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,286 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,287 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,287 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,288 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,295 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,296 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,297 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,298 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,299 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,299 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,300 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,300 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:51:34,301 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,303 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,304 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,305 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,307 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,308 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,315 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,317 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,317 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,319 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,324 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,342 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 30 disjoint index pairs (out of 28 index pairs), introduced 2 new quantified variables, introduced 10 case distinctions, treesize of input 85 treesize of output 362 [2018-11-18 12:51:34,345 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-11-18 12:51:34,474 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:51:34,476 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,477 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,478 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,479 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 147 [2018-11-18 12:51:34,483 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,485 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,485 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,486 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,487 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,488 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,489 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,490 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,490 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,492 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,493 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,494 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,495 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,496 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,496 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,497 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,497 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:51:34,498 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,500 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,501 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,502 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,503 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,504 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,505 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,510 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,511 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,514 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 321 [2018-11-18 12:51:34,515 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 12:51:34,576 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 12:51:34,579 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,579 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,580 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,582 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 147 [2018-11-18 12:51:34,588 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,594 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,595 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,596 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,597 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,597 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,599 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,599 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,600 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,601 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:51:34,602 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,603 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,604 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,614 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,615 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,616 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,617 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,618 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,619 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,620 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,621 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,622 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,637 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 23 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 75 treesize of output 322 [2018-11-18 12:51:34,640 INFO L267 ElimStorePlain]: Start of recursive call 9: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-11-18 12:51:34,739 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:51:34,742 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,743 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,744 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,745 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 164 [2018-11-18 12:51:34,755 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,756 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,757 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,758 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,759 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,759 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,761 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,761 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,762 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,763 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,764 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,764 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,765 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:51:34,767 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,776 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,777 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,778 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,779 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,780 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,782 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,783 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,783 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,784 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,788 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,809 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 25 disjoint index pairs (out of 28 index pairs), introduced 2 new quantified variables, introduced 13 case distinctions, treesize of input 85 treesize of output 352 [2018-11-18 12:51:34,812 INFO L267 ElimStorePlain]: Start of recursive call 11: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-11-18 12:51:34,931 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:51:34,934 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,935 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,940 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,940 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 137 [2018-11-18 12:51:34,947 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,950 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,951 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,952 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,952 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,955 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,956 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,956 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,957 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,959 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,960 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,960 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,961 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,962 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,963 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,964 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,971 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,971 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,972 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,973 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,974 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,975 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,976 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,977 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,977 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,978 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:34,995 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 27 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 376 [2018-11-18 12:51:34,997 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-11-18 12:51:35,107 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:51:35,110 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:35,111 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:35,112 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:35,112 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:35,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 147 [2018-11-18 12:51:35,119 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:35,123 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:35,123 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:35,124 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:35,125 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:35,125 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:51:35,126 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:35,127 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:35,127 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:35,128 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:35,129 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:35,129 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:35,136 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:35,137 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:35,138 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:35,139 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:35,140 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:35,140 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:35,141 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:35,142 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:35,143 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:35,159 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 23 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 75 treesize of output 312 [2018-11-18 12:51:35,162 INFO L267 ElimStorePlain]: Start of recursive call 15: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-11-18 12:51:35,263 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:51:35,378 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 6 xjuncts. [2018-11-18 12:51:35,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 6 xjuncts. [2018-11-18 12:51:35,503 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 1 variables, input treesize:161, output treesize:853 [2018-11-18 12:51:35,845 WARN L180 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 71 [2018-11-18 12:51:36,042 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2018-11-18 12:51:36,384 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:36,385 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:36,386 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:36,388 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:36,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 191 [2018-11-18 12:51:36,394 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:36,395 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:36,396 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:36,397 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:36,398 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:51:36,401 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:36,402 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:36,402 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:51:36,404 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:36,408 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:36,409 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:36,413 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:36,417 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:36,423 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:36,432 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:51:36,450 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 13 disjoint index pairs (out of 28 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 123 treesize of output 301 [2018-11-18 12:51:36,452 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-18 12:51:36,524 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:36,524 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:36,526 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:36,527 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:36,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 164 [2018-11-18 12:51:36,531 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:36,531 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:36,532 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:36,533 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:36,535 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:36,535 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:36,536 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:36,537 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:36,539 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:36,539 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:36,540 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:36,542 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:36,544 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:36,544 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:51:36,545 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:36,546 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:36,546 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:36,548 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:36,549 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:36,558 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 18 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 142 treesize of output 338 [2018-11-18 12:51:36,559 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 12:51:36,605 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 12:51:36,622 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 12:51:36,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 12:51:36,645 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:190, output treesize:163 [2018-11-18 12:51:36,862 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:36,863 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:36,864 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:36,866 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:36,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 197 [2018-11-18 12:51:36,872 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:36,875 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:36,876 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:36,880 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:36,892 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:36,913 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 133 treesize of output 300 [2018-11-18 12:51:36,914 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-18 12:51:36,983 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:36,984 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:36,985 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:36,986 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:36,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 156 [2018-11-18 12:51:36,995 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:36,996 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:36,996 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:36,997 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:36,998 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:36,999 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:36,999 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:37,000 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:37,000 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:37,001 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:37,008 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:37,009 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:37,009 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:37,010 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:37,011 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:37,028 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 115 treesize of output 279 [2018-11-18 12:51:37,030 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-18 12:51:37,097 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:51:37,110 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:51:37,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:51:37,128 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:197, output treesize:134 [2018-11-18 12:51:37,338 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:37,339 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:37,340 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:37,342 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:37,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 191 [2018-11-18 12:51:37,347 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:37,349 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:37,353 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:37,354 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:37,355 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:51:37,356 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:37,357 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:37,360 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:51:37,361 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:37,363 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:37,367 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:37,369 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:37,380 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:37,383 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:37,385 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:37,399 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:37,399 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:51:37,413 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 15 disjoint index pairs (out of 28 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 129 treesize of output 335 [2018-11-18 12:51:37,415 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-18 12:51:37,489 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:37,490 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:37,491 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:37,492 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:37,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 176 [2018-11-18 12:51:37,497 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:37,498 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:37,499 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:37,500 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:37,500 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:37,506 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:37,507 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:37,507 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:51:37,508 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:37,509 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:37,509 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:37,511 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:37,512 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:37,513 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:37,519 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:37,520 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:37,541 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 18 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 146 treesize of output 329 [2018-11-18 12:51:37,543 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-18 12:51:37,626 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:51:37,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:51:37,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:51:37,661 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:192, output treesize:161 [2018-11-18 12:51:37,865 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:37,868 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:37,877 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:37,877 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 0 case distinctions, treesize of input 202 treesize of output 193 [2018-11-18 12:51:37,885 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:37,890 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:37,891 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:37,892 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:37,898 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:37,907 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:37,909 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:37,910 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:37,921 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:37,922 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:37,924 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:37,928 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:37,932 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:37,957 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:37,960 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:37,989 INFO L303 Elim1Store]: Index analysis took 109 ms [2018-11-18 12:51:38,023 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 127 treesize of output 363 [2018-11-18 12:51:38,027 INFO L267 ElimStorePlain]: Start of recursive call 3: 6 dim-0 vars, End of recursive call: 6 dim-0 vars, and 9 xjuncts. [2018-11-18 12:51:38,191 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:38,192 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:38,193 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:38,194 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:38,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 168 [2018-11-18 12:51:38,202 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:38,203 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:38,204 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:38,205 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:38,205 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:38,206 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:38,207 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:38,207 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:38,208 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:38,209 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:38,215 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:38,216 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:38,218 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:38,233 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 117 treesize of output 265 [2018-11-18 12:51:38,235 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-18 12:51:38,362 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-18 12:51:38,364 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:38,365 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:38,366 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:38,367 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:38,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 183 [2018-11-18 12:51:38,376 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:38,377 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:38,377 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:38,378 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:38,379 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:38,379 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:38,380 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:38,381 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:38,381 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:38,382 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:38,388 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:38,389 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:38,390 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:38,391 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:38,392 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:38,407 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 142 treesize of output 312 [2018-11-18 12:51:38,409 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-18 12:51:38,489 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:51:38,568 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-11-18 12:51:38,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-11-18 12:51:38,654 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:214, output treesize:665 [2018-11-18 12:51:38,883 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 63 [2018-11-18 12:51:39,176 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:39,178 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:39,181 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:39,184 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:39,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 199 treesize of output 208 [2018-11-18 12:51:39,192 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:39,194 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:39,196 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:39,197 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:39,198 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:39,200 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:39,213 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:39,215 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:39,216 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:39,216 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:51:39,218 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:39,219 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:39,220 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:39,221 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:39,223 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:39,224 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:51:39,227 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:51:39,230 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:39,244 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:39,245 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:39,247 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:39,261 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 17 disjoint index pairs (out of 28 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 141 treesize of output 501 [2018-11-18 12:51:39,262 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-18 12:51:39,383 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:39,387 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:39,394 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:39,396 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:39,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 179 [2018-11-18 12:51:39,405 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:39,406 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:39,406 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:39,407 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:39,412 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:39,413 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:39,414 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:39,414 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:51:39,428 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 136 treesize of output 196 [2018-11-18 12:51:39,429 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-18 12:51:39,483 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:51:39,498 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:51:39,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 12:51:39,517 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:208, output treesize:147 [2018-11-18 12:51:39,817 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 6 proven. 202 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:51:39,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:51:39,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 34] total 56 [2018-11-18 12:51:39,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-11-18 12:51:39,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=2914, Unknown=0, NotChecked=0, Total=3080 [2018-11-18 12:51:39,912 INFO L87 Difference]: Start difference. First operand 2711 states and 3534 transitions. cyclomatic complexity: 894 Second operand 56 states. [2018-11-18 12:51:42,868 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 72 [2018-11-18 12:51:45,507 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 66 [2018-11-18 12:51:46,120 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 71 [2018-11-18 12:51:47,110 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 67 [2018-11-18 12:51:51,001 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 64 [2018-11-18 12:51:51,643 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 68 [2018-11-18 12:51:52,735 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 66 [2018-11-18 12:51:53,283 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 82 [2018-11-18 12:51:53,465 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 78 [2018-11-18 12:51:53,764 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 70 [2018-11-18 12:51:54,232 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 66 [2018-11-18 12:51:54,682 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 73 [2018-11-18 12:51:54,943 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 69 [2018-11-18 12:51:55,396 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 74 [2018-11-18 12:51:55,689 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 70 [2018-11-18 12:51:56,339 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 80 [2018-11-18 12:51:56,945 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 89 [2018-11-18 12:52:02,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:52:02,883 INFO L93 Difference]: Finished difference Result 4725 states and 6018 transitions. [2018-11-18 12:52:02,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-11-18 12:52:02,883 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4725 states and 6018 transitions. [2018-11-18 12:52:02,892 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 283 [2018-11-18 12:52:02,900 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4725 states to 4689 states and 5978 transitions. [2018-11-18 12:52:02,900 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1530 [2018-11-18 12:52:02,901 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1538 [2018-11-18 12:52:02,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4689 states and 5978 transitions. [2018-11-18 12:52:02,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:52:02,901 INFO L705 BuchiCegarLoop]: Abstraction has 4689 states and 5978 transitions. [2018-11-18 12:52:02,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4689 states and 5978 transitions. [2018-11-18 12:52:02,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4689 to 3145. [2018-11-18 12:52:02,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3145 states. [2018-11-18 12:52:02,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3145 states to 3145 states and 4057 transitions. [2018-11-18 12:52:02,932 INFO L728 BuchiCegarLoop]: Abstraction has 3145 states and 4057 transitions. [2018-11-18 12:52:02,932 INFO L608 BuchiCegarLoop]: Abstraction has 3145 states and 4057 transitions. [2018-11-18 12:52:02,932 INFO L442 BuchiCegarLoop]: ======== Iteration 34============ [2018-11-18 12:52:02,932 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3145 states and 4057 transitions. [2018-11-18 12:52:02,940 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 198 [2018-11-18 12:52:02,940 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:52:02,940 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:52:02,941 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1] [2018-11-18 12:52:02,941 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 12:52:02,941 INFO L794 eck$LassoCheckResult]: Stem: 102939#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 102934#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~ret18, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet16;havoc main_#t~nondet16; 102925#L565 assume !(main_~array_size~0 < 1); 102926#L565-2 call main_#t~malloc17.base, main_#t~malloc17.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc17.base, main_#t~malloc17.offset;assume { :begin_inline_lis } true;lis_#in~a.base, lis_#in~a.offset, lis_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc lis_#res;havoc lis_#t~malloc2.base, lis_#t~malloc2.offset, lis_#t~malloc3.base, lis_#t~malloc3.offset, lis_#t~post4, lis_#t~mem7, lis_#t~mem8, lis_#t~mem10, lis_#t~mem9, lis_#t~short11, lis_#t~mem12, lis_#t~post6, lis_#t~post5, lis_#t~mem14, lis_#t~mem15, lis_#t~post13, lis_~a.base, lis_~a.offset, lis_~N, lis_~best~0.base, lis_~best~0.offset, lis_~prev~0.base, lis_~prev~0.offset, lis_~i~0, lis_~j~0, lis_~max~0;lis_~a.base, lis_~a.offset := lis_#in~a.base, lis_#in~a.offset;lis_~N := lis_#in~N;havoc lis_~best~0.base, lis_~best~0.offset;havoc lis_~prev~0.base, lis_~prev~0.offset;havoc lis_~i~0;havoc lis_~j~0;lis_~max~0 := 0;call lis_#t~malloc2.base, lis_#t~malloc2.offset := #Ultimate.alloc(4 * lis_~N);lis_~best~0.base, lis_~best~0.offset := lis_#t~malloc2.base, lis_#t~malloc2.offset;call lis_#t~malloc3.base, lis_#t~malloc3.offset := #Ultimate.alloc(4 * lis_~N);lis_~prev~0.base, lis_~prev~0.offset := lis_#t~malloc3.base, lis_#t~malloc3.offset;lis_~i~0 := 0; 102911#L552-4 assume true; 102912#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 102961#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 102913#L552-4 assume true; 102914#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 102959#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 102960#L552-4 assume true; 102964#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 102963#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 102962#L552-4 assume true; 102948#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 102949#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 102956#L552-4 assume true; 102958#L552-1 assume !!(lis_~i~0 < lis_~N);call write~int(1, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call write~int(lis_~i~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 102954#L552-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 102955#L552-4 assume true; 102946#L552-1 assume !(lis_~i~0 < lis_~N); 102947#L552-5 lis_~i~0 := 1; 104822#L554-4 assume true; 104820#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 104819#L555-4 assume true; 104818#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 104817#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 104816#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 104815#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 104814#L555-4 assume true; 104813#L555-1 assume !(lis_~j~0 < lis_~i~0); 104811#L554-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 104810#L554-4 assume true; 104809#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 104808#L555-4 assume true; 104807#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 104805#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 104804#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 104803#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 104802#L555-4 assume true; 104801#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 104799#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 104800#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 104873#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 104872#L555-4 assume true; 104871#L555-1 assume !(lis_~j~0 < lis_~i~0); 104870#L554-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 104869#L554-4 assume true; 104868#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 104867#L555-4 assume true; 104866#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 104864#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 104863#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 104861#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 104862#L555-4 assume true; 105314#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 105312#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 105313#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 105926#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 105925#L555-4 assume true; 105924#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 104948#L556 assume lis_#t~short11;call lis_#t~mem10 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);call lis_#t~mem9 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem10 < 1 + lis_#t~mem9; 104949#L556-2 assume lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8;call lis_#t~mem12 := read~int(lis_~best~0.base, lis_~best~0.offset + 4 * lis_~j~0, 4);call write~int(1 + lis_#t~mem12, lis_~best~0.base, lis_~best~0.offset + 4 * lis_~i~0, 4);havoc lis_#t~mem12;call write~int(lis_~j~0, lis_~prev~0.base, lis_~prev~0.offset + 4 * lis_~i~0, 4); 106055#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 106054#L555-4 assume true; 106053#L555-1 assume !(lis_~j~0 < lis_~i~0); 106052#L554-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 106051#L554-4 assume true; 102935#L554-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 102936#L555-4 [2018-11-18 12:52:02,941 INFO L796 eck$LassoCheckResult]: Loop: 102936#L555-4 assume true; 102941#L555-1 assume !!(lis_~j~0 < lis_~i~0);call lis_#t~mem7 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~i~0, 4);call lis_#t~mem8 := read~int(lis_~a.base, lis_~a.offset + 4 * lis_~j~0, 4);lis_#t~short11 := lis_#t~mem7 > lis_#t~mem8; 106049#L556 assume !lis_#t~short11; 102927#L556-2 assume !lis_#t~short11;havoc lis_#t~mem7;havoc lis_#t~mem10;havoc lis_#t~mem9;havoc lis_#t~short11;havoc lis_#t~mem8; 102928#L555-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 102936#L555-4 [2018-11-18 12:52:02,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:52:02,941 INFO L82 PathProgramCache]: Analyzing trace with hash 8161101, now seen corresponding path program 13 times [2018-11-18 12:52:02,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:52:02,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:52:02,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:52:02,942 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:52:02,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:52:02,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:52:03,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:52:03,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:52:03,011 INFO L82 PathProgramCache]: Analyzing trace with hash 64097515, now seen corresponding path program 3 times [2018-11-18 12:52:03,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:52:03,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:52:03,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:52:03,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:52:03,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:52:03,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:52:03,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:52:03,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:52:03,015 INFO L82 PathProgramCache]: Analyzing trace with hash -792578785, now seen corresponding path program 17 times [2018-11-18 12:52:03,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:52:03,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:52:03,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:52:03,016 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:52:03,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:52:03,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:52:03,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:53:03,467 WARN L180 SmtUtils]: Spent 1.00 m on a formula simplification. DAG size of input: 562 DAG size of output: 367 [2018-11-18 12:53:17,006 WARN L180 SmtUtils]: Spent 13.52 s on a formula simplification that was a NOOP. DAG size: 225 [2018-11-18 12:53:17,010 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:53:17,010 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:53:17,010 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:53:17,010 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:53:17,011 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 12:53:17,011 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:53:17,011 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:53:17,011 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:53:17,011 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-termination.c.i_Iteration34_Lasso [2018-11-18 12:53:17,011 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:53:17,011 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:53:17,015 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-18 12:53:17,016 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-18 12:53:17,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:17,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:17,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:17,022 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-18 12:53:17,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:17,024 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-18 12:53:17,025 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-18 12:53:17,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-18 12:53:17,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:17,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:53:17,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:56:26,765 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.OutOfMemoryError: Java heap space at java.util.Arrays.copyOf(Arrays.java:3332) at java.lang.AbstractStringBuilder.ensureCapacityInternal(AbstractStringBuilder.java:124) at java.lang.AbstractStringBuilder.append(AbstractStringBuilder.java:448) at java.lang.StringBuilder.append(StringBuilder.java:136) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminatorUtils.niceTermString(MapEliminatorUtils.java:194) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminatorUtils.niceTermString(MapEliminatorUtils.java:177) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminatorUtils.getAndAddAuxVar(MapEliminatorUtils.java:276) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:585) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:286) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:612) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:539) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:958) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:865) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:476) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:384) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) [2018-11-18 12:56:26,767 INFO L168 Benchmark]: Toolchain (without parser) took 736324.31 ms. Allocated memory was 1.0 GB in the beginning and 11.7 GB in the end (delta: 10.7 GB). Free memory was 956.6 MB in the beginning and 6.1 GB in the end (delta: -5.1 GB). Peak memory consumption was 13.4 GB. Max. memory is 11.5 GB. [2018-11-18 12:56:26,768 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:56:26,768 INFO L168 Benchmark]: CACSL2BoogieTranslator took 321.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -168.4 MB). Peak memory consumption was 29.2 MB. Max. memory is 11.5 GB. [2018-11-18 12:56:26,768 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.95 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 12:56:26,768 INFO L168 Benchmark]: Boogie Preprocessor took 16.65 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-18 12:56:26,769 INFO L168 Benchmark]: RCFGBuilder took 238.90 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2018-11-18 12:56:26,769 INFO L168 Benchmark]: BuchiAutomizer took 735713.95 ms. Allocated memory was 1.2 GB in the beginning and 11.7 GB in the end (delta: 10.5 GB). Free memory was 1.1 GB in the beginning and 6.1 GB in the end (delta: -5.0 GB). Peak memory consumption was 13.4 GB. Max. memory is 11.5 GB. [2018-11-18 12:56:26,770 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 321.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -168.4 MB). Peak memory consumption was 29.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.95 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.65 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 238.90 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 735713.95 ms. Allocated memory was 1.2 GB in the beginning and 11.7 GB in the end (delta: 10.5 GB). Free memory was 1.1 GB in the beginning and 6.1 GB in the end (delta: -5.0 GB). Peak memory consumption was 13.4 GB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: OutOfMemoryError: Java heap space de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: OutOfMemoryError: Java heap space: java.util.Arrays.copyOf(Arrays.java:3332) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...