./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/array-memsafety/lis-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_25f04ae1-e643-443a-91ff-e3c00beaa66b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_25f04ae1-e643-443a-91ff-e3c00beaa66b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_25f04ae1-e643-443a-91ff-e3c00beaa66b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_25f04ae1-e643-443a-91ff-e3c00beaa66b/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/lis-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_25f04ae1-e643-443a-91ff-e3c00beaa66b/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_25f04ae1-e643-443a-91ff-e3c00beaa66b/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 32bit --witnessprinter.graph.data.programhash 13fe1afeee88065faace0f9ad16456f5e678cf43 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/working_dir_25f04ae1-e643-443a-91ff-e3c00beaa66b/bin-2019/uautomizer/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 10:48:56,780 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 10:48:56,781 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 10:48:56,791 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 10:48:56,792 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 10:48:56,793 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 10:48:56,794 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 10:48:56,795 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 10:48:56,797 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 10:48:56,797 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 10:48:56,798 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 10:48:56,798 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 10:48:56,799 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 10:48:56,800 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 10:48:56,801 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 10:48:56,802 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 10:48:56,802 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 10:48:56,804 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 10:48:56,806 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 10:48:56,807 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 10:48:56,808 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 10:48:56,809 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 10:48:56,811 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 10:48:56,811 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 10:48:56,811 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 10:48:56,812 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 10:48:56,813 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 10:48:56,813 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 10:48:56,814 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 10:48:56,815 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 10:48:56,815 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 10:48:56,816 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 10:48:56,816 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 10:48:56,816 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 10:48:56,817 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 10:48:56,818 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 10:48:56,818 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_25f04ae1-e643-443a-91ff-e3c00beaa66b/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 10:48:56,831 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 10:48:56,831 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 10:48:56,832 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 10:48:56,832 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 10:48:56,832 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 10:48:56,833 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 10:48:56,833 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 10:48:56,833 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 10:48:56,833 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 10:48:56,833 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 10:48:56,833 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 10:48:56,834 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 10:48:56,834 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 10:48:56,834 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 10:48:56,834 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 10:48:56,834 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 10:48:56,835 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 10:48:56,835 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 10:48:56,835 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 10:48:56,835 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 10:48:56,835 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 10:48:56,836 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 10:48:56,836 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 10:48:56,836 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 10:48:56,836 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 10:48:56,836 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 10:48:56,836 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 10:48:56,837 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 10:48:56,837 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 10:48:56,837 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 10:48:56,837 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 10:48:56,838 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 10:48:56,838 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_25f04ae1-e643-443a-91ff-e3c00beaa66b/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 13fe1afeee88065faace0f9ad16456f5e678cf43 [2018-11-18 10:48:56,867 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 10:48:56,878 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 10:48:56,881 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 10:48:56,883 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 10:48:56,883 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 10:48:56,884 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_25f04ae1-e643-443a-91ff-e3c00beaa66b/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/lis-alloca_true-valid-memsafety_true-termination.i [2018-11-18 10:48:56,938 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_25f04ae1-e643-443a-91ff-e3c00beaa66b/bin-2019/uautomizer/data/a305ccf46/a419b157cce8487788d38347740c503e/FLAG0cb0aa6ed [2018-11-18 10:48:57,339 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 10:48:57,339 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_25f04ae1-e643-443a-91ff-e3c00beaa66b/sv-benchmarks/c/array-memsafety/lis-alloca_true-valid-memsafety_true-termination.i [2018-11-18 10:48:57,349 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_25f04ae1-e643-443a-91ff-e3c00beaa66b/bin-2019/uautomizer/data/a305ccf46/a419b157cce8487788d38347740c503e/FLAG0cb0aa6ed [2018-11-18 10:48:57,363 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_25f04ae1-e643-443a-91ff-e3c00beaa66b/bin-2019/uautomizer/data/a305ccf46/a419b157cce8487788d38347740c503e [2018-11-18 10:48:57,366 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 10:48:57,368 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 10:48:57,368 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 10:48:57,368 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 10:48:57,372 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 10:48:57,373 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:48:57" (1/1) ... [2018-11-18 10:48:57,375 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5546aa01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:48:57, skipping insertion in model container [2018-11-18 10:48:57,376 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:48:57" (1/1) ... [2018-11-18 10:48:57,385 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 10:48:57,420 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 10:48:57,653 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:48:57,661 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 10:48:57,697 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:48:57,775 INFO L195 MainTranslator]: Completed translation [2018-11-18 10:48:57,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:48:57 WrapperNode [2018-11-18 10:48:57,776 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 10:48:57,776 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 10:48:57,776 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 10:48:57,776 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 10:48:57,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:48:57" (1/1) ... [2018-11-18 10:48:57,794 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:48:57" (1/1) ... [2018-11-18 10:48:57,810 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 10:48:57,811 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 10:48:57,811 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 10:48:57,811 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 10:48:57,818 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:48:57" (1/1) ... [2018-11-18 10:48:57,818 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:48:57" (1/1) ... [2018-11-18 10:48:57,820 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:48:57" (1/1) ... [2018-11-18 10:48:57,821 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:48:57" (1/1) ... [2018-11-18 10:48:57,826 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:48:57" (1/1) ... [2018-11-18 10:48:57,831 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:48:57" (1/1) ... [2018-11-18 10:48:57,832 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:48:57" (1/1) ... [2018-11-18 10:48:57,835 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 10:48:57,835 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 10:48:57,835 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 10:48:57,835 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 10:48:57,836 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:48:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25f04ae1-e643-443a-91ff-e3c00beaa66b/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 10:48:57,879 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 10:48:57,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 10:48:57,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 10:48:57,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 10:48:57,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 10:48:57,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 10:48:58,090 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 10:48:58,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:48:58 BoogieIcfgContainer [2018-11-18 10:48:58,090 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 10:48:58,091 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 10:48:58,091 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 10:48:58,093 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 10:48:58,094 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 10:48:58,094 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 10:48:57" (1/3) ... [2018-11-18 10:48:58,095 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a36a9d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 10:48:58, skipping insertion in model container [2018-11-18 10:48:58,095 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 10:48:58,095 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:48:57" (2/3) ... [2018-11-18 10:48:58,095 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a36a9d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 10:48:58, skipping insertion in model container [2018-11-18 10:48:58,095 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 10:48:58,095 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:48:58" (3/3) ... [2018-11-18 10:48:58,096 INFO L375 chiAutomizerObserver]: Analyzing ICFG lis-alloca_true-valid-memsafety_true-termination.i [2018-11-18 10:48:58,140 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 10:48:58,140 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 10:48:58,140 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 10:48:58,141 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 10:48:58,141 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 10:48:58,141 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 10:48:58,141 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 10:48:58,141 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 10:48:58,141 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 10:48:58,154 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2018-11-18 10:48:58,170 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2018-11-18 10:48:58,170 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:48:58,171 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:48:58,175 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 10:48:58,176 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 10:48:58,176 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 10:48:58,176 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2018-11-18 10:48:58,177 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2018-11-18 10:48:58,177 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:48:58,178 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:48:58,178 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 10:48:58,178 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 10:48:58,184 INFO L794 eck$LassoCheckResult]: Stem: 25#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; 15#L558true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 20#L558-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; 10#L545-4true [2018-11-18 10:48:58,184 INFO L796 eck$LassoCheckResult]: Loop: 10#L545-4true assume true; 21#L545-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); 7#L545-3true lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 10#L545-4true [2018-11-18 10:48:58,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:58,188 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-11-18 10:48:58,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:48:58,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:48:58,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:58,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:48:58,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:58,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:48:58,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:48:58,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:58,288 INFO L82 PathProgramCache]: Analyzing trace with hash 42862, now seen corresponding path program 1 times [2018-11-18 10:48:58,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:48:58,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:48:58,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:58,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:48:58,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:58,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:48:58,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:48:58,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:58,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1806814474, now seen corresponding path program 1 times [2018-11-18 10:48:58,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:48:58,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:48:58,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:58,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:48:58,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:58,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:48:58,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:48:58,609 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2018-11-18 10:48:58,704 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:48:58,705 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:48:58,705 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:48:58,705 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:48:58,706 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:48:58,706 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:48:58,706 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:48:58,706 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:48:58,706 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2018-11-18 10:48:58,706 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:48:58,707 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:48:58,729 INFO 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 10:48:58,734 INFO 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 10:48:58,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:48:58,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:48:58,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:48:58,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:48:58,743 INFO 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 10:48:58,745 INFO 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 10:48:58,746 INFO 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 10:48:58,747 INFO 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 10:48:58,749 INFO 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 10:48:58,750 INFO 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 10:48:58,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 10:48:58,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 10:48:58,786 INFO 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 10:48:58,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:48:58,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 10:48:58,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 10:48:58,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:48:58,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:48:59,047 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2018-11-18 10:48:59,111 INFO 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 10:48:59,118 INFO 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 10:48:59,438 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:48:59,443 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:48:59,444 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 10:48:59,445 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:59,446 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:48:59,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:59,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:59,446 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:59,448 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:48:59,448 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:48:59,450 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:59,451 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 10:48:59,451 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:59,451 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:59,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:59,452 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:59,453 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:48:59,454 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:48:59,457 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:59,458 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 10:48:59,458 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:59,459 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:48:59,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:59,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:59,459 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:59,460 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:48:59,460 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:48:59,461 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:59,461 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 10:48:59,462 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:59,462 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:48:59,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:59,462 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:59,462 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:59,463 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:48:59,463 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:48:59,464 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:59,464 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 10:48:59,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:59,466 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:48:59,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:59,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:59,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:59,467 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:48:59,467 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:48:59,468 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:59,468 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 10:48:59,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:59,469 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:59,469 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:59,469 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:59,471 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:48:59,471 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:48:59,474 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:59,474 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 10:48:59,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:59,475 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:48:59,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:59,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:59,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:59,476 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:48:59,476 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:48:59,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:59,477 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 10:48:59,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:59,478 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:48:59,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:59,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:59,478 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:59,479 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:48:59,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:48:59,479 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:59,480 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:48:59,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:59,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:48:59,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:59,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:59,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:59,481 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:48:59,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:48:59,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:59,482 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:48:59,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:59,483 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:48:59,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:59,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:59,483 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:59,483 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:48:59,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:48:59,484 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:59,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 10:48:59,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:59,485 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:48:59,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:59,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:59,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:59,486 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:48:59,486 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:48:59,486 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:59,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 10:48:59,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:59,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:59,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:59,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:59,489 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:48:59,489 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:48:59,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:59,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 10:48:59,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:59,494 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:48:59,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:59,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:59,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:59,495 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:48:59,495 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:48:59,496 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:59,497 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 10:48:59,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:59,497 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:48:59,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:59,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:59,498 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:59,498 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:48:59,498 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:48:59,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:59,499 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 10:48:59,499 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:59,499 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:48:59,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:59,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:59,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:59,500 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:48:59,500 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:48:59,501 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:59,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 10:48:59,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:59,502 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:48:59,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:59,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:59,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:59,503 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:48:59,503 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:48:59,503 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:59,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 10:48:59,504 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:59,504 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:48:59,504 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:59,504 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:59,504 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:59,505 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:48:59,505 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:48:59,506 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:59,506 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 10:48:59,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:59,507 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:48:59,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:59,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:59,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:59,507 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:48:59,507 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:48:59,508 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:59,508 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 10:48:59,509 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:59,509 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:48:59,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:59,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:59,509 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:59,510 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:48:59,510 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:48:59,511 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:59,511 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 10:48:59,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:59,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:59,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:59,512 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:59,513 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:48:59,513 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:48:59,516 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:48:59,516 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 10:48:59,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:48:59,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:48:59,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:48:59,517 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:48:59,521 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:48:59,522 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:48:59,592 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 10:48:59,628 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-18 10:48:59,628 INFO L444 ModelExtractionUtils]: 36 out of 43 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-18 10:48:59,630 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 10:48:59,631 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 10:48:59,632 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 10:48:59,632 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 10:48:59,681 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2018-11-18 10:48:59,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:59,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:48:59,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:48:59,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:48:59,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:48:59,757 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 10:48:59,771 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 10:48:59,772 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states. Second operand 4 states. [2018-11-18 10:48:59,815 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 10:48:59,817 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 10:48:59,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 10:48:59,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2018-11-18 10:48:59,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 4 letters. Loop has 3 letters. [2018-11-18 10:48:59,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:48:59,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-18 10:48:59,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:48:59,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 4 letters. Loop has 6 letters. [2018-11-18 10:48:59,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:48:59,824 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 70 transitions. [2018-11-18 10:48:59,826 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-11-18 10:48:59,829 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 23 states and 33 transitions. [2018-11-18 10:48:59,830 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-18 10:48:59,831 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-18 10:48:59,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 33 transitions. [2018-11-18 10:48:59,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:48:59,831 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 33 transitions. [2018-11-18 10:48:59,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 33 transitions. [2018-11-18 10:48:59,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-18 10:48:59,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-18 10:48:59,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 33 transitions. [2018-11-18 10:48:59,855 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 33 transitions. [2018-11-18 10:48:59,855 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 33 transitions. [2018-11-18 10:48:59,855 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 10:48:59,855 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 33 transitions. [2018-11-18 10:48:59,856 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-11-18 10:48:59,856 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:48:59,856 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:48:59,856 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:48:59,857 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 10:48:59,857 INFO L794 eck$LassoCheckResult]: Stem: 209#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 207#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; 190#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 191#L558-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; 201#L545-4 assume true; 203#L545-1 assume !(lis_~i~0 < lis_~N); 204#L545-5 lis_~i~0 := 1; 202#L547-4 [2018-11-18 10:48:59,857 INFO L796 eck$LassoCheckResult]: Loop: 202#L547-4 assume true; 198#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 199#L548-4 assume !true; 194#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 202#L547-4 [2018-11-18 10:48:59,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:59,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1806814416, now seen corresponding path program 1 times [2018-11-18 10:48:59,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:48:59,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:48:59,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:59,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:48:59,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:59,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:48:59,909 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 10:48:59,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:48:59,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 10:48:59,913 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:48:59,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:59,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1791208, now seen corresponding path program 1 times [2018-11-18 10:48:59,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:48:59,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:48:59,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:59,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:48:59,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:59,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:48:59,920 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 10:48:59,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:48:59,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 10:48:59,920 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 10:48:59,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 10:48:59,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 10:48:59,925 INFO L87 Difference]: Start difference. First operand 23 states and 33 transitions. cyclomatic complexity: 13 Second operand 2 states. [2018-11-18 10:48:59,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:48:59,949 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2018-11-18 10:48:59,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 10:48:59,950 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 31 transitions. [2018-11-18 10:48:59,951 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-11-18 10:48:59,952 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 31 transitions. [2018-11-18 10:48:59,952 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-18 10:48:59,952 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-18 10:48:59,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 31 transitions. [2018-11-18 10:48:59,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:48:59,952 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2018-11-18 10:48:59,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 31 transitions. [2018-11-18 10:48:59,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-18 10:48:59,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-18 10:48:59,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2018-11-18 10:48:59,955 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2018-11-18 10:48:59,955 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2018-11-18 10:48:59,955 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 10:48:59,955 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 31 transitions. [2018-11-18 10:48:59,956 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-11-18 10:48:59,956 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:48:59,956 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:48:59,956 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:48:59,956 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 10:48:59,956 INFO L794 eck$LassoCheckResult]: Stem: 262#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 260#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; 243#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 244#L558-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; 254#L545-4 assume true; 255#L545-1 assume !(lis_~i~0 < lis_~N); 256#L545-5 lis_~i~0 := 1; 259#L547-4 [2018-11-18 10:48:59,956 INFO L796 eck$LassoCheckResult]: Loop: 259#L547-4 assume true; 251#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 252#L548-4 assume true; 245#L548-1 assume !(lis_~j~0 < lis_~i~0); 246#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 259#L547-4 [2018-11-18 10:48:59,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:59,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1806814416, now seen corresponding path program 2 times [2018-11-18 10:48:59,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:48:59,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:48:59,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:59,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:48:59,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:59,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:48:59,990 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 10:48:59,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:48:59,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 10:48:59,991 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:48:59,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:59,991 INFO L82 PathProgramCache]: Analyzing trace with hash 55507698, now seen corresponding path program 1 times [2018-11-18 10:48:59,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:48:59,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:48:59,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:59,992 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:48:59,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:59,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:48:59,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:00,014 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:49:00,015 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:49:00,015 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:49:00,015 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:49:00,015 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 10:49:00,015 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:49:00,015 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:49:00,015 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:49:00,015 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-valid-memsafety_true-termination.i_Iteration3_Loop [2018-11-18 10:49:00,015 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:49:00,015 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:49:00,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 10:49:00,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 10:49:00,042 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:49:00,043 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25f04ae1-e643-443a-91ff-e3c00beaa66b/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 10:49:00,055 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:49:00,055 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25f04ae1-e643-443a-91ff-e3c00beaa66b/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 10:49:00,082 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 10:49:00,082 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:49:00,220 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 10:49:00,222 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:49:00,222 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:49:00,222 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:49:00,222 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:49:00,222 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:49:00,223 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:49:00,223 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:49:00,223 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:49:00,223 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-valid-memsafety_true-termination.i_Iteration3_Loop [2018-11-18 10:49:00,223 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:49:00,223 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:49:00,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:49:00,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 10:49:00,257 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:49:00,257 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:49:00,257 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 10:49:00,258 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:00,258 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:49:00,258 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:00,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:00,259 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:00,259 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:49:00,259 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:49:00,261 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 10:49:00,263 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 10:49:00,263 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 10:49:00,263 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 10:49:00,263 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 10:49:00,263 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 10:49:00,263 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 10:49:00,264 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 10:49:00,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:49:00,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:49:00,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:49:00,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:49:00,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:49:00,345 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 10:49:00,345 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 10:49:00,345 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 31 transitions. cyclomatic complexity: 11 Second operand 5 states. [2018-11-18 10:49:00,404 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 10:49:00,404 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 10:49:00,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 10:49:00,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2018-11-18 10:49:00,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 7 letters. Loop has 5 letters. [2018-11-18 10:49:00,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:49:00,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 12 letters. Loop has 5 letters. [2018-11-18 10:49:00,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:49:00,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 7 letters. Loop has 10 letters. [2018-11-18 10:49:00,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:49:00,407 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 66 transitions. [2018-11-18 10:49:00,408 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-18 10:49:00,409 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 45 states and 64 transitions. [2018-11-18 10:49:00,409 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-11-18 10:49:00,409 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-11-18 10:49:00,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 64 transitions. [2018-11-18 10:49:00,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:49:00,409 INFO L705 BuchiCegarLoop]: Abstraction has 45 states and 64 transitions. [2018-11-18 10:49:00,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 64 transitions. [2018-11-18 10:49:00,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 38. [2018-11-18 10:49:00,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-18 10:49:00,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 52 transitions. [2018-11-18 10:49:00,413 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 52 transitions. [2018-11-18 10:49:00,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 10:49:00,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 10:49:00,414 INFO L87 Difference]: Start difference. First operand 38 states and 52 transitions. Second operand 4 states. [2018-11-18 10:49:00,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:49:00,459 INFO L93 Difference]: Finished difference Result 41 states and 54 transitions. [2018-11-18 10:49:00,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 10:49:00,462 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 54 transitions. [2018-11-18 10:49:00,463 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-11-18 10:49:00,464 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 40 states and 53 transitions. [2018-11-18 10:49:00,464 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-18 10:49:00,464 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-18 10:49:00,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 53 transitions. [2018-11-18 10:49:00,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:49:00,465 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 53 transitions. [2018-11-18 10:49:00,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 53 transitions. [2018-11-18 10:49:00,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-11-18 10:49:00,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-18 10:49:00,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 51 transitions. [2018-11-18 10:49:00,467 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 51 transitions. [2018-11-18 10:49:00,468 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 51 transitions. [2018-11-18 10:49:00,468 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 10:49:00,468 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 51 transitions. [2018-11-18 10:49:00,468 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-11-18 10:49:00,469 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:49:00,469 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:49:00,469 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:49:00,469 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:49:00,470 INFO L794 eck$LassoCheckResult]: Stem: 488#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 486#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; 459#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 460#L558-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; 476#L545-4 assume true; 484#L545-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); 485#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 487#L545-4 assume true; 482#L545-1 assume !(lis_~i~0 < lis_~N); 483#L545-5 lis_~i~0 := 1; 490#L547-4 assume true; 471#L547-1 [2018-11-18 10:49:00,470 INFO L796 eck$LassoCheckResult]: Loop: 471#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 472#L548-4 assume true; 461#L548-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; 462#L549 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; 467#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 468#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 477#L548-4 assume true; 494#L548-1 assume !(lis_~j~0 < lis_~i~0); 479#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 480#L547-4 assume true; 471#L547-1 [2018-11-18 10:49:00,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:49:00,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1956012017, now seen corresponding path program 1 times [2018-11-18 10:49:00,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:49:00,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:49:00,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:00,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:49:00,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:00,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:00,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:00,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:49:00,489 INFO L82 PathProgramCache]: Analyzing trace with hash 835304816, now seen corresponding path program 1 times [2018-11-18 10:49:00,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:49:00,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:49:00,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:00,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:49:00,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:00,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:00,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:00,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:49:00,508 INFO L82 PathProgramCache]: Analyzing trace with hash -677580448, now seen corresponding path program 1 times [2018-11-18 10:49:00,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:49:00,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:49:00,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:00,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:49:00,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:00,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:49:00,596 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 10:49:00,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:49:00,596 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25f04ae1-e643-443a-91ff-e3c00beaa66b/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 10:49:00,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:49:00,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:49:00,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:49:00,688 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 10:49:00,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:49:00,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-11-18 10:49:00,865 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 81 [2018-11-18 10:49:00,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 10:49:00,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-11-18 10:49:00,914 INFO L87 Difference]: Start difference. First operand 38 states and 51 transitions. cyclomatic complexity: 17 Second operand 10 states. [2018-11-18 10:49:01,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:49:01,051 INFO L93 Difference]: Finished difference Result 89 states and 114 transitions. [2018-11-18 10:49:01,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 10:49:01,052 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 114 transitions. [2018-11-18 10:49:01,053 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 23 [2018-11-18 10:49:01,054 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 77 states and 101 transitions. [2018-11-18 10:49:01,054 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2018-11-18 10:49:01,054 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2018-11-18 10:49:01,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 101 transitions. [2018-11-18 10:49:01,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:49:01,055 INFO L705 BuchiCegarLoop]: Abstraction has 77 states and 101 transitions. [2018-11-18 10:49:01,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 101 transitions. [2018-11-18 10:49:01,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 41. [2018-11-18 10:49:01,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-18 10:49:01,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 54 transitions. [2018-11-18 10:49:01,058 INFO L728 BuchiCegarLoop]: Abstraction has 41 states and 54 transitions. [2018-11-18 10:49:01,058 INFO L608 BuchiCegarLoop]: Abstraction has 41 states and 54 transitions. [2018-11-18 10:49:01,058 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 10:49:01,058 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 54 transitions. [2018-11-18 10:49:01,059 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-11-18 10:49:01,059 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:49:01,059 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:49:01,060 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:49:01,060 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:49:01,060 INFO L794 eck$LassoCheckResult]: Stem: 700#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 698#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; 671#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 672#L558-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; 688#L545-4 assume true; 702#L545-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); 705#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 703#L545-4 assume true; 696#L545-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); 697#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 699#L545-4 assume true; 694#L545-1 assume !(lis_~i~0 < lis_~N); 695#L545-5 lis_~i~0 := 1; 704#L547-4 assume true; 683#L547-1 [2018-11-18 10:49:01,060 INFO L796 eck$LassoCheckResult]: Loop: 683#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 684#L548-4 assume true; 673#L548-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; 674#L549 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#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 679#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 689#L548-4 assume true; 709#L548-1 assume !(lis_~j~0 < lis_~i~0); 691#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 692#L547-4 assume true; 683#L547-1 [2018-11-18 10:49:01,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:49:01,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1785827116, now seen corresponding path program 2 times [2018-11-18 10:49:01,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:49:01,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:49:01,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:01,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:49:01,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:01,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:01,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:01,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:49:01,081 INFO L82 PathProgramCache]: Analyzing trace with hash 835304816, now seen corresponding path program 2 times [2018-11-18 10:49:01,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:49:01,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:49:01,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:01,082 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:49:01,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:01,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:01,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:01,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:49:01,096 INFO L82 PathProgramCache]: Analyzing trace with hash -985754917, now seen corresponding path program 2 times [2018-11-18 10:49:01,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:49:01,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:49:01,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:01,097 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:49:01,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:01,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:01,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:01,339 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 79 [2018-11-18 10:49:01,641 WARN L180 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 111 [2018-11-18 10:49:01,726 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:49:01,726 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:49:01,726 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:49:01,726 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:49:01,726 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:49:01,726 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:49:01,726 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:49:01,726 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:49:01,726 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-valid-memsafety_true-termination.i_Iteration5_Lasso [2018-11-18 10:49:01,726 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:49:01,726 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:49:01,730 INFO 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 10:49:01,736 INFO 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 10:49:01,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:49:01,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:49:01,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:49:01,743 INFO 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 10:49:01,747 INFO 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 10:49:02,095 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 94 [2018-11-18 10:49:02,244 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 82 [2018-11-18 10:49:02,244 INFO 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 10:49:02,246 INFO 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 10:49:02,247 INFO 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 10:49:02,249 INFO 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 10:49:02,250 INFO 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 10:49:02,251 INFO 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 10:49:02,252 INFO 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 10:49:02,253 INFO 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 10:49:02,258 INFO 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 10:49:02,259 INFO 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 10:49:02,265 INFO 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 10:49:02,268 INFO 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 10:49:02,269 INFO 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 10:49:02,444 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2018-11-18 10:49:02,701 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:49:02,701 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:49:02,702 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:49:02,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:02,702 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:49:02,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:02,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:02,703 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:02,703 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:49:02,703 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:49:02,704 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:02,704 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 10:49:02,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:02,704 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:49:02,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:02,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:02,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:02,705 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:49:02,705 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:49:02,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:02,710 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 10:49:02,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:02,711 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:49:02,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:02,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:02,711 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:02,711 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:49:02,711 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:49:02,712 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:02,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 10:49:02,712 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:02,712 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:49:02,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:02,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:02,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:02,713 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:49:02,713 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:49:02,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:02,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 10:49:02,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:02,714 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:49:02,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:02,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:02,714 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:02,715 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:49:02,715 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:49:02,715 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:02,715 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 10:49:02,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:02,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:02,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:02,716 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:02,717 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:49:02,717 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:49:02,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:02,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 10:49:02,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:02,719 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:49:02,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:02,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:02,719 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:02,720 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:49:02,720 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:49:02,721 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:02,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 10:49:02,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:02,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:02,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:02,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:02,723 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:49:02,723 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:49:02,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:02,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 10:49:02,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:02,727 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 10:49:02,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:02,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:02,728 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:49:02,729 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:49:02,732 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:02,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 10:49:02,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:02,733 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 10:49:02,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:02,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:02,734 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:49:02,734 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:49:02,739 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:02,739 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 10:49:02,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:02,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:02,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:02,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:02,741 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:49:02,741 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:49:02,747 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 10:49:02,753 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 10:49:02,753 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 10:49:02,753 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 10:49:02,754 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-18 10:49:02,754 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 10:49:02,754 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) = 3*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 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_lis_~best~0.base) ULTIMATE.start_lis_~best~0.offset)_1 - 1 >= 0] [2018-11-18 10:49:02,886 INFO L297 tatePredicateManager]: 36 out of 38 supporting invariants were superfluous and have been removed [2018-11-18 10:49:02,890 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 10:49:02,890 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 10:49:02,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:49:02,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:49:02,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:49:02,933 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 10:49:02,940 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:02,941 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:02,942 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 10:49:02,942 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:49:02,945 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:49:02,949 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 10:49:02,949 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:9 [2018-11-18 10:49:02,960 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 10:49:02,963 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 10:49:02,963 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:49:02,972 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 10:49:02,974 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 10:49:02,974 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:49:02,982 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:49:02,985 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 10:49:02,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:49:02,996 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:48, output treesize:31 [2018-11-18 10:49:03,031 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 10:49:03,034 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:03,035 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 10:49:03,036 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:49:03,048 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 10:49:03,051 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:03,051 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:03,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 35 [2018-11-18 10:49:03,053 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:49:03,061 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:49:03,067 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 10:49:03,075 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 10:49:03,075 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:62, output treesize:45 [2018-11-18 10:49:03,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:49:03,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:49:03,196 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:03,198 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 105 treesize of output 89 [2018-11-18 10:49:03,206 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:03,209 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:03,211 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:03,212 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:49:03,219 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:03,233 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 74 treesize of output 167 [2018-11-18 10:49:03,236 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 10:49:03,278 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 82 [2018-11-18 10:49:03,280 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 10:49:03,280 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:49:03,288 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:49:03,293 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 85 treesize of output 86 [2018-11-18 10:49:03,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-18 10:49:03,296 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 10:49:03,306 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:49:03,326 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 10:49:03,351 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 10:49:03,351 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:115, output treesize:179 [2018-11-18 10:49:03,549 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 10:49:03,549 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 7 loop predicates [2018-11-18 10:49:03,549 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 54 transitions. cyclomatic complexity: 17 Second operand 12 states. [2018-11-18 10:49:03,831 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 54 transitions. cyclomatic complexity: 17. Second operand 12 states. Result 153 states and 210 transitions. Complement of second has 19 states. [2018-11-18 10:49:03,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 5 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-18 10:49:03,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 10:49:03,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 62 transitions. [2018-11-18 10:49:03,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 62 transitions. Stem has 14 letters. Loop has 10 letters. [2018-11-18 10:49:03,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:49:03,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 62 transitions. Stem has 24 letters. Loop has 10 letters. [2018-11-18 10:49:03,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:49:03,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 62 transitions. Stem has 14 letters. Loop has 20 letters. [2018-11-18 10:49:03,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:49:03,837 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 153 states and 210 transitions. [2018-11-18 10:49:03,840 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 41 [2018-11-18 10:49:03,842 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 153 states to 143 states and 195 transitions. [2018-11-18 10:49:03,842 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2018-11-18 10:49:03,842 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2018-11-18 10:49:03,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 143 states and 195 transitions. [2018-11-18 10:49:03,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:49:03,843 INFO L705 BuchiCegarLoop]: Abstraction has 143 states and 195 transitions. [2018-11-18 10:49:03,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states and 195 transitions. [2018-11-18 10:49:03,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 110. [2018-11-18 10:49:03,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-18 10:49:03,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 153 transitions. [2018-11-18 10:49:03,848 INFO L728 BuchiCegarLoop]: Abstraction has 110 states and 153 transitions. [2018-11-18 10:49:03,848 INFO L608 BuchiCegarLoop]: Abstraction has 110 states and 153 transitions. [2018-11-18 10:49:03,848 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 10:49:03,848 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 110 states and 153 transitions. [2018-11-18 10:49:03,849 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 29 [2018-11-18 10:49:03,849 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:49:03,849 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:49:03,850 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:49:03,850 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:49:03,850 INFO L794 eck$LassoCheckResult]: Stem: 1186#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1182#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; 1148#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1149#L558-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; 1165#L545-4 assume true; 1188#L545-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); 1184#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1185#L545-4 assume true; 1178#L545-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); 1179#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1190#L545-4 assume true; 1176#L545-1 assume !(lis_~i~0 < lis_~N); 1177#L545-5 lis_~i~0 := 1; 1189#L547-4 assume true; 1237#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1200#L548-4 [2018-11-18 10:49:03,850 INFO L796 eck$LassoCheckResult]: Loop: 1200#L548-4 assume true; 1199#L548-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; 1198#L549 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; 1197#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 1152#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1194#L548-4 assume true; 1195#L548-1 assume !(lis_~j~0 < lis_~i~0); 1173#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 1174#L547-4 assume true; 1180#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1200#L548-4 [2018-11-18 10:49:03,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:49:03,850 INFO L82 PathProgramCache]: Analyzing trace with hash -473934219, now seen corresponding path program 1 times [2018-11-18 10:49:03,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:49:03,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:49:03,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:03,851 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:49:03,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:03,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:03,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:03,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:49:03,868 INFO L82 PathProgramCache]: Analyzing trace with hash -856528460, now seen corresponding path program 1 times [2018-11-18 10:49:03,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:49:03,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:49:03,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:03,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:49:03,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:03,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:03,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:03,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:49:03,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1281376040, now seen corresponding path program 1 times [2018-11-18 10:49:03,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:49:03,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:49:03,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:03,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:49:03,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:03,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:49:03,945 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 10:49:03,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:49:03,946 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25f04ae1-e643-443a-91ff-e3c00beaa66b/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 10:49:03,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:49:03,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:49:03,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:49:04,039 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 10:49:04,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:49:04,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-11-18 10:49:04,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 10:49:04,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-11-18 10:49:04,152 INFO L87 Difference]: Start difference. First operand 110 states and 153 transitions. cyclomatic complexity: 51 Second operand 14 states. [2018-11-18 10:49:04,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:49:04,414 INFO L93 Difference]: Finished difference Result 407 states and 553 transitions. [2018-11-18 10:49:04,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-18 10:49:04,415 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 407 states and 553 transitions. [2018-11-18 10:49:04,418 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 63 [2018-11-18 10:49:04,420 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 407 states to 315 states and 434 transitions. [2018-11-18 10:49:04,420 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 129 [2018-11-18 10:49:04,422 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 129 [2018-11-18 10:49:04,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 315 states and 434 transitions. [2018-11-18 10:49:04,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:49:04,422 INFO L705 BuchiCegarLoop]: Abstraction has 315 states and 434 transitions. [2018-11-18 10:49:04,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states and 434 transitions. [2018-11-18 10:49:04,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 122. [2018-11-18 10:49:04,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-18 10:49:04,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 167 transitions. [2018-11-18 10:49:04,433 INFO L728 BuchiCegarLoop]: Abstraction has 122 states and 167 transitions. [2018-11-18 10:49:04,433 INFO L608 BuchiCegarLoop]: Abstraction has 122 states and 167 transitions. [2018-11-18 10:49:04,433 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 10:49:04,433 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states and 167 transitions. [2018-11-18 10:49:04,434 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 34 [2018-11-18 10:49:04,434 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:49:04,434 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:49:04,435 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:49:04,435 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 10:49:04,435 INFO L794 eck$LassoCheckResult]: Stem: 1817#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1813#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; 1780#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1781#L558-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; 1796#L545-4 assume true; 1819#L545-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); 1827#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1820#L545-4 assume true; 1821#L545-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); 1815#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 1816#L545-4 assume true; 1806#L545-1 assume !(lis_~i~0 < lis_~N); 1807#L545-5 lis_~i~0 := 1; 1810#L547-4 assume true; 1792#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 1793#L548-4 [2018-11-18 10:49:04,435 INFO L796 eck$LassoCheckResult]: Loop: 1793#L548-4 assume true; 1894#L548-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; 1892#L549 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; 1890#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 1891#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 1793#L548-4 [2018-11-18 10:49:04,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:49:04,435 INFO L82 PathProgramCache]: Analyzing trace with hash -473934219, now seen corresponding path program 2 times [2018-11-18 10:49:04,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:49:04,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:49:04,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:04,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:49:04,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:04,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:04,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:04,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:49:04,451 INFO L82 PathProgramCache]: Analyzing trace with hash 64095531, now seen corresponding path program 1 times [2018-11-18 10:49:04,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:49:04,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:49:04,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:04,452 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:49:04,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:04,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:04,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:04,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:49:04,460 INFO L82 PathProgramCache]: Analyzing trace with hash -20342985, now seen corresponding path program 1 times [2018-11-18 10:49:04,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:49:04,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:49:04,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:04,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:49:04,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:04,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:04,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:04,627 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 73 [2018-11-18 10:49:04,944 WARN L180 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 113 [2018-11-18 10:49:05,044 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:49:05,044 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:49:05,045 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:49:05,045 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:49:05,045 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:49:05,045 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:49:05,045 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:49:05,045 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:49:05,045 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-valid-memsafety_true-termination.i_Iteration7_Lasso [2018-11-18 10:49:05,045 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:49:05,045 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:49:05,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 10:49:05,054 INFO 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 10:49:05,056 INFO 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 10:49:05,057 INFO 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 10:49:05,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:49:05,060 INFO 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 10:49:05,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 10:49: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 10:49: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 10:49: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 10:49:05,070 INFO 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 10:49: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 10:49: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 10:49:05,465 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 102 [2018-11-18 10:49:05,617 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 87 [2018-11-18 10:49:05,617 INFO 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 10:49:05,618 INFO 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 10:49:05,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 10:49:05,621 INFO 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 10:49:05,623 INFO 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 10:49:05,624 INFO 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 10:49:05,627 INFO 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 10:49:05,787 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2018-11-18 10:49:06,067 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:49:06,067 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:49:06,067 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 10:49:06,068 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:06,068 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:49:06,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:06,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:06,068 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:06,069 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:49:06,069 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:49:06,069 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:06,070 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 10:49:06,070 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:06,070 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:49:06,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:06,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:06,071 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:06,071 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:49:06,071 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:49:06,071 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:06,072 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:49:06,072 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:06,072 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:06,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:06,072 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:06,073 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:49:06,073 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:49:06,074 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:06,074 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:49:06,075 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:06,075 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:49:06,075 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:06,075 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:06,075 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:06,075 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:49:06,075 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:49:06,076 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:06,076 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 10:49:06,076 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:06,076 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:49:06,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:06,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:06,076 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:06,077 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:49:06,077 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:49:06,077 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:06,077 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 10:49:06,078 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:06,078 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:49:06,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:06,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:06,078 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:06,078 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:49:06,078 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:49:06,079 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:06,079 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:49:06,079 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:06,079 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:49:06,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:06,080 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:06,080 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:06,080 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:49:06,080 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:49:06,080 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:06,081 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 10:49:06,081 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:06,081 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:49:06,081 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:06,081 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:06,081 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:06,082 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:49:06,082 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:49:06,082 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:06,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 10:49:06,083 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:06,083 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:49:06,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:06,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:06,083 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:06,083 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:49:06,083 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:49:06,084 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:06,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 10:49:06,084 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:06,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:06,085 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:06,085 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:06,085 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:49:06,085 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:49:06,086 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:06,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 10:49:06,087 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:06,087 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:49:06,087 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:06,087 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:06,087 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:06,088 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:49:06,088 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:49:06,088 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:06,088 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:49:06,088 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:06,088 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:49:06,088 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:06,088 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:06,089 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:06,089 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:49:06,089 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:49:06,089 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:06,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 10:49:06,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:06,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:06,090 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:06,090 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:06,090 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:49:06,090 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:49:06,093 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:06,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 10:49:06,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:06,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:06,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:06,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:06,095 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:49:06,095 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:49:06,096 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:06,096 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:49:06,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:06,097 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:49:06,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:06,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:06,097 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:06,097 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:49:06,097 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:49:06,098 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:06,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 10:49:06,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:06,099 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:06,099 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:06,099 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:06,100 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:49:06,100 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:49:06,103 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:06,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 10:49:06,103 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:06,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:06,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:06,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:06,105 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:49:06,105 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:49:06,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:06,111 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 10:49:06,112 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:06,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:06,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:06,112 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:06,116 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:49:06,116 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:49:06,148 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 10:49:06,182 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-18 10:49:06,182 INFO L444 ModelExtractionUtils]: 48 out of 55 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-18 10:49:06,183 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 10:49:06,184 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 10:49:06,184 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 10:49:06,184 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~j~0, ULTIMATE.start_lis_~i~0) = -2*ULTIMATE.start_lis_~j~0 + 1*ULTIMATE.start_lis_~i~0 Supporting invariants [] [2018-11-18 10:49:06,318 INFO L297 tatePredicateManager]: 42 out of 43 supporting invariants were superfluous and have been removed [2018-11-18 10:49:06,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:49:06,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:49:06,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:49:06,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:49:06,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:49:06,370 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 10:49:06,370 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 10:49:06,371 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 122 states and 167 transitions. cyclomatic complexity: 54 Second operand 5 states. [2018-11-18 10:49:06,412 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 10:49:06,414 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 10:49:06,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 10:49:06,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2018-11-18 10:49:06,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 15 letters. Loop has 5 letters. [2018-11-18 10:49:06,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:49:06,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 20 letters. Loop has 5 letters. [2018-11-18 10:49:06,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:49:06,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 15 letters. Loop has 10 letters. [2018-11-18 10:49:06,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:49:06,416 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 249 states and 349 transitions. [2018-11-18 10:49:06,418 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 29 [2018-11-18 10:49:06,419 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 249 states to 191 states and 263 transitions. [2018-11-18 10:49:06,419 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2018-11-18 10:49:06,419 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2018-11-18 10:49:06,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 191 states and 263 transitions. [2018-11-18 10:49:06,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:49:06,420 INFO L705 BuchiCegarLoop]: Abstraction has 191 states and 263 transitions. [2018-11-18 10:49:06,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states and 263 transitions. [2018-11-18 10:49:06,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 177. [2018-11-18 10:49:06,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-11-18 10:49:06,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 247 transitions. [2018-11-18 10:49:06,429 INFO L728 BuchiCegarLoop]: Abstraction has 177 states and 247 transitions. [2018-11-18 10:49:06,429 INFO L608 BuchiCegarLoop]: Abstraction has 177 states and 247 transitions. [2018-11-18 10:49:06,429 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 10:49:06,429 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 177 states and 247 transitions. [2018-11-18 10:49:06,430 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 29 [2018-11-18 10:49:06,430 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:49:06,430 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:49:06,430 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:49:06,431 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:49:06,431 INFO L794 eck$LassoCheckResult]: Stem: 2453#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2450#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; 2414#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 2415#L558-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; 2430#L545-4 assume true; 2443#L545-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); 2444#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2451#L545-4 assume true; 2455#L545-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); 2466#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2465#L545-4 assume true; 2461#L545-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); 2462#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2460#L545-4 assume true; 2441#L545-1 assume !(lis_~i~0 < lis_~N); 2442#L545-5 lis_~i~0 := 1; 2445#L547-4 assume true; 2447#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2483#L548-4 assume true; 2500#L548-1 assume !(lis_~j~0 < lis_~i~0); 2501#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 2467#L547-4 assume true; 2468#L547-1 [2018-11-18 10:49:06,431 INFO L796 eck$LassoCheckResult]: Loop: 2468#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2549#L548-4 assume true; 2548#L548-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; 2547#L549 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; 2546#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 2418#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2543#L548-4 assume true; 2544#L548-1 assume !(lis_~j~0 < lis_~i~0); 2550#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 2469#L547-4 assume true; 2468#L547-1 [2018-11-18 10:49:06,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:49:06,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1831421780, now seen corresponding path program 1 times [2018-11-18 10:49:06,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:49:06,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:49:06,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:06,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:49:06,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:06,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:49:06,469 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 10:49:06,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:49:06,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 10:49:06,470 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:49:06,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:49:06,470 INFO L82 PathProgramCache]: Analyzing trace with hash 892563118, now seen corresponding path program 2 times [2018-11-18 10:49:06,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:49:06,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:49:06,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:06,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:49:06,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:06,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:06,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:06,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 10:49:06,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 10:49:06,585 INFO L87 Difference]: Start difference. First operand 177 states and 247 transitions. cyclomatic complexity: 84 Second operand 4 states. [2018-11-18 10:49:06,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:49:06,615 INFO L93 Difference]: Finished difference Result 189 states and 259 transitions. [2018-11-18 10:49:06,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 10:49:06,616 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 189 states and 259 transitions. [2018-11-18 10:49:06,618 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 29 [2018-11-18 10:49:06,619 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 189 states to 187 states and 257 transitions. [2018-11-18 10:49:06,619 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2018-11-18 10:49:06,619 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2018-11-18 10:49:06,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 187 states and 257 transitions. [2018-11-18 10:49:06,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:49:06,619 INFO L705 BuchiCegarLoop]: Abstraction has 187 states and 257 transitions. [2018-11-18 10:49:06,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states and 257 transitions. [2018-11-18 10:49:06,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 175. [2018-11-18 10:49:06,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-11-18 10:49:06,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 243 transitions. [2018-11-18 10:49:06,624 INFO L728 BuchiCegarLoop]: Abstraction has 175 states and 243 transitions. [2018-11-18 10:49:06,624 INFO L608 BuchiCegarLoop]: Abstraction has 175 states and 243 transitions. [2018-11-18 10:49:06,624 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-18 10:49:06,625 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 175 states and 243 transitions. [2018-11-18 10:49:06,625 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 29 [2018-11-18 10:49:06,625 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:49:06,626 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:49:06,626 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 10:49:06,626 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:49:06,626 INFO L794 eck$LassoCheckResult]: Stem: 2825#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2821#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; 2787#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 2788#L558-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; 2805#L545-4 assume true; 2827#L545-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); 2822#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2823#L545-4 assume true; 2811#L545-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); 2812#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2836#L545-4 assume true; 2834#L545-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); 2835#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 2833#L545-4 assume true; 2809#L545-1 assume !(lis_~i~0 < lis_~N); 2810#L545-5 lis_~i~0 := 1; 2828#L547-4 assume true; 2799#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2801#L548-4 assume true; 2813#L548-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; 2941#L549 assume !lis_#t~short11; 2940#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 2914#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2909#L548-4 assume true; 2911#L548-1 assume !(lis_~j~0 < lis_~i~0); 2921#L547-3 [2018-11-18 10:49:06,627 INFO L796 eck$LassoCheckResult]: Loop: 2921#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 2818#L547-4 assume true; 2819#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 2920#L548-4 assume true; 2919#L548-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; 2918#L549 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; 2916#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 2917#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 2912#L548-4 assume true; 2913#L548-1 assume !(lis_~j~0 < lis_~i~0); 2921#L547-3 [2018-11-18 10:49:06,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:49:06,627 INFO L82 PathProgramCache]: Analyzing trace with hash 963661759, now seen corresponding path program 1 times [2018-11-18 10:49:06,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:49:06,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:49:06,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:06,628 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:49:06,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:06,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:06,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:06,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:49:06,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1826216110, now seen corresponding path program 3 times [2018-11-18 10:49:06,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:49:06,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:49:06,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:06,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:49:06,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:06,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:06,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:06,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:49:06,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1355803924, now seen corresponding path program 1 times [2018-11-18 10:49:06,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:49:06,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:49:06,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:06,665 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:49:06,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:06,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:49:06,727 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 10:49:06,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:49:06,728 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25f04ae1-e643-443a-91ff-e3c00beaa66b/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 10:49:06,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:49:06,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:49:06,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:49:06,809 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 10:49:06,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:49:06,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 11 [2018-11-18 10:49:06,949 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2018-11-18 10:49:06,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 10:49:06,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-11-18 10:49:06,968 INFO L87 Difference]: Start difference. First operand 175 states and 243 transitions. cyclomatic complexity: 82 Second operand 12 states. [2018-11-18 10:49:07,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:49:07,057 INFO L93 Difference]: Finished difference Result 214 states and 288 transitions. [2018-11-18 10:49:07,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 10:49:07,058 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 214 states and 288 transitions. [2018-11-18 10:49:07,059 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 43 [2018-11-18 10:49:07,059 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 214 states to 90 states and 119 transitions. [2018-11-18 10:49:07,060 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2018-11-18 10:49:07,060 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2018-11-18 10:49:07,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 119 transitions. [2018-11-18 10:49:07,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:49:07,060 INFO L705 BuchiCegarLoop]: Abstraction has 90 states and 119 transitions. [2018-11-18 10:49:07,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 119 transitions. [2018-11-18 10:49:07,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 56. [2018-11-18 10:49:07,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-18 10:49:07,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 72 transitions. [2018-11-18 10:49:07,062 INFO L728 BuchiCegarLoop]: Abstraction has 56 states and 72 transitions. [2018-11-18 10:49:07,062 INFO L608 BuchiCegarLoop]: Abstraction has 56 states and 72 transitions. [2018-11-18 10:49:07,062 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-18 10:49:07,063 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 72 transitions. [2018-11-18 10:49:07,063 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2018-11-18 10:49:07,063 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:49:07,063 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:49:07,064 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 10:49:07,064 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 2, 1, 1, 1, 1] [2018-11-18 10:49:07,064 INFO L794 eck$LassoCheckResult]: Stem: 3330#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3327#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; 3301#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 3302#L558-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; 3315#L545-4 assume true; 3332#L545-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); 3339#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3333#L545-4 assume true; 3320#L545-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#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3328#L545-4 assume true; 3337#L545-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); 3338#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3336#L545-4 assume true; 3318#L545-1 assume !(lis_~i~0 < lis_~N); 3319#L545-5 lis_~i~0 := 1; 3334#L547-4 assume true; 3312#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 3313#L548-4 assume true; 3352#L548-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; 3351#L549 assume !lis_#t~short11; 3348#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 3349#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3342#L548-4 assume true; 3341#L548-1 assume !(lis_~j~0 < lis_~i~0); 3324#L547-3 [2018-11-18 10:49:07,064 INFO L796 eck$LassoCheckResult]: Loop: 3324#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 3325#L547-4 assume true; 3326#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 3335#L548-4 assume true; 3303#L548-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; 3304#L549 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; 3307#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 3308#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3316#L548-4 assume true; 3322#L548-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; 3353#L549 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; 3350#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 3346#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3347#L548-4 assume true; 3354#L548-1 assume !(lis_~j~0 < lis_~i~0); 3324#L547-3 [2018-11-18 10:49:07,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:49:07,065 INFO L82 PathProgramCache]: Analyzing trace with hash 963602177, now seen corresponding path program 1 times [2018-11-18 10:49:07,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:49:07,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:49:07,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:07,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:49:07,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:07,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:49:07,089 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-18 10:49:07,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:49:07,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:49:07,090 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:49:07,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:49:07,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1340824322, now seen corresponding path program 3 times [2018-11-18 10:49:07,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:49:07,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:49:07,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:07,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:49:07,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:07,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:07,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:07,532 WARN L180 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 113 [2018-11-18 10:49:07,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:49:07,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:49:07,624 INFO L87 Difference]: Start difference. First operand 56 states and 72 transitions. cyclomatic complexity: 20 Second operand 3 states. [2018-11-18 10:49:07,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:49:07,632 INFO L93 Difference]: Finished difference Result 61 states and 76 transitions. [2018-11-18 10:49:07,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:49:07,632 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 76 transitions. [2018-11-18 10:49:07,633 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2018-11-18 10:49:07,633 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 60 states and 75 transitions. [2018-11-18 10:49:07,633 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2018-11-18 10:49:07,633 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2018-11-18 10:49:07,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 75 transitions. [2018-11-18 10:49:07,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:49:07,634 INFO L705 BuchiCegarLoop]: Abstraction has 60 states and 75 transitions. [2018-11-18 10:49:07,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 75 transitions. [2018-11-18 10:49:07,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2018-11-18 10:49:07,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-18 10:49:07,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 74 transitions. [2018-11-18 10:49:07,636 INFO L728 BuchiCegarLoop]: Abstraction has 59 states and 74 transitions. [2018-11-18 10:49:07,636 INFO L608 BuchiCegarLoop]: Abstraction has 59 states and 74 transitions. [2018-11-18 10:49:07,636 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-18 10:49:07,636 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 74 transitions. [2018-11-18 10:49:07,636 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2018-11-18 10:49:07,636 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:49:07,636 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:49:07,637 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 10:49:07,637 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 2, 1, 1, 1, 1] [2018-11-18 10:49:07,637 INFO L794 eck$LassoCheckResult]: Stem: 3453#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3450#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; 3424#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 3425#L558-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; 3438#L545-4 assume true; 3445#L545-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); 3446#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3451#L545-4 assume true; 3455#L545-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); 3466#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3465#L545-4 assume true; 3463#L545-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); 3464#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 3462#L545-4 assume true; 3443#L545-1 assume !(lis_~i~0 < lis_~N); 3444#L545-5 lis_~i~0 := 1; 3449#L547-4 assume true; 3435#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 3436#L548-4 assume true; 3480#L548-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; 3479#L549 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; 3478#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 3477#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3476#L548-4 assume true; 3459#L548-1 assume !(lis_~j~0 < lis_~i~0); 3447#L547-3 [2018-11-18 10:49:07,637 INFO L796 eck$LassoCheckResult]: Loop: 3447#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 3448#L547-4 assume true; 3460#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 3461#L548-4 assume true; 3475#L548-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; 3474#L549 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; 3472#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 3439#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3440#L548-4 assume true; 3426#L548-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; 3427#L549 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; 3456#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 3431#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 3469#L548-4 assume true; 3470#L548-1 assume !(lis_~j~0 < lis_~i~0); 3447#L547-3 [2018-11-18 10:49:07,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:49:07,638 INFO L82 PathProgramCache]: Analyzing trace with hash 961755135, now seen corresponding path program 1 times [2018-11-18 10:49:07,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:49:07,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:49:07,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:07,638 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:49:07,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:07,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:07,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:07,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:49:07,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1340824322, now seen corresponding path program 4 times [2018-11-18 10:49:07,674 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:49:07,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:49:07,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:07,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:49:07,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:07,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:07,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:07,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:49:07,689 INFO L82 PathProgramCache]: Analyzing trace with hash 194864964, now seen corresponding path program 3 times [2018-11-18 10:49:07,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:49:07,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:49:07,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:07,691 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:49:07,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:07,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:07,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:08,238 WARN L180 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 112 [2018-11-18 10:49:09,876 WARN L180 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 225 DAG size of output: 164 [2018-11-18 10:49:10,565 WARN L180 SmtUtils]: Spent 685.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2018-11-18 10:49:10,567 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:49:10,567 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:49:10,567 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:49:10,567 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:49:10,568 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:49:10,568 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:49:10,568 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:49:10,568 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:49:10,568 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-valid-memsafety_true-termination.i_Iteration11_Lasso [2018-11-18 10:49:10,568 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:49:10,568 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:49:10,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:49:10,573 INFO 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 10:49:10,575 INFO 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 10:49:10,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:49:10,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:49:10,580 INFO 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 10:49:10,581 INFO 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 10:49:10,583 INFO 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 10:49:10,584 INFO 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 10:49:10,585 INFO 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 10:49:10,587 INFO 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 10:49:10,588 INFO 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 10:49:10,589 INFO 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 10:49:10,590 INFO 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 10:49:10,592 INFO 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 10:49:11,880 WARN L180 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 109 [2018-11-18 10:49:12,241 WARN L180 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 111 [2018-11-18 10:49:12,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:49:12,242 INFO 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 10:49:12,243 INFO 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 10:49:12,244 INFO 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 10:49:12,246 INFO 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 10:49:12,690 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:49:12,690 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:49:12,691 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 10:49:12,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:12,691 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:49:12,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:12,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:12,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:12,692 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:49:12,692 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:49:12,692 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:12,693 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 10:49:12,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:12,693 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:49:12,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:12,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:12,693 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:12,694 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:49:12,694 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:49:12,694 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:12,694 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 10:49:12,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:12,695 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:49:12,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:12,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:12,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:12,695 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:49:12,695 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:49:12,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:12,696 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 10:49:12,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:12,696 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:49:12,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:12,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:12,696 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:12,696 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:49:12,696 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:49:12,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:12,697 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 10:49:12,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:12,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:12,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:12,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:12,697 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:49:12,697 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:49:12,698 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:12,698 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 10:49:12,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:12,699 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:49:12,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:12,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:12,699 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:12,699 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:49:12,699 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:49:12,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:12,700 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:49:12,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:12,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:12,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:12,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:12,701 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:49:12,701 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:49:12,705 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:12,706 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:49:12,706 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:12,706 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:49:12,706 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:12,706 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:12,706 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:12,707 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:49:12,707 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:49:12,707 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:12,707 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 10:49:12,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:12,708 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:49:12,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:12,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:12,708 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:12,708 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:49:12,708 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:49:12,709 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:12,709 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:49:12,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:12,709 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:49:12,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:12,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:12,710 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:12,710 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:49:12,710 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:49:12,711 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:12,711 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 10:49:12,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:12,711 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:49:12,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:12,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:12,712 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:12,712 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:49:12,712 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:49:12,712 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:12,713 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:49:12,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:12,713 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:49:12,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:12,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:12,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:12,714 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:49:12,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:49:12,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:12,715 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 10:49:12,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:12,715 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:49:12,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:12,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:12,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:12,715 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:49:12,716 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:49:12,716 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:12,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 10:49:12,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:12,717 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:49:12,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:12,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:12,717 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:12,717 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:49:12,717 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:49:12,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:12,718 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 10:49:12,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:12,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:12,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:12,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:12,719 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:49:12,719 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:49:12,722 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:12,722 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 10:49:12,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:12,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:12,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:12,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:12,724 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:49:12,724 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:49:12,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:12,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 10:49:12,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:12,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:12,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:12,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:12,728 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:49:12,728 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:49:12,729 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:12,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 10:49:12,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:12,730 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 10:49:12,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:12,730 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:12,731 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:49:12,731 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:49:12,734 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:12,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 10:49:12,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:12,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:12,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:12,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:12,738 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:49:12,738 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:49:12,762 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 10:49:12,795 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-18 10:49:12,795 INFO L444 ModelExtractionUtils]: 46 out of 55 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-18 10:49:12,795 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 10:49:12,796 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 10:49:12,796 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 10:49:12,796 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_lis_~best~0.base)_4, ULTIMATE.start_lis_~i~0) = 1*v_rep(select #length ULTIMATE.start_lis_~best~0.base)_4 - 8*ULTIMATE.start_lis_~i~0 Supporting invariants [] [2018-11-18 10:49:13,069 INFO L297 tatePredicateManager]: 64 out of 64 supporting invariants were superfluous and have been removed [2018-11-18 10:49:13,069 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 10:49:13,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:49:13,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:49:13,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:49:13,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:49:13,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:49:13,190 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 10:49:13,190 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-18 10:49:13,190 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 59 states and 74 transitions. cyclomatic complexity: 19 Second operand 7 states. [2018-11-18 10:49:13,319 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 59 states and 74 transitions. cyclomatic complexity: 19. Second operand 7 states. Result 106 states and 137 transitions. Complement of second has 13 states. [2018-11-18 10:49:13,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-18 10:49:13,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 10:49:13,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 57 transitions. [2018-11-18 10:49:13,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 57 transitions. Stem has 25 letters. Loop has 15 letters. [2018-11-18 10:49:13,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:49:13,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 57 transitions. Stem has 40 letters. Loop has 15 letters. [2018-11-18 10:49:13,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:49:13,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 57 transitions. Stem has 25 letters. Loop has 30 letters. [2018-11-18 10:49:13,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:49:13,321 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 106 states and 137 transitions. [2018-11-18 10:49:13,322 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 34 [2018-11-18 10:49:13,323 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 106 states to 105 states and 136 transitions. [2018-11-18 10:49:13,323 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2018-11-18 10:49:13,323 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2018-11-18 10:49:13,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 136 transitions. [2018-11-18 10:49:13,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:49:13,323 INFO L705 BuchiCegarLoop]: Abstraction has 105 states and 136 transitions. [2018-11-18 10:49:13,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 136 transitions. [2018-11-18 10:49:13,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 92. [2018-11-18 10:49:13,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-18 10:49:13,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 119 transitions. [2018-11-18 10:49:13,326 INFO L728 BuchiCegarLoop]: Abstraction has 92 states and 119 transitions. [2018-11-18 10:49:13,326 INFO L608 BuchiCegarLoop]: Abstraction has 92 states and 119 transitions. [2018-11-18 10:49:13,326 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-18 10:49:13,326 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 119 transitions. [2018-11-18 10:49:13,326 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 26 [2018-11-18 10:49:13,326 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:49:13,326 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:49:13,327 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:49:13,327 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:49:13,327 INFO L794 eck$LassoCheckResult]: Stem: 4036#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4033#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; 4002#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 4003#L558-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; 4018#L545-4 assume true; 4038#L545-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); 4069#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 4039#L545-4 assume true; 4025#L545-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); 4026#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 4034#L545-4 assume true; 4067#L545-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); 4068#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 4066#L545-4 assume true; 4023#L545-1 assume !(lis_~i~0 < lis_~N); 4024#L545-5 lis_~i~0 := 1; 4032#L547-4 assume true; 4013#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 4014#L548-4 assume true; 4063#L548-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; 4061#L549 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; 4059#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 4057#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 4047#L548-4 assume true; 4044#L548-1 assume !(lis_~j~0 < lis_~i~0); 4043#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 4029#L547-4 [2018-11-18 10:49:13,327 INFO L796 eck$LassoCheckResult]: Loop: 4029#L547-4 assume true; 4045#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 4046#L548-4 assume true; 4088#L548-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; 4089#L549 assume !lis_#t~short11; 4008#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 4009#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 4090#L548-4 assume true; 4004#L548-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; 4005#L549 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; 4073#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 4055#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 4054#L548-4 assume true; 4051#L548-1 assume !(lis_~j~0 < lis_~i~0); 4028#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 4029#L547-4 [2018-11-18 10:49:13,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:49:13,328 INFO L82 PathProgramCache]: Analyzing trace with hash -250361828, now seen corresponding path program 4 times [2018-11-18 10:49:13,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:49:13,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:49:13,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:13,329 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:49:13,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:13,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:13,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:13,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:49:13,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1411787442, now seen corresponding path program 1 times [2018-11-18 10:49:13,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:49:13,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:49:13,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:13,357 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:49:13,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:13,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:13,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:13,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:49:13,366 INFO L82 PathProgramCache]: Analyzing trace with hash 2053884215, now seen corresponding path program 1 times [2018-11-18 10:49:13,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:49:13,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:49:13,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:13,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:49:13,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:13,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:49:14,357 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 13 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:49:14,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:49:14,357 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25f04ae1-e643-443a-91ff-e3c00beaa66b/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 10:49:14,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:49:14,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:49:14,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:49:14,417 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:14,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 10:49:14,430 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:14,431 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:14,432 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 10:49:14,432 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:49:14,436 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:49:14,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:49:14,439 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2018-11-18 10:49:14,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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 10:49:14,607 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:14,607 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:14,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 10:49:14,608 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:49:14,622 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 10:49:14,624 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 10:49:14,625 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:49:14,632 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:49:14,637 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 10:49:14,645 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 10:49:14,645 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:73, output treesize:52 [2018-11-18 10:49:14,963 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 14 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-18 10:49:14,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:49:14,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 13] total 31 [2018-11-18 10:49:15,210 WARN L180 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 93 [2018-11-18 10:49:15,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-18 10:49:15,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=833, Unknown=0, NotChecked=0, Total=930 [2018-11-18 10:49:15,261 INFO L87 Difference]: Start difference. First operand 92 states and 119 transitions. cyclomatic complexity: 32 Second operand 31 states. [2018-11-18 10:49:21,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:49:21,392 INFO L93 Difference]: Finished difference Result 521 states and 677 transitions. [2018-11-18 10:49:21,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-11-18 10:49:21,393 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 521 states and 677 transitions. [2018-11-18 10:49:21,395 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 175 [2018-11-18 10:49:21,397 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 521 states to 521 states and 677 transitions. [2018-11-18 10:49:21,397 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 261 [2018-11-18 10:49:21,397 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 261 [2018-11-18 10:49:21,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 521 states and 677 transitions. [2018-11-18 10:49:21,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:49:21,398 INFO L705 BuchiCegarLoop]: Abstraction has 521 states and 677 transitions. [2018-11-18 10:49:21,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states and 677 transitions. [2018-11-18 10:49:21,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 263. [2018-11-18 10:49:21,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-11-18 10:49:21,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 344 transitions. [2018-11-18 10:49:21,404 INFO L728 BuchiCegarLoop]: Abstraction has 263 states and 344 transitions. [2018-11-18 10:49:21,404 INFO L608 BuchiCegarLoop]: Abstraction has 263 states and 344 transitions. [2018-11-18 10:49:21,404 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-18 10:49:21,404 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 263 states and 344 transitions. [2018-11-18 10:49:21,405 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 80 [2018-11-18 10:49:21,405 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:49:21,406 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:49:21,406 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:49:21,406 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 2, 1, 1, 1, 1] [2018-11-18 10:49:21,406 INFO L794 eck$LassoCheckResult]: Stem: 4950#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4946#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; 4917#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 4918#L558-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; 4933#L545-4 assume true; 4952#L545-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); 4960#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 4961#L545-4 assume true; 4962#L545-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); 4963#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 4953#L545-4 assume true; 4954#L545-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); 4947#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 4948#L545-4 assume true; 4936#L545-1 assume !(lis_~i~0 < lis_~N); 4937#L545-5 lis_~i~0 := 1; 4965#L547-4 assume true; 4966#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 4979#L548-4 assume true; 4978#L548-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; 4977#L549 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; 4975#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 4976#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 4972#L548-4 assume true; 4968#L548-1 assume !(lis_~j~0 < lis_~i~0); 4967#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 4942#L547-4 [2018-11-18 10:49:21,407 INFO L796 eck$LassoCheckResult]: Loop: 4942#L547-4 assume true; 4945#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 4964#L548-4 assume true; 5177#L548-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; 5176#L549 assume !lis_#t~short11; 4923#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 4924#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 4934#L548-4 assume true; 4919#L548-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; 4920#L549 assume !lis_#t~short11; 4957#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 5030#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 5029#L548-4 assume true; 5026#L548-1 assume !(lis_~j~0 < lis_~i~0); 4941#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 4942#L547-4 [2018-11-18 10:49:21,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:49:21,407 INFO L82 PathProgramCache]: Analyzing trace with hash -250361828, now seen corresponding path program 5 times [2018-11-18 10:49:21,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:49:21,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:49:21,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:21,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:49:21,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:21,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:21,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:21,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:49:21,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1470892786, now seen corresponding path program 1 times [2018-11-18 10:49:21,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:49:21,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:49:21,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:21,432 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:49:21,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:21,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:21,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:21,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:49:21,438 INFO L82 PathProgramCache]: Analyzing trace with hash 2112989559, now seen corresponding path program 2 times [2018-11-18 10:49:21,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:49:21,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:49:21,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:21,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:49:21,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:21,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:21,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:22,744 WARN L180 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 228 DAG size of output: 165 [2018-11-18 10:49:23,148 WARN L180 SmtUtils]: Spent 400.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2018-11-18 10:49:23,150 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:49:23,150 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:49:23,150 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:49:23,150 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:49:23,150 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:49:23,151 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:49:23,151 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:49:23,151 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:49:23,151 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-valid-memsafety_true-termination.i_Iteration13_Lasso [2018-11-18 10:49:23,151 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:49:23,151 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:49:23,154 INFO 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 10:49:23,156 INFO 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 10:49:23,157 INFO 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 10:49:23,159 INFO 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 10:49:23,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:49:23,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:49:23,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:49:23,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:49:23,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 10:49:23,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 10:49:23,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 10:49:23,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 10:49:23,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 10:49:23,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 10:49:23,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 10:49:23,184 INFO 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 10:49:23,623 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 93 [2018-11-18 10:49:23,678 INFO 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 10:49:23,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:49:23,681 INFO 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 10:49:23,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:49:24,012 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:49:24,013 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:49:24,013 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:49:24,013 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:24,014 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:49:24,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:24,014 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:24,014 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:24,014 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:49:24,014 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:49:24,015 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:24,015 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:49:24,015 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:24,015 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:49:24,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:24,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:24,016 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:24,016 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:49:24,016 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:49:24,016 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:24,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 10:49:24,017 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:24,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:24,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:24,017 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:24,017 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:49:24,018 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:49:24,018 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:24,019 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 10:49:24,019 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:24,019 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:49:24,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:24,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:24,019 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:24,020 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:49:24,020 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:49:24,020 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:24,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 10:49:24,020 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:24,021 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:49:24,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:24,021 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:24,021 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:24,021 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:49:24,021 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:49:24,021 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:24,022 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:49:24,022 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:24,022 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:49:24,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:24,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:24,022 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:24,022 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:49:24,023 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:49:24,023 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:24,023 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 10:49:24,023 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:24,023 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:49:24,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:24,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:24,024 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:24,024 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:49:24,024 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:49:24,024 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:24,025 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:49:24,025 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:24,025 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:49:24,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:24,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:24,025 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:24,025 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:49:24,026 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:49:24,026 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:24,026 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 10:49:24,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:24,027 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:49:24,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:24,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:24,027 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:24,027 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:49:24,027 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:49:24,027 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:24,028 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 10:49:24,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:24,028 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:49:24,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:24,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:24,028 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:24,029 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:49:24,029 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:49:24,030 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:24,030 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:49:24,030 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:24,030 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:49:24,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:24,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:24,031 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:24,031 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:49:24,031 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:49:24,031 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:24,032 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 10:49:24,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:24,032 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:49:24,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:24,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:24,032 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:24,033 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:49:24,034 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:49:24,034 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:24,034 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:49:24,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:24,035 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:49:24,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:24,035 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:24,035 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:24,035 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:49:24,035 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:49:24,036 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:24,036 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 10:49:24,036 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:24,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:24,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:24,037 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:24,037 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:49:24,038 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:49:24,038 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:24,039 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 10:49:24,039 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:24,039 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:49:24,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:24,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:24,039 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:24,040 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:49:24,040 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:49:24,040 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:24,040 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 10:49:24,041 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:24,041 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 10:49:24,041 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:24,041 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:24,042 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:49:24,042 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:49:24,044 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:24,044 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 10:49:24,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:24,046 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:49:24,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:24,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:24,047 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:24,047 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:49:24,047 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:49:24,048 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:24,048 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 10:49:24,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:24,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:24,049 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:24,049 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:24,049 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:49:24,049 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:49:24,050 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:24,051 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 10:49:24,051 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:24,051 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 10:49:24,051 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:24,051 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:24,052 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:49:24,052 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:49:24,056 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:24,056 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:49:24,057 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:24,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:24,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:24,057 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:24,058 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:49:24,058 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:49:24,059 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:24,059 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 10:49:24,060 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:24,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:24,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:24,060 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:24,061 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:49:24,061 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:49:24,063 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:24,063 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 10:49:24,063 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:24,063 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:24,064 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:24,064 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:24,064 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:49:24,064 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:49:24,065 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:24,066 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 10:49:24,066 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:24,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:24,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:24,066 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:24,067 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:49:24,067 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:49:24,068 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:24,068 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 10:49:24,068 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:24,069 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:24,069 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:24,069 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:24,072 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:49:24,072 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:49:24,094 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 10:49:24,124 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2018-11-18 10:49:24,125 INFO L444 ModelExtractionUtils]: 42 out of 52 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-11-18 10:49:24,125 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 10:49:24,126 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 10:49:24,126 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 10:49:24,126 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_lis_~a.base)_4, ULTIMATE.start_lis_~i~0) = 5*v_rep(select #length ULTIMATE.start_lis_~a.base)_4 - 24*ULTIMATE.start_lis_~i~0 Supporting invariants [] [2018-11-18 10:49:24,355 INFO L297 tatePredicateManager]: 46 out of 46 supporting invariants were superfluous and have been removed [2018-11-18 10:49:24,357 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 10:49:24,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:49:24,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:49:24,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:49:24,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:49:24,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:49:24,454 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 10:49:24,454 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-18 10:49:24,455 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 263 states and 344 transitions. cyclomatic complexity: 94 Second operand 8 states. [2018-11-18 10:49:24,582 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 263 states and 344 transitions. cyclomatic complexity: 94. Second operand 8 states. Result 587 states and 775 transitions. Complement of second has 15 states. [2018-11-18 10:49:24,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-18 10:49:24,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 10:49:24,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 57 transitions. [2018-11-18 10:49:24,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 57 transitions. Stem has 26 letters. Loop has 15 letters. [2018-11-18 10:49:24,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:49:24,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 57 transitions. Stem has 41 letters. Loop has 15 letters. [2018-11-18 10:49:24,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:49:24,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 57 transitions. Stem has 26 letters. Loop has 30 letters. [2018-11-18 10:49:24,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:49:24,584 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 587 states and 775 transitions. [2018-11-18 10:49:24,587 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 110 [2018-11-18 10:49:24,589 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 587 states to 461 states and 610 transitions. [2018-11-18 10:49:24,589 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 159 [2018-11-18 10:49:24,590 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 163 [2018-11-18 10:49:24,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 461 states and 610 transitions. [2018-11-18 10:49:24,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:49:24,590 INFO L705 BuchiCegarLoop]: Abstraction has 461 states and 610 transitions. [2018-11-18 10:49:24,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states and 610 transitions. [2018-11-18 10:49:24,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 378. [2018-11-18 10:49:24,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2018-11-18 10:49:24,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 495 transitions. [2018-11-18 10:49:24,598 INFO L728 BuchiCegarLoop]: Abstraction has 378 states and 495 transitions. [2018-11-18 10:49:24,598 INFO L608 BuchiCegarLoop]: Abstraction has 378 states and 495 transitions. [2018-11-18 10:49:24,598 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-18 10:49:24,598 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 378 states and 495 transitions. [2018-11-18 10:49:24,599 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 81 [2018-11-18 10:49:24,599 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:49:24,599 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:49:24,600 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:49:24,600 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 3, 3, 1, 1, 1, 1] [2018-11-18 10:49:24,600 INFO L794 eck$LassoCheckResult]: Stem: 6155#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6151#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; 6115#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 6116#L558-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; 6131#L545-4 assume true; 6157#L545-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); 6152#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 6153#L545-4 assume true; 6170#L545-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); 6171#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 6158#L545-4 assume true; 6138#L545-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); 6139#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 6165#L545-4 assume true; 6166#L545-1 assume !(lis_~i~0 < lis_~N); 6159#L545-5 lis_~i~0 := 1; 6160#L547-4 assume true; 6126#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 6128#L548-4 assume true; 6290#L548-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; 6285#L549 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; 6286#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 6383#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 6384#L548-4 assume true; 6361#L548-1 assume !(lis_~j~0 < lis_~i~0); 6358#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 6340#L547-4 assume true; 6179#L547-1 [2018-11-18 10:49:24,600 INFO L796 eck$LassoCheckResult]: Loop: 6179#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 6140#L548-4 assume true; 6141#L548-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; 6452#L549 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; 6453#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 6486#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 6484#L548-4 assume true; 6482#L548-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; 6477#L549 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; 6475#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 6440#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 6441#L548-4 assume true; 6474#L548-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; 6472#L549 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; 6434#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 6435#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 6419#L548-4 assume true; 6420#L548-1 assume !(lis_~j~0 < lis_~i~0); 6144#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 6145#L547-4 assume true; 6179#L547-1 [2018-11-18 10:49:24,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:49:24,601 INFO L82 PathProgramCache]: Analyzing trace with hash 885976254, now seen corresponding path program 2 times [2018-11-18 10:49:24,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:49:24,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:49:24,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:24,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:49:24,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:24,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:49:24,845 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:49:24,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:49:24,845 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25f04ae1-e643-443a-91ff-e3c00beaa66b/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 10:49:24,856 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 10:49:24,872 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 10:49:24,872 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 10:49:24,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:49:24,883 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:24,884 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 10:49:24,895 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:24,896 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:24,897 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 10:49:24,897 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:49:24,901 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:49:24,905 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 10:49:24,905 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:11 [2018-11-18 10:49:24,921 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 10:49:24,924 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 10:49:24,924 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:49:24,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-11-18 10:49:24,934 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 10:49:24,934 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:49:24,938 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:49:24,942 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 10:49:24,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:49:24,949 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:50, output treesize:33 [2018-11-18 10:49:25,013 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 10:49:25,015 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:25,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 10:49:25,016 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:49:25,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2018-11-18 10:49:25,030 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:25,031 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:25,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 10:49:25,031 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:49:25,040 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:49:25,045 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 10:49:25,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:49:25,053 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:64, output treesize:47 [2018-11-18 10:49:25,096 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 10:49:25,098 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:25,099 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:25,100 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:25,101 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 10:49:25,101 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:49:25,126 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 10:49:25,129 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:25,130 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:25,131 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:25,132 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:25,133 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:25,135 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:25,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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 10:49:25,136 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:49:25,153 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:49:25,160 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 10:49:25,170 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 10:49:25,171 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:82, output treesize:65 [2018-11-18 10:49:25,287 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:49:25,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:49:25,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2018-11-18 10:49:25,305 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:49:25,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:49:25,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1281391120, now seen corresponding path program 5 times [2018-11-18 10:49:25,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:49:25,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:49:25,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:25,306 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:49:25,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:25,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:25,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:26,547 WARN L180 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 195 DAG size of output: 145 [2018-11-18 10:49:26,730 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2018-11-18 10:49:26,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-18 10:49:26,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2018-11-18 10:49:26,731 INFO L87 Difference]: Start difference. First operand 378 states and 495 transitions. cyclomatic complexity: 133 Second operand 21 states. [2018-11-18 10:49:27,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:49:27,433 INFO L93 Difference]: Finished difference Result 755 states and 988 transitions. [2018-11-18 10:49:27,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-18 10:49:27,433 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 755 states and 988 transitions. [2018-11-18 10:49:27,435 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 189 [2018-11-18 10:49:27,438 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 755 states to 755 states and 988 transitions. [2018-11-18 10:49:27,439 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 258 [2018-11-18 10:49:27,439 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 258 [2018-11-18 10:49:27,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 755 states and 988 transitions. [2018-11-18 10:49:27,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:49:27,439 INFO L705 BuchiCegarLoop]: Abstraction has 755 states and 988 transitions. [2018-11-18 10:49:27,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states and 988 transitions. [2018-11-18 10:49:27,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 379. [2018-11-18 10:49:27,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-11-18 10:49:27,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 493 transitions. [2018-11-18 10:49:27,447 INFO L728 BuchiCegarLoop]: Abstraction has 379 states and 493 transitions. [2018-11-18 10:49:27,447 INFO L608 BuchiCegarLoop]: Abstraction has 379 states and 493 transitions. [2018-11-18 10:49:27,447 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-18 10:49:27,447 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 379 states and 493 transitions. [2018-11-18 10:49:27,448 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 81 [2018-11-18 10:49:27,448 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:49:27,448 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:49:27,449 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:49:27,449 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-18 10:49:27,449 INFO L794 eck$LassoCheckResult]: Stem: 7412#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7408#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; 7378#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 7379#L558-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; 7394#L545-4 assume true; 7414#L545-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); 7424#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 7425#L545-4 assume true; 7426#L545-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); 7427#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 7415#L545-4 assume true; 7404#L545-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); 7405#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 7421#L545-4 assume true; 7422#L545-1 assume !(lis_~i~0 < lis_~N); 7416#L545-5 lis_~i~0 := 1; 7417#L547-4 assume true; 7389#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 7391#L548-4 assume true; 7653#L548-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; 7652#L549 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; 7650#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 7647#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 7645#L548-4 assume true; 7642#L548-1 assume !(lis_~j~0 < lis_~i~0); 7640#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 7614#L547-4 assume true; 7433#L547-1 [2018-11-18 10:49:27,449 INFO L796 eck$LassoCheckResult]: Loop: 7433#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 7713#L548-4 assume true; 7711#L548-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; 7709#L549 assume !lis_#t~short11; 7708#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 7707#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 7706#L548-4 assume true; 7705#L548-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; 7703#L549 assume !lis_#t~short11; 7704#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 7742#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 7740#L548-4 assume true; 7724#L548-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; 7722#L549 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; 7693#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 7692#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 7690#L548-4 assume true; 7691#L548-1 assume !(lis_~j~0 < lis_~i~0); 7723#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 7747#L547-4 assume true; 7433#L547-1 [2018-11-18 10:49:27,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:49:27,449 INFO L82 PathProgramCache]: Analyzing trace with hash 828717952, now seen corresponding path program 6 times [2018-11-18 10:49:27,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:49:27,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:49:27,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:27,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:49:27,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:27,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:27,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:27,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:49:27,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1363389936, now seen corresponding path program 2 times [2018-11-18 10:49:27,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:49:27,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:49:27,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:27,474 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:49:27,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:27,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:27,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:27,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:49:27,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1587491823, now seen corresponding path program 3 times [2018-11-18 10:49:27,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:49:27,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:49:27,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:27,483 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:49:27,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:27,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:49:27,563 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 27 proven. 24 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-18 10:49:27,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:49:27,564 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25f04ae1-e643-443a-91ff-e3c00beaa66b/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 10:49:27,574 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 10:49:27,618 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-18 10:49:27,618 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 10:49:27,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:49:27,664 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 31 proven. 20 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-18 10:49:27,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:49:27,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-11-18 10:49:27,940 WARN L180 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 107 [2018-11-18 10:49:27,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 10:49:27,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-11-18 10:49:27,986 INFO L87 Difference]: Start difference. First operand 379 states and 493 transitions. cyclomatic complexity: 130 Second operand 13 states. [2018-11-18 10:49:28,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:49:28,132 INFO L93 Difference]: Finished difference Result 591 states and 741 transitions. [2018-11-18 10:49:28,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 10:49:28,133 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 591 states and 741 transitions. [2018-11-18 10:49:28,135 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 81 [2018-11-18 10:49:28,136 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 591 states to 497 states and 623 transitions. [2018-11-18 10:49:28,136 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 149 [2018-11-18 10:49:28,137 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 159 [2018-11-18 10:49:28,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 497 states and 623 transitions. [2018-11-18 10:49:28,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:49:28,137 INFO L705 BuchiCegarLoop]: Abstraction has 497 states and 623 transitions. [2018-11-18 10:49:28,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states and 623 transitions. [2018-11-18 10:49:28,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 464. [2018-11-18 10:49:28,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2018-11-18 10:49:28,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 582 transitions. [2018-11-18 10:49:28,143 INFO L728 BuchiCegarLoop]: Abstraction has 464 states and 582 transitions. [2018-11-18 10:49:28,144 INFO L608 BuchiCegarLoop]: Abstraction has 464 states and 582 transitions. [2018-11-18 10:49:28,144 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-18 10:49:28,144 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 464 states and 582 transitions. [2018-11-18 10:49:28,145 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 81 [2018-11-18 10:49:28,145 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:49:28,145 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:49:28,145 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 10:49:28,146 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 10:49:28,147 INFO L794 eck$LassoCheckResult]: Stem: 8553#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8549#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; 8519#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 8520#L558-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; 8535#L545-4 assume true; 8555#L545-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); 8569#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 8556#L545-4 assume true; 8557#L545-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); 8567#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 8568#L545-4 assume true; 8570#L545-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); 8551#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 8552#L545-4 assume true; 8544#L545-1 assume !(lis_~i~0 < lis_~N); 8545#L545-5 lis_~i~0 := 1; 8571#L547-4 assume true; 8572#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 8713#L548-4 assume true; 8711#L548-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; 8709#L549 assume !lis_#t~short11; 8706#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 8704#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 8702#L548-4 assume true; 8700#L548-1 assume !(lis_~j~0 < lis_~i~0); 8697#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 8695#L547-4 assume true; 8566#L547-1 assume !(lis_~i~0 < lis_~N); 8550#L547-5 lis_~i~0 := 0; 8518#L551-4 [2018-11-18 10:49:28,147 INFO L796 eck$LassoCheckResult]: Loop: 8518#L551-4 assume true; 8525#L551-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); 8554#L552 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; 8517#L551-3 lis_#t~post13 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post13;havoc lis_#t~post13; 8518#L551-4 [2018-11-18 10:49:28,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:49:28,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1699714880, now seen corresponding path program 1 times [2018-11-18 10:49:28,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:49:28,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:49:28,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:28,148 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:49:28,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:28,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:49:28,202 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 10:49:28,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:49:28,202 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25f04ae1-e643-443a-91ff-e3c00beaa66b/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 10:49:28,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:49:28,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:49:28,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:49:28,288 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 10:49:28,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:49:28,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2018-11-18 10:49:28,314 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:49:28,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:49:28,314 INFO L82 PathProgramCache]: Analyzing trace with hash 2991114, now seen corresponding path program 1 times [2018-11-18 10:49:28,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:49:28,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:49:28,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:28,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:49:28,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:28,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:28,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:28,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 10:49:28,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-11-18 10:49:28,362 INFO L87 Difference]: Start difference. First operand 464 states and 582 transitions. cyclomatic complexity: 129 Second operand 14 states. [2018-11-18 10:49:28,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:49:28,562 INFO L93 Difference]: Finished difference Result 481 states and 603 transitions. [2018-11-18 10:49:28,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 10:49:28,564 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 481 states and 603 transitions. [2018-11-18 10:49:28,566 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 81 [2018-11-18 10:49:28,570 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 481 states to 480 states and 599 transitions. [2018-11-18 10:49:28,570 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 142 [2018-11-18 10:49:28,570 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 142 [2018-11-18 10:49:28,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 480 states and 599 transitions. [2018-11-18 10:49:28,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:49:28,573 INFO L705 BuchiCegarLoop]: Abstraction has 480 states and 599 transitions. [2018-11-18 10:49:28,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states and 599 transitions. [2018-11-18 10:49:28,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 463. [2018-11-18 10:49:28,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2018-11-18 10:49:28,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 577 transitions. [2018-11-18 10:49:28,580 INFO L728 BuchiCegarLoop]: Abstraction has 463 states and 577 transitions. [2018-11-18 10:49:28,580 INFO L608 BuchiCegarLoop]: Abstraction has 463 states and 577 transitions. [2018-11-18 10:49:28,580 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-11-18 10:49:28,581 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 463 states and 577 transitions. [2018-11-18 10:49:28,582 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 81 [2018-11-18 10:49:28,582 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:49:28,582 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:49:28,582 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:49:28,582 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-18 10:49:28,583 INFO L794 eck$LassoCheckResult]: Stem: 9615#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9611#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; 9581#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 9582#L558-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; 9597#L545-4 assume true; 9617#L545-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); 9613#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 9614#L545-4 assume true; 9608#L545-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); 9609#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 9618#L545-4 assume true; 9619#L545-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); 9630#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 9631#L545-4 assume true; 9606#L545-1 assume !(lis_~i~0 < lis_~N); 9607#L545-5 lis_~i~0 := 1; 9633#L547-4 assume true; 9634#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 9767#L548-4 assume true; 9766#L548-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; 9765#L549 assume !lis_#t~short11; 9764#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 9763#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 9762#L548-4 assume true; 9761#L548-1 assume !(lis_~j~0 < lis_~i~0); 9759#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 9760#L547-4 assume true; 10031#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 10030#L548-4 assume true; 10029#L548-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; 10028#L549 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; 9801#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 9791#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 9792#L548-4 assume true; 9782#L548-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; 9783#L549 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; 9771#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 9743#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 9744#L548-4 assume true; 9733#L548-1 assume !(lis_~j~0 < lis_~i~0); 9640#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 9641#L547-4 assume true; 9711#L547-1 [2018-11-18 10:49:28,583 INFO L796 eck$LassoCheckResult]: Loop: 9711#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 9673#L548-4 assume true; 9672#L548-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; 9670#L549 assume !lis_#t~short11; 9668#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 9669#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 9664#L548-4 assume true; 9665#L548-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; 9697#L549 assume !lis_#t~short11; 9695#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 9693#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 9691#L548-4 assume true; 9689#L548-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; 9687#L549 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; 9649#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 9650#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 9692#L548-4 assume true; 9690#L548-1 assume !(lis_~j~0 < lis_~i~0); 9642#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 9643#L547-4 assume true; 9711#L547-1 [2018-11-18 10:49:28,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:49:28,583 INFO L82 PathProgramCache]: Analyzing trace with hash -313449339, now seen corresponding path program 2 times [2018-11-18 10:49:28,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:49:28,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:49:28,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:28,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:49:28,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:28,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:49:29,033 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 15 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:49:29,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:49:29,033 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25f04ae1-e643-443a-91ff-e3c00beaa66b/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 10:49:29,041 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 10:49:29,056 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 10:49:29,056 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 10:49:29,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:49:29,064 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:29,065 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 10:49:29,085 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:29,085 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:29,086 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 10:49:29,086 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:49:29,089 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:49:29,093 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 10:49:29,093 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:11 [2018-11-18 10:49:29,120 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 10:49:29,122 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 10:49:29,122 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:49:29,128 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 10:49:29,130 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 10:49:29,130 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:49:29,133 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:49:29,136 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 10:49:29,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:49:29,141 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:50, output treesize:33 [2018-11-18 10:49:29,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2018-11-18 10:49:29,193 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:29,194 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 10:49:29,194 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:49:29,206 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 10:49:29,208 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:29,209 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:29,209 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 10:49:29,209 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:49:29,217 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:49:29,221 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 10:49:29,228 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 10:49:29,229 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:59, output treesize:44 [2018-11-18 10:49:29,433 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 13 proven. 34 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 10:49:29,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:49:29,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 25 [2018-11-18 10:49:29,450 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:49:29,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:49:29,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1363389936, now seen corresponding path program 3 times [2018-11-18 10:49:29,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:49:29,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:49:29,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:29,451 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:49:29,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:29,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:29,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:29,698 WARN L180 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 109 [2018-11-18 10:49:29,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-18 10:49:29,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2018-11-18 10:49:29,738 INFO L87 Difference]: Start difference. First operand 463 states and 577 transitions. cyclomatic complexity: 125 Second operand 25 states. [2018-11-18 10:49:30,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:49:30,586 INFO L93 Difference]: Finished difference Result 587 states and 732 transitions. [2018-11-18 10:49:30,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-18 10:49:30,588 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 587 states and 732 transitions. [2018-11-18 10:49:30,589 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 112 [2018-11-18 10:49:30,591 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 587 states to 587 states and 732 transitions. [2018-11-18 10:49:30,591 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 175 [2018-11-18 10:49:30,591 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 175 [2018-11-18 10:49:30,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 587 states and 732 transitions. [2018-11-18 10:49:30,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:49:30,591 INFO L705 BuchiCegarLoop]: Abstraction has 587 states and 732 transitions. [2018-11-18 10:49:30,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states and 732 transitions. [2018-11-18 10:49:30,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 469. [2018-11-18 10:49:30,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2018-11-18 10:49:30,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 583 transitions. [2018-11-18 10:49:30,603 INFO L728 BuchiCegarLoop]: Abstraction has 469 states and 583 transitions. [2018-11-18 10:49:30,604 INFO L608 BuchiCegarLoop]: Abstraction has 469 states and 583 transitions. [2018-11-18 10:49:30,604 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-11-18 10:49:30,604 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 469 states and 583 transitions. [2018-11-18 10:49:30,605 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 81 [2018-11-18 10:49:30,605 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:49:30,605 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:49:30,612 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:49:30,612 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 3, 3, 1, 1, 1, 1] [2018-11-18 10:49:30,613 INFO L794 eck$LassoCheckResult]: Stem: 10848#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10844#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; 10812#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 10813#L558-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; 10828#L545-4 assume true; 10850#L545-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); 10861#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 10862#L545-4 assume true; 10863#L545-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); 10864#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 10851#L545-4 assume true; 10839#L545-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); 10840#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 10856#L545-4 assume true; 10857#L545-1 assume !(lis_~i~0 < lis_~N); 10852#L545-5 lis_~i~0 := 1; 10853#L547-4 assume true; 10823#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 10824#L548-4 assume true; 10888#L548-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; 10885#L549 assume !lis_#t~short11; 10881#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 10882#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 11206#L548-4 assume true; 11205#L548-1 assume !(lis_~j~0 < lis_~i~0); 11204#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 11202#L547-4 assume true; 11200#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 11198#L548-4 assume true; 11196#L548-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; 11193#L549 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; 11190#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 11191#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 11266#L548-4 assume true; 11265#L548-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; 11264#L549 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; 11176#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 11172#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 11173#L548-4 assume true; 11112#L548-1 assume !(lis_~j~0 < lis_~i~0); 11108#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 11109#L547-4 assume true; 10865#L547-1 [2018-11-18 10:49:30,613 INFO L796 eck$LassoCheckResult]: Loop: 10865#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 10909#L548-4 assume true; 10908#L548-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; 10907#L549 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; 10818#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 10819#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 10829#L548-4 assume true; 10831#L548-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; 10902#L549 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; 10896#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 10895#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 10894#L548-4 assume true; 10893#L548-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; 10872#L549 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; 10878#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 10876#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 10874#L548-4 assume true; 10871#L548-1 assume !(lis_~j~0 < lis_~i~0); 10833#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 10834#L547-4 assume true; 10865#L547-1 [2018-11-18 10:49:30,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:49:30,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1014513917, now seen corresponding path program 4 times [2018-11-18 10:49:30,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:49:30,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:49:30,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:30,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:49:30,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:30,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:30,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:30,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:49:30,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1281391120, now seen corresponding path program 6 times [2018-11-18 10:49:30,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:49:30,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:49:30,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:30,660 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:49:30,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:30,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:30,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:30,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:49:30,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1509707790, now seen corresponding path program 5 times [2018-11-18 10:49:30,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:49:30,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:49:30,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:30,680 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:49:30,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:30,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:49:30,776 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 41 proven. 67 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-18 10:49:30,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:49:30,777 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25f04ae1-e643-443a-91ff-e3c00beaa66b/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 10:49:30,783 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 10:49:30,984 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-18 10:49:30,984 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 10:49:30,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:49:31,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 36 [2018-11-18 10:49:31,028 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:31,029 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:31,029 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 10:49:31,030 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:49:31,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 47 [2018-11-18 10:49:31,048 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 38 treesize of output 37 [2018-11-18 10:49:31,049 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:49:31,063 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:31,065 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:31,078 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 82 [2018-11-18 10:49:31,079 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-11-18 10:49:31,104 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 10:49:31,117 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 10:49:31,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 10:49:31,134 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:69, output treesize:113 [2018-11-18 10:49:31,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 77 [2018-11-18 10:49:31,458 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:49:31,459 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:31,460 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:31,461 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:31,462 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:31,464 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:31,465 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:31,467 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:31,472 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:31,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, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 177 [2018-11-18 10:49:31,475 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:49:31,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2018-11-18 10:49:31,511 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:31,512 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:31,514 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:31,515 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:31,516 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:31,517 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:31,517 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:49:31,518 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:31,522 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:31,522 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:31,526 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 181 [2018-11-18 10:49:31,527 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:49:31,541 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:49:31,552 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 10:49:31,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 119 treesize of output 102 [2018-11-18 10:49:31,685 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:31,686 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:31,687 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:31,688 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:31,690 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:31,690 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:49:31,691 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:31,693 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:31,694 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:31,695 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:31,695 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:49:31,698 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 91 treesize of output 229 [2018-11-18 10:49:31,699 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 10:49:31,828 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:31,829 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:31,829 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:49:31,830 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:31,831 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:31,832 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:31,834 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:31,841 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:31,844 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:31,845 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:31,846 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:49:31,859 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 0 new quantified variables, introduced 6 case distinctions, treesize of input 88 treesize of output 254 [2018-11-18 10:49:31,860 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-18 10:49:32,069 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 104 treesize of output 99 [2018-11-18 10:49:32,072 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:32,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-11-18 10:49:32,073 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 10:49:32,088 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:49:32,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 86 [2018-11-18 10:49:32,233 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:32,234 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:32,235 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:32,240 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:32,241 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:32,242 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:32,244 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:32,247 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:32,250 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:32,287 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 4 new quantified variables, introduced 12 case distinctions, treesize of input 74 treesize of output 219 [2018-11-18 10:49:32,295 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 16 xjuncts. [2018-11-18 10:49:32,433 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 10:49:32,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 88 [2018-11-18 10:49:32,441 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:32,442 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:32,443 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:32,444 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:32,445 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:32,446 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:32,446 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:32,447 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:32,449 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:32,450 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:32,451 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:32,452 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:32,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 229 [2018-11-18 10:49:32,459 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-18 10:49:32,491 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:49:32,694 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-18 10:49:32,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, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 83 [2018-11-18 10:49:32,898 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:49:32,899 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:32,900 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:32,901 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:32,903 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:32,904 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:32,905 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:32,908 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:32,911 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:32,915 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 47 treesize of output 182 [2018-11-18 10:49:32,915 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-18 10:49:32,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 57 [2018-11-18 10:49:32,946 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:32,947 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:32,948 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:32,949 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:32,950 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:32,951 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:32,952 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:32,953 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:32,954 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:32,954 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:49:32,955 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:32,959 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:32,962 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 213 [2018-11-18 10:49:32,963 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-18 10:49:32,977 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:49:32,987 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:49:33,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-11-18 10:49:33,086 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 3 variables, input treesize:340, output treesize:517 [2018-11-18 10:49:33,635 WARN L180 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 82 [2018-11-18 10:49:33,648 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 73 proven. 53 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-18 10:49:33,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:49:33,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 17] total 25 [2018-11-18 10:49:34,472 WARN L180 SmtUtils]: Spent 805.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 145 [2018-11-18 10:49:34,629 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2018-11-18 10:49:34,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-18 10:49:34,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2018-11-18 10:49:34,630 INFO L87 Difference]: Start difference. First operand 469 states and 583 transitions. cyclomatic complexity: 125 Second operand 25 states. [2018-11-18 10:49:36,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:49:36,151 INFO L93 Difference]: Finished difference Result 666 states and 821 transitions. [2018-11-18 10:49:36,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-11-18 10:49:36,151 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 666 states and 821 transitions. [2018-11-18 10:49:36,153 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 64 [2018-11-18 10:49:36,154 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 666 states to 615 states and 761 transitions. [2018-11-18 10:49:36,154 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 177 [2018-11-18 10:49:36,154 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 184 [2018-11-18 10:49:36,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 615 states and 761 transitions. [2018-11-18 10:49:36,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:49:36,155 INFO L705 BuchiCegarLoop]: Abstraction has 615 states and 761 transitions. [2018-11-18 10:49:36,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states and 761 transitions. [2018-11-18 10:49:36,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 434. [2018-11-18 10:49:36,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-11-18 10:49:36,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 540 transitions. [2018-11-18 10:49:36,161 INFO L728 BuchiCegarLoop]: Abstraction has 434 states and 540 transitions. [2018-11-18 10:49:36,161 INFO L608 BuchiCegarLoop]: Abstraction has 434 states and 540 transitions. [2018-11-18 10:49:36,161 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-11-18 10:49:36,161 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 434 states and 540 transitions. [2018-11-18 10:49:36,162 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2018-11-18 10:49:36,162 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:49:36,162 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:49:36,163 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:49:36,163 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 10:49:36,163 INFO L794 eck$LassoCheckResult]: Stem: 12266#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12263#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; 12230#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 12231#L558-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; 12246#L545-4 assume true; 12268#L545-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); 12275#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 12276#L545-4 assume true; 12277#L545-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); 12278#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 12269#L545-4 assume true; 12270#L545-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); 12359#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 12358#L545-4 assume true; 12357#L545-1 assume !(lis_~i~0 < lis_~N); 12356#L545-5 lis_~i~0 := 1; 12355#L547-4 assume true; 12354#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 12353#L548-4 assume true; 12352#L548-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; 12302#L549 assume !lis_#t~short11; 12303#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 12294#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 12295#L548-4 assume true; 12289#L548-1 assume !(lis_~j~0 < lis_~i~0); 12290#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 12372#L547-4 assume true; 12371#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 12370#L548-4 assume true; 12369#L548-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; 12367#L549 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; 12368#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 12323#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 12322#L548-4 assume true; 12321#L548-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; 12319#L549 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; 12315#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 12316#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 12348#L548-4 assume true; 12342#L548-1 assume !(lis_~j~0 < lis_~i~0); 12339#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 12340#L547-4 assume true; 12279#L547-1 assume !(lis_~i~0 < lis_~N); 12265#L547-5 lis_~i~0 := 0; 12229#L551-4 [2018-11-18 10:49:36,163 INFO L796 eck$LassoCheckResult]: Loop: 12229#L551-4 assume true; 12240#L551-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); 12267#L552 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; 12228#L551-3 lis_#t~post13 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post13;havoc lis_#t~post13; 12229#L551-4 [2018-11-18 10:49:36,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:49:36,163 INFO L82 PathProgramCache]: Analyzing trace with hash 819049605, now seen corresponding path program 1 times [2018-11-18 10:49:36,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:49:36,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:49:36,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:36,164 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:49:36,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:36,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:49:37,088 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 10:49:37,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:49:37,088 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25f04ae1-e643-443a-91ff-e3c00beaa66b/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 10:49:37,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:49:37,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:49:37,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:49:37,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-18 10:49:37,121 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:37,122 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:37,123 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 10:49:37,123 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:49:37,125 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:49:37,128 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 10:49:37,128 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:8 [2018-11-18 10:49:37,161 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 10:49:37,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-18 10:49:37,163 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:49:37,172 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 10:49:37,175 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 10:49:37,176 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:49:37,183 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:49:37,186 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 10:49:37,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:49:37,191 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:47, output treesize:30 [2018-11-18 10:49:37,236 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 10:49:37,238 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:37,239 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 10:49:37,239 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:49:37,250 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 10:49:37,252 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:37,252 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:37,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 10:49:37,253 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:49:37,259 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:49:37,264 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 10:49:37,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:49:37,269 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:56, output treesize:41 [2018-11-18 10:49:37,422 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:37,424 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 10:49:37,427 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:37,427 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:37,428 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:49:37,429 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:37,432 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:37,433 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 10:49:37,433 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:49:37,451 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:37,451 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 10:49:37,454 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:37,455 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:37,455 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:49:37,456 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:37,456 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:49:37,457 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 10:49:37,457 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:49:37,468 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:49:37,474 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 10:49:37,483 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 10:49:37,484 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:125, output treesize:72 [2018-11-18 10:49:37,604 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 15 proven. 34 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 10:49:37,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:49:37,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 30 [2018-11-18 10:49:37,620 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:49:37,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:49:37,620 INFO L82 PathProgramCache]: Analyzing trace with hash 2991114, now seen corresponding path program 2 times [2018-11-18 10:49:37,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:49:37,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:49:37,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:37,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:49:37,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:37,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:37,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:37,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-18 10:49:37,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=788, Unknown=0, NotChecked=0, Total=870 [2018-11-18 10:49:37,645 INFO L87 Difference]: Start difference. First operand 434 states and 540 transitions. cyclomatic complexity: 116 Second operand 30 states. [2018-11-18 10:49:38,519 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 57 [2018-11-18 10:49:41,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:49:41,518 INFO L93 Difference]: Finished difference Result 934 states and 1169 transitions. [2018-11-18 10:49:41,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-11-18 10:49:41,519 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 934 states and 1169 transitions. [2018-11-18 10:49:41,520 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 120 [2018-11-18 10:49:41,523 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 934 states to 933 states and 1168 transitions. [2018-11-18 10:49:41,524 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 249 [2018-11-18 10:49:41,524 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 250 [2018-11-18 10:49:41,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 933 states and 1168 transitions. [2018-11-18 10:49:41,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:49:41,524 INFO L705 BuchiCegarLoop]: Abstraction has 933 states and 1168 transitions. [2018-11-18 10:49:41,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states and 1168 transitions. [2018-11-18 10:49:41,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 616. [2018-11-18 10:49:41,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2018-11-18 10:49:41,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 780 transitions. [2018-11-18 10:49:41,533 INFO L728 BuchiCegarLoop]: Abstraction has 616 states and 780 transitions. [2018-11-18 10:49:41,533 INFO L608 BuchiCegarLoop]: Abstraction has 616 states and 780 transitions. [2018-11-18 10:49:41,533 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2018-11-18 10:49:41,533 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 616 states and 780 transitions. [2018-11-18 10:49:41,534 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 83 [2018-11-18 10:49:41,534 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:49:41,534 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:49:41,535 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:49:41,535 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 10:49:41,535 INFO L794 eck$LassoCheckResult]: Stem: 13891#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 13887#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; 13858#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 13859#L558-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; 13873#L545-4 assume true; 13893#L545-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); 13905#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 13894#L545-4 assume true; 13895#L545-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); 13903#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 13904#L545-4 assume true; 13879#L545-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); 13880#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 13900#L545-4 assume true; 13901#L545-1 assume !(lis_~i~0 < lis_~N); 13896#L545-5 lis_~i~0 := 1; 13897#L547-4 assume true; 13907#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 14136#L548-4 assume true; 14135#L548-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; 14134#L549 assume !lis_#t~short11; 14133#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 14129#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 14130#L548-4 assume true; 14125#L548-1 assume !(lis_~j~0 < lis_~i~0); 14126#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 14188#L547-4 assume true; 14187#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 14186#L548-4 assume true; 14185#L548-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; 14183#L549 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; 14181#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 14180#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 14179#L548-4 assume true; 14178#L548-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; 14176#L549 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; 14175#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 14110#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 14146#L548-4 assume true; 14100#L548-1 assume !(lis_~j~0 < lis_~i~0); 13881#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 13882#L547-4 assume true; 13906#L547-1 assume !(lis_~i~0 < lis_~N); 13890#L547-5 lis_~i~0 := 0; 13857#L551-4 [2018-11-18 10:49:41,535 INFO L796 eck$LassoCheckResult]: Loop: 13857#L551-4 assume true; 13868#L551-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); 13892#L552 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; 13856#L551-3 lis_#t~post13 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post13;havoc lis_#t~post13; 13857#L551-4 [2018-11-18 10:49:41,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:49:41,535 INFO L82 PathProgramCache]: Analyzing trace with hash 9702979, now seen corresponding path program 2 times [2018-11-18 10:49:41,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:49:41,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:49:41,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:41,536 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:49:41,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:41,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:41,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:41,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:49:41,568 INFO L82 PathProgramCache]: Analyzing trace with hash 2991114, now seen corresponding path program 3 times [2018-11-18 10:49:41,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:49:41,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:49:41,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:41,569 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:49:41,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:41,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:41,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:41,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:49:41,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1605157196, now seen corresponding path program 1 times [2018-11-18 10:49:41,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:49:41,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:49:41,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:41,572 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:49:41,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:41,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:41,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:44,796 WARN L180 SmtUtils]: Spent 3.14 s on a formula simplification. DAG size of input: 309 DAG size of output: 218 [2018-11-18 10:49:45,782 WARN L180 SmtUtils]: Spent 981.00 ms on a formula simplification that was a NOOP. DAG size: 146 [2018-11-18 10:49:45,784 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:49:45,784 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:49:45,784 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:49:45,784 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:49:45,784 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:49:45,784 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:49:45,784 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:49:45,784 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:49:45,784 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-valid-memsafety_true-termination.i_Iteration20_Lasso [2018-11-18 10:49:45,784 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:49:45,784 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:49:45,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 10:49:45,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 10:49:45,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 10:49:45,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 10:49:45,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 10:49:45,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:49:46,951 WARN L180 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 106 [2018-11-18 10:49:47,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 10:49:47,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 10:49:47,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 10:49:47,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 10:49:47,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 10:49:47,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 10:49:47,032 INFO 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 10:49:47,033 INFO 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 10:49:47,034 INFO 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 10:49:47,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 10:49:47,037 INFO 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 10:49:47,038 INFO 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 10:49:47,038 INFO 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 10:49:47,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 10:49:47,377 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:49:47,378 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:49:47,378 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 10:49:47,378 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:47,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:47,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:47,379 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:47,379 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:49:47,379 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:49:47,380 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:47,380 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 10:49:47,380 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:47,381 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:49:47,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:47,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:47,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:47,381 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:49:47,381 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:49:47,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:47,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 10:49:47,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:47,382 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:49:47,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:47,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:47,382 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:47,383 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:49:47,383 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:49:47,383 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:47,383 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 10:49:47,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:47,384 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:49:47,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:47,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:47,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:47,384 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:49:47,384 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:49:47,385 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:47,385 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 10:49:47,385 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:47,385 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:49:47,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:47,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:47,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:47,386 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:49:47,386 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:49:47,386 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:47,386 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 10:49:47,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:47,387 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 10:49:47,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:47,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:47,388 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:49:47,388 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:49:47,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:47,392 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 10:49:47,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:47,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:47,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:47,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:47,393 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:49:47,393 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:49:47,394 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:47,394 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 10:49:47,395 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:47,395 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:47,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:47,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:47,395 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:49:47,396 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:49:47,397 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:47,397 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 10:49:47,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:47,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:47,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:47,398 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:47,399 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:49:47,399 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:49:47,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:47,417 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 10:49:47,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:47,418 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:49:47,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:47,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:47,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:47,418 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:49:47,418 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:49:47,419 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:47,419 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 10:49:47,419 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:47,419 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:47,419 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:47,419 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:47,420 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:49:47,420 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:49:47,421 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:47,421 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 10:49:47,422 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:47,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:47,422 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:47,422 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:47,422 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:49:47,423 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:49:47,423 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:47,424 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 10:49:47,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:47,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:47,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:47,424 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:47,425 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:49:47,425 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:49:47,426 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:47,426 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 10:49:47,426 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:47,427 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 10:49:47,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:47,427 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:47,427 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:49:47,428 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:49:47,429 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:49:47,430 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 10:49:47,430 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:49:47,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:49:47,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:49:47,430 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:49:47,433 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:49:47,433 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:49:47,452 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 10:49:47,468 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-18 10:49:47,468 INFO L444 ModelExtractionUtils]: 49 out of 55 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-18 10:49:47,468 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 10:49:47,469 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 10:49:47,469 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 10:49:47,469 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 10:49:47,814 INFO L297 tatePredicateManager]: 74 out of 74 supporting invariants were superfluous and have been removed [2018-11-18 10:49:47,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:49:47,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:49:47,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:49:47,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:49:47,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:49:47,850 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 10:49:47,850 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 10:49:47,850 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 616 states and 780 transitions. cyclomatic complexity: 179 Second operand 4 states. [2018-11-18 10:49:47,860 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 616 states and 780 transitions. cyclomatic complexity: 179. Second operand 4 states. Result 620 states and 786 transitions. Complement of second has 6 states. [2018-11-18 10:49:47,861 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 10:49:47,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 10:49:47,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2018-11-18 10:49:47,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 44 letters. Loop has 4 letters. [2018-11-18 10:49:47,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:49:47,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 48 letters. Loop has 4 letters. [2018-11-18 10:49:47,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:49:47,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 44 letters. Loop has 8 letters. [2018-11-18 10:49:47,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:49:47,862 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 620 states and 786 transitions. [2018-11-18 10:49:47,864 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 79 [2018-11-18 10:49:47,866 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 620 states to 469 states and 600 transitions. [2018-11-18 10:49:47,866 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 137 [2018-11-18 10:49:47,866 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 137 [2018-11-18 10:49:47,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 469 states and 600 transitions. [2018-11-18 10:49:47,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:49:47,867 INFO L705 BuchiCegarLoop]: Abstraction has 469 states and 600 transitions. [2018-11-18 10:49:47,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states and 600 transitions. [2018-11-18 10:49:47,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 332. [2018-11-18 10:49:47,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-11-18 10:49:47,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 417 transitions. [2018-11-18 10:49:47,872 INFO L728 BuchiCegarLoop]: Abstraction has 332 states and 417 transitions. [2018-11-18 10:49:47,872 INFO L608 BuchiCegarLoop]: Abstraction has 332 states and 417 transitions. [2018-11-18 10:49:47,872 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2018-11-18 10:49:47,872 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 332 states and 417 transitions. [2018-11-18 10:49:47,873 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 50 [2018-11-18 10:49:47,873 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:49:47,873 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:49:47,873 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-18 10:49:47,873 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 3, 3, 1, 1, 1, 1] [2018-11-18 10:49:47,873 INFO L794 eck$LassoCheckResult]: Stem: 15587#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 15584#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; 15555#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 15556#L558-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; 15569#L545-4 assume true; 15579#L545-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); 15580#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 15588#L545-4 assume true; 15589#L545-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); 15585#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 15586#L545-4 assume true; 15599#L545-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); 15598#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 15597#L545-4 assume true; 15595#L545-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); 15596#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 15594#L545-4 assume true; 15577#L545-1 assume !(lis_~i~0 < lis_~N); 15578#L545-5 lis_~i~0 := 1; 15590#L547-4 assume true; 15612#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 15611#L548-4 assume true; 15610#L548-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; 15609#L549 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; 15605#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 15606#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 15616#L548-4 assume true; 15617#L548-1 assume !(lis_~j~0 < lis_~i~0); 15668#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 15666#L547-4 assume true; 15667#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 15662#L548-4 assume true; 15663#L548-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; 15657#L549 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; 15658#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 15652#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 15653#L548-4 assume true; 15648#L548-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; 15649#L549 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; 15868#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 15866#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 15865#L548-4 assume true; 15811#L548-1 assume !(lis_~j~0 < lis_~i~0); 15808#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 15809#L547-4 assume true; 15565#L547-1 [2018-11-18 10:49:47,874 INFO L796 eck$LassoCheckResult]: Loop: 15565#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 15566#L548-4 assume true; 15557#L548-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; 15558#L549 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; 15591#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 15562#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 15570#L548-4 assume true; 15572#L548-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; 15673#L549 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; 15625#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 15624#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 15623#L548-4 assume true; 15615#L548-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; 15614#L549 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; 15607#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 15604#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 15602#L548-4 assume true; 15603#L548-1 assume !(lis_~j~0 < lis_~i~0); 15573#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 15574#L547-4 assume true; 15565#L547-1 [2018-11-18 10:49:47,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:49:47,874 INFO L82 PathProgramCache]: Analyzing trace with hash -411150614, now seen corresponding path program 7 times [2018-11-18 10:49:47,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:49:47,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:49:47,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:47,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:49:47,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:47,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:47,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:47,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:49:47,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1281391120, now seen corresponding path program 7 times [2018-11-18 10:49:47,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:49:47,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:49:47,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:47,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:49:47,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:47,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:47,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:47,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:49:47,930 INFO L82 PathProgramCache]: Analyzing trace with hash -909226407, now seen corresponding path program 8 times [2018-11-18 10:49:47,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:49:47,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:49:47,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:47,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:49:47,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:49:47,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:48,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:49:48,873 WARN L180 SmtUtils]: Spent 865.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 145 [2018-11-18 10:49:49,007 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2018-11-18 10:50:01,105 WARN L180 SmtUtils]: Spent 12.10 s on a formula simplification. DAG size of input: 375 DAG size of output: 255 [2018-11-18 10:50:04,939 WARN L180 SmtUtils]: Spent 3.83 s on a formula simplification that was a NOOP. DAG size: 172 [2018-11-18 10:50:04,942 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:50:04,942 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:50:04,942 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:50:04,942 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:50:04,942 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:50:04,942 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:50:04,942 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:50:04,942 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:50:04,943 INFO L131 ssoRankerPreferences]: Filename of dumped script: lis-alloca_true-valid-memsafety_true-termination.i_Iteration21_Lasso [2018-11-18 10:50:04,943 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:50:04,943 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:50:04,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:50:04,949 INFO 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 10:50:11,379 WARN L180 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 213 DAG size of output: 132 [2018-11-18 10:50:12,000 WARN L180 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 245 DAG size of output: 137 [2018-11-18 10:50:12,001 INFO 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 10:50:12,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 10:50:12,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 10:50:12,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 10:50:12,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 10:50:12,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 10:50:12,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 10:50:12,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 10:50:12,009 INFO 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 10:50:12,009 INFO 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 10:50:12,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:50:12,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:50:12,012 INFO 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 10:50:12,013 INFO 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 10:50:12,013 INFO 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 10:50:12,014 INFO 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 10:50:12,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 10:50:12,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 10:50:12,164 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 82 [2018-11-18 10:50:12,559 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:50:12,559 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:50:12,559 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 10:50:12,560 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:50:12,560 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:12,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:12,560 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:50:12,560 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:50:12,560 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:50:12,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:12,561 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:12,561 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:50:12,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:12,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:12,561 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:50:12,562 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:50:12,562 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:50:12,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:12,567 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 10:50:12,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:50:12,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:12,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:12,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:50:12,571 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:50:12,571 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:50:12,600 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 10:50:12,628 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-18 10:50:12,628 INFO L444 ModelExtractionUtils]: 62 out of 70 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-18 10:50:12,629 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 10:50:12,629 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 10:50:12,629 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 10:50:12,630 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~i~0, v_rep(select #length ULTIMATE.start_main_#t~malloc17.base)_7) = -32*ULTIMATE.start_lis_~i~0 + 7*v_rep(select #length ULTIMATE.start_main_#t~malloc17.base)_7 Supporting invariants [] [2018-11-18 10:50:13,208 INFO L297 tatePredicateManager]: 131 out of 132 supporting invariants were superfluous and have been removed [2018-11-18 10:50:13,209 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 10:50:13,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:50:13,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:50:13,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:50:13,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:50:13,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:50:13,360 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 10:50:13,360 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 8 loop predicates [2018-11-18 10:50:13,360 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 332 states and 417 transitions. cyclomatic complexity: 92 Second operand 10 states. [2018-11-18 10:50:13,556 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 332 states and 417 transitions. cyclomatic complexity: 92. Second operand 10 states. Result 801 states and 1034 transitions. Complement of second has 21 states. [2018-11-18 10:50:13,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 2 stem states 9 non-accepting loop states 1 accepting loop states [2018-11-18 10:50:13,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-18 10:50:13,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 58 transitions. [2018-11-18 10:50:13,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 58 transitions. Stem has 45 letters. Loop has 20 letters. [2018-11-18 10:50:13,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:50:13,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 58 transitions. Stem has 65 letters. Loop has 20 letters. [2018-11-18 10:50:13,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:50:13,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 58 transitions. Stem has 45 letters. Loop has 40 letters. [2018-11-18 10:50:13,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:50:13,558 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 801 states and 1034 transitions. [2018-11-18 10:50:13,560 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 70 [2018-11-18 10:50:13,562 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 801 states to 497 states and 648 transitions. [2018-11-18 10:50:13,562 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 87 [2018-11-18 10:50:13,562 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2018-11-18 10:50:13,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 497 states and 648 transitions. [2018-11-18 10:50:13,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:50:13,563 INFO L705 BuchiCegarLoop]: Abstraction has 497 states and 648 transitions. [2018-11-18 10:50:13,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states and 648 transitions. [2018-11-18 10:50:13,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 417. [2018-11-18 10:50:13,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-11-18 10:50:13,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 532 transitions. [2018-11-18 10:50:13,568 INFO L728 BuchiCegarLoop]: Abstraction has 417 states and 532 transitions. [2018-11-18 10:50:13,568 INFO L608 BuchiCegarLoop]: Abstraction has 417 states and 532 transitions. [2018-11-18 10:50:13,568 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ [2018-11-18 10:50:13,569 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 417 states and 532 transitions. [2018-11-18 10:50:13,570 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 62 [2018-11-18 10:50:13,570 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:50:13,570 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:50:13,571 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-18 10:50:13,571 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1] [2018-11-18 10:50:13,571 INFO L794 eck$LassoCheckResult]: Stem: 17506#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 17503#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; 17471#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 17472#L558-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; 17486#L545-4 assume true; 17496#L545-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); 17497#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 17507#L545-4 assume true; 17508#L545-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); 17504#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 17505#L545-4 assume true; 17517#L545-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); 17516#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 17515#L545-4 assume true; 17513#L545-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); 17514#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 17512#L545-4 assume true; 17494#L545-1 assume !(lis_~i~0 < lis_~N); 17495#L545-5 lis_~i~0 := 1; 17500#L547-4 assume true; 17481#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 17482#L548-4 assume true; 17630#L548-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; 17628#L549 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; 17625#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 17626#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 17621#L548-4 assume true; 17622#L548-1 assume !(lis_~j~0 < lis_~i~0); 17616#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 17617#L547-4 assume true; 17612#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 17613#L548-4 assume true; 17608#L548-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; 17609#L549 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; 17602#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 17603#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 17591#L548-4 assume true; 17592#L548-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; 17580#L549 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; 17581#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 17652#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 17881#L548-4 assume true; 17791#L548-1 assume !(lis_~j~0 < lis_~i~0); 17790#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 17635#L547-4 assume true; 17569#L547-1 [2018-11-18 10:50:13,571 INFO L796 eck$LassoCheckResult]: Loop: 17569#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 17566#L548-4 assume true; 17563#L548-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; 17509#L549 assume !lis_#t~short11; 17473#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 17474#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 17487#L548-4 assume true; 17477#L548-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; 17478#L549 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; 17547#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 17545#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 17595#L548-4 assume true; 17594#L548-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; 17593#L549 assume !lis_#t~short11; 17537#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 17536#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 17531#L548-4 assume true; 17532#L548-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; 17586#L549 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; 17525#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 17526#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 17521#L548-4 assume true; 17522#L548-1 assume !(lis_~j~0 < lis_~i~0); 17490#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 17491#L547-4 assume true; 17569#L547-1 [2018-11-18 10:50:13,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:50:13,571 INFO L82 PathProgramCache]: Analyzing trace with hash -411150614, now seen corresponding path program 9 times [2018-11-18 10:50:13,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:50:13,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:50:13,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:50:13,572 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:50:13,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:50:13,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:50:13,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:50:13,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:50:13,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1161572636, now seen corresponding path program 4 times [2018-11-18 10:50:13,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:50:13,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:50:13,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:50:13,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:50:13,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:50:13,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:50:13,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:50:13,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:50:13,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1304354843, now seen corresponding path program 6 times [2018-11-18 10:50:13,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:50:13,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:50:13,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:50:13,626 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:50:13,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:50:13,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:50:13,713 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 56 proven. 98 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-18 10:50:13,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:50:13,713 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25f04ae1-e643-443a-91ff-e3c00beaa66b/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 10:50:13,723 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 10:50:13,884 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-18 10:50:13,884 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 10:50:13,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:50:13,938 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 62 proven. 92 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-18 10:50:13,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:50:13,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-11-18 10:50:14,406 WARN L180 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 140 [2018-11-18 10:50:14,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-18 10:50:14,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2018-11-18 10:50:14,501 INFO L87 Difference]: Start difference. First operand 417 states and 532 transitions. cyclomatic complexity: 124 Second operand 17 states. [2018-11-18 10:50:14,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:50:14,679 INFO L93 Difference]: Finished difference Result 649 states and 828 transitions. [2018-11-18 10:50:14,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-18 10:50:14,679 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 649 states and 828 transitions. [2018-11-18 10:50:14,681 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 62 [2018-11-18 10:50:14,682 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 649 states to 594 states and 757 transitions. [2018-11-18 10:50:14,683 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2018-11-18 10:50:14,683 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2018-11-18 10:50:14,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 594 states and 757 transitions. [2018-11-18 10:50:14,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:50:14,683 INFO L705 BuchiCegarLoop]: Abstraction has 594 states and 757 transitions. [2018-11-18 10:50:14,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states and 757 transitions. [2018-11-18 10:50:14,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 582. [2018-11-18 10:50:14,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2018-11-18 10:50:14,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 743 transitions. [2018-11-18 10:50:14,690 INFO L728 BuchiCegarLoop]: Abstraction has 582 states and 743 transitions. [2018-11-18 10:50:14,690 INFO L608 BuchiCegarLoop]: Abstraction has 582 states and 743 transitions. [2018-11-18 10:50:14,690 INFO L442 BuchiCegarLoop]: ======== Iteration 23============ [2018-11-18 10:50:14,690 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 582 states and 743 transitions. [2018-11-18 10:50:14,691 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 62 [2018-11-18 10:50:14,691 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:50:14,691 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:50:14,692 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-18 10:50:14,692 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1] [2018-11-18 10:50:14,692 INFO L794 eck$LassoCheckResult]: Stem: 18822#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 18819#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; 18788#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 18789#L558-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; 18803#L545-4 assume true; 18823#L545-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); 18820#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 18821#L545-4 assume true; 18815#L545-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); 18816#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 18835#L545-4 assume true; 18834#L545-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); 18833#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 18832#L545-4 assume true; 18830#L545-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); 18831#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 18829#L545-4 assume true; 18813#L545-1 assume !(lis_~i~0 < lis_~N); 18814#L545-5 lis_~i~0 := 1; 18817#L547-4 assume true; 18798#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 18800#L548-4 assume true; 19182#L548-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; 19181#L549 assume !lis_#t~short11; 19180#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 19179#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 19178#L548-4 assume true; 19177#L548-1 assume !(lis_~j~0 < lis_~i~0); 19175#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 19174#L547-4 assume true; 19173#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 19172#L548-4 assume true; 19171#L548-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; 19170#L549 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; 19167#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 19168#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 19165#L548-4 assume true; 19163#L548-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; 19164#L549 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; 19159#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 19158#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 19157#L548-4 assume true; 19156#L548-1 assume !(lis_~j~0 < lis_~i~0); 19154#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 19153#L547-4 assume true; 19152#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 19151#L548-4 assume true; 19150#L548-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; 19148#L549 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; 19147#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 19146#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 19145#L548-4 assume true; 19144#L548-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; 19142#L549 assume !lis_#t~short11; 19143#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 18975#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 19226#L548-4 assume true; 19227#L548-1 assume !(lis_~j~0 < lis_~i~0); 19218#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 18895#L547-4 assume true; 18873#L547-1 [2018-11-18 10:50:14,692 INFO L796 eck$LassoCheckResult]: Loop: 18873#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 18870#L548-4 assume true; 18869#L548-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; 18824#L549 assume !lis_#t~short11; 18790#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 18791#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 18804#L548-4 assume true; 18867#L548-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; 18868#L549 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; 18856#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 18855#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 18854#L548-4 assume true; 18853#L548-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; 18852#L549 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; 18849#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 18850#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 18845#L548-4 assume true; 18846#L548-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; 18838#L549 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; 18841#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 18840#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 18839#L548-4 assume true; 18836#L548-1 assume !(lis_~j~0 < lis_~i~0); 18837#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 18874#L547-4 assume true; 18873#L547-1 [2018-11-18 10:50:14,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:50:14,692 INFO L82 PathProgramCache]: Analyzing trace with hash 766131037, now seen corresponding path program 7 times [2018-11-18 10:50:14,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:50:14,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:50:14,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:50:14,693 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:50:14,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:50:14,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:50:14,759 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 51 proven. 39 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-18 10:50:14,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:50:14,759 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25f04ae1-e643-443a-91ff-e3c00beaa66b/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 10:50:14,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:50:14,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:50:14,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:50:14,818 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 78 proven. 9 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-18 10:50:14,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:50:14,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2018-11-18 10:50:14,833 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:50:14,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:50:14,833 INFO L82 PathProgramCache]: Analyzing trace with hash -2120802652, now seen corresponding path program 5 times [2018-11-18 10:50:14,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:50:14,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:50:14,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:50:14,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:50:14,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:50:14,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:50:14,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:50:16,213 WARN L180 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 216 DAG size of output: 159 [2018-11-18 10:50:16,384 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2018-11-18 10:50:16,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-18 10:50:16,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2018-11-18 10:50:16,385 INFO L87 Difference]: Start difference. First operand 582 states and 743 transitions. cyclomatic complexity: 170 Second operand 17 states. [2018-11-18 10:50:16,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:50:16,606 INFO L93 Difference]: Finished difference Result 602 states and 757 transitions. [2018-11-18 10:50:16,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 10:50:16,606 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 602 states and 757 transitions. [2018-11-18 10:50:16,608 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 62 [2018-11-18 10:50:16,609 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 602 states to 300 states and 371 transitions. [2018-11-18 10:50:16,609 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2018-11-18 10:50:16,609 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2018-11-18 10:50:16,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 300 states and 371 transitions. [2018-11-18 10:50:16,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:50:16,609 INFO L705 BuchiCegarLoop]: Abstraction has 300 states and 371 transitions. [2018-11-18 10:50:16,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states and 371 transitions. [2018-11-18 10:50:16,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 285. [2018-11-18 10:50:16,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-11-18 10:50:16,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 354 transitions. [2018-11-18 10:50:16,613 INFO L728 BuchiCegarLoop]: Abstraction has 285 states and 354 transitions. [2018-11-18 10:50:16,613 INFO L608 BuchiCegarLoop]: Abstraction has 285 states and 354 transitions. [2018-11-18 10:50:16,613 INFO L442 BuchiCegarLoop]: ======== Iteration 24============ [2018-11-18 10:50:16,614 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 285 states and 354 transitions. [2018-11-18 10:50:16,614 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 62 [2018-11-18 10:50:16,614 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:50:16,614 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:50:16,615 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 6, 6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2018-11-18 10:50:16,615 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 4, 4, 4, 4, 1, 1, 1, 1] [2018-11-18 10:50:16,615 INFO L794 eck$LassoCheckResult]: Stem: 20222#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 20219#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; 20189#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 20190#L558-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; 20204#L545-4 assume true; 20210#L545-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); 20211#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 20223#L545-4 assume true; 20224#L545-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); 20220#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 20221#L545-4 assume true; 20234#L545-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); 20233#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 20232#L545-4 assume true; 20230#L545-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); 20231#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 20229#L545-4 assume true; 20208#L545-1 assume !(lis_~i~0 < lis_~N); 20209#L545-5 lis_~i~0 := 1; 20216#L547-4 assume true; 20199#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 20200#L548-4 assume true; 20412#L548-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; 20410#L549 assume !lis_#t~short11; 20408#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 20403#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 20404#L548-4 assume true; 20397#L548-1 assume !(lis_~j~0 < lis_~i~0); 20398#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 20423#L547-4 assume true; 20202#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 20203#L548-4 assume true; 20429#L548-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; 20430#L549 assume !lis_#t~short11; 20193#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 20194#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 20206#L548-4 assume true; 20197#L548-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; 20198#L549 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; 20227#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 20421#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 20419#L548-4 assume true; 20416#L548-1 assume !(lis_~j~0 < lis_~i~0); 20417#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 20471#L547-4 assume true; 20470#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 20469#L548-4 assume true; 20468#L548-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; 20467#L549 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; 20466#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 20351#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 20465#L548-4 assume true; 20464#L548-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; 20463#L549 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; 20462#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 20317#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 20318#L548-4 assume true; 20311#L548-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; 20312#L549 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; 20301#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 20299#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 20297#L548-4 assume true; 20279#L548-1 assume !(lis_~j~0 < lis_~i~0); 20276#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 20271#L547-4 assume true; 20269#L547-1 [2018-11-18 10:50:16,615 INFO L796 eck$LassoCheckResult]: Loop: 20269#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 20267#L548-4 assume true; 20266#L548-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; 20225#L549 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; 20226#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 20192#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 20205#L548-4 assume true; 20207#L548-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; 20258#L549 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; 20256#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 20255#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 20254#L548-4 assume true; 20253#L548-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; 20252#L549 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; 20250#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 20249#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 20248#L548-4 assume true; 20247#L548-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; 20237#L549 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; 20245#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 20240#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 20241#L548-4 assume true; 20235#L548-1 assume !(lis_~j~0 < lis_~i~0); 20236#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 20273#L547-4 assume true; 20269#L547-1 [2018-11-18 10:50:16,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:50:16,616 INFO L82 PathProgramCache]: Analyzing trace with hash 538220437, now seen corresponding path program 3 times [2018-11-18 10:50:16,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:50:16,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:50:16,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:50:16,616 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:50:16,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:50:16,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:50:17,387 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 39 proven. 114 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 10:50:17,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:50:17,388 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25f04ae1-e643-443a-91ff-e3c00beaa66b/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 10:50:17,398 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 10:50:17,430 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-18 10:50:17,430 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 10:50:17,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:50:17,440 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:50:17,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 10:50:17,451 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:50:17,451 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:50:17,452 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 10:50:17,452 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:50:17,455 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:50:17,464 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 10:50:17,464 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:11 [2018-11-18 10:50:17,513 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 10:50:17,515 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 10:50:17,515 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:50:17,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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 10:50:17,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-18 10:50:17,524 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:50:17,528 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:50:17,531 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 10:50:17,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:50:17,537 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:50, output treesize:33 [2018-11-18 10:50:17,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, 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 10:50:17,584 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:50:17,585 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 10:50:17,585 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:50:17,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 45 treesize of output 44 [2018-11-18 10:50:17,598 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:50:17,599 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:50:17,599 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 10:50:17,600 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:50:17,607 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:50:17,611 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 10:50:17,619 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 10:50:17,619 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:68, output treesize:51 [2018-11-18 10:50:17,923 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 26 proven. 93 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-18 10:50:17,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:50:17,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15] total 33 [2018-11-18 10:50:17,939 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:50:17,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:50:17,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1532608100, now seen corresponding path program 8 times [2018-11-18 10:50:17,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:50:17,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:50:17,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:50:17,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:50:17,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:50:17,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:50:17,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:50:20,565 WARN L180 SmtUtils]: Spent 2.60 s on a formula simplification. DAG size of input: 250 DAG size of output: 180 [2018-11-18 10:50:21,001 WARN L180 SmtUtils]: Spent 429.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-11-18 10:50:21,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-18 10:50:21,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=946, Unknown=0, NotChecked=0, Total=1056 [2018-11-18 10:50:21,002 INFO L87 Difference]: Start difference. First operand 285 states and 354 transitions. cyclomatic complexity: 74 Second operand 33 states. [2018-11-18 10:50:23,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:50:23,116 INFO L93 Difference]: Finished difference Result 550 states and 660 transitions. [2018-11-18 10:50:23,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-18 10:50:23,116 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 550 states and 660 transitions. [2018-11-18 10:50:23,118 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 67 [2018-11-18 10:50:23,119 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 550 states to 525 states and 634 transitions. [2018-11-18 10:50:23,119 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 107 [2018-11-18 10:50:23,120 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 107 [2018-11-18 10:50:23,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 525 states and 634 transitions. [2018-11-18 10:50:23,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:50:23,120 INFO L705 BuchiCegarLoop]: Abstraction has 525 states and 634 transitions. [2018-11-18 10:50:23,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states and 634 transitions. [2018-11-18 10:50:23,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 419. [2018-11-18 10:50:23,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-11-18 10:50:23,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 517 transitions. [2018-11-18 10:50:23,125 INFO L728 BuchiCegarLoop]: Abstraction has 419 states and 517 transitions. [2018-11-18 10:50:23,125 INFO L608 BuchiCegarLoop]: Abstraction has 419 states and 517 transitions. [2018-11-18 10:50:23,125 INFO L442 BuchiCegarLoop]: ======== Iteration 25============ [2018-11-18 10:50:23,125 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 419 states and 517 transitions. [2018-11-18 10:50:23,126 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 67 [2018-11-18 10:50:23,126 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:50:23,126 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:50:23,126 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-18 10:50:23,126 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1] [2018-11-18 10:50:23,126 INFO L794 eck$LassoCheckResult]: Stem: 21349#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 21346#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; 21314#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 21315#L558-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; 21329#L545-4 assume true; 21350#L545-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); 21347#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 21348#L545-4 assume true; 21334#L545-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); 21335#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 21365#L545-4 assume true; 21364#L545-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); 21363#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 21361#L545-4 assume true; 21362#L545-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); 21358#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 21359#L545-4 assume true; 21332#L545-1 assume !(lis_~i~0 < lis_~N); 21333#L545-5 lis_~i~0 := 1; 21465#L547-4 assume true; 21466#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 21525#L548-4 assume true; 21524#L548-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; 21523#L549 assume !lis_#t~short11; 21522#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 21521#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 21520#L548-4 assume true; 21519#L548-1 assume !(lis_~j~0 < lis_~i~0); 21518#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 21516#L547-4 assume true; 21514#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 21512#L548-4 assume true; 21510#L548-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; 21507#L549 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; 21508#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 21670#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 21669#L548-4 assume true; 21668#L548-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; 21667#L549 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; 21659#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 21658#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 21657#L548-4 assume true; 21656#L548-1 assume !(lis_~j~0 < lis_~i~0); 21647#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 21644#L547-4 assume true; 21643#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 21642#L548-4 assume true; 21641#L548-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; 21638#L549 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; 21639#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 21666#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 21665#L548-4 assume true; 21664#L548-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; 21663#L549 assume !lis_#t~short11; 21615#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 21612#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 21611#L548-4 assume true; 21610#L548-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; 21609#L549 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; 21607#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 21605#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 21604#L548-4 assume true; 21478#L548-1 assume !(lis_~j~0 < lis_~i~0); 21468#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 21467#L547-4 assume true; 21344#L547-1 [2018-11-18 10:50:23,127 INFO L796 eck$LassoCheckResult]: Loop: 21344#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 21448#L548-4 assume true; 21316#L548-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; 21317#L549 assume !lis_#t~short11; 21320#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 21321#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 21330#L548-4 assume true; 21439#L548-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; 21438#L549 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; 21433#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 21434#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 21427#L548-4 assume true; 21428#L548-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; 21420#L549 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; 21421#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 21415#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 21459#L548-4 assume true; 21458#L548-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; 21377#L549 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; 21456#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 21369#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 21370#L548-4 assume true; 21376#L548-1 assume !(lis_~j~0 < lis_~i~0); 21340#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 21341#L547-4 assume true; 21344#L547-1 [2018-11-18 10:50:23,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:50:23,127 INFO L82 PathProgramCache]: Analyzing trace with hash 841094741, now seen corresponding path program 8 times [2018-11-18 10:50:23,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:50:23,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:50:23,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:50:23,128 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:50:23,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:50:23,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:50:24,148 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 35 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:50:24,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:50:24,148 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25f04ae1-e643-443a-91ff-e3c00beaa66b/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 10:50:24,157 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 10:50:24,179 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 10:50:24,179 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 10:50:24,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:50:24,188 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:50:24,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 10:50:24,197 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:50:24,197 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:50:24,198 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 10:50:24,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:50:24,201 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:50:24,205 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 10:50:24,205 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:11 [2018-11-18 10:50:24,327 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 10:50:24,329 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:50:24,332 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:50:24,333 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 10:50:24,333 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:50:24,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, 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 10:50:24,344 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 10:50:24,344 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:50:24,349 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:50:24,352 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 10:50:24,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:50:24,359 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:62, output treesize:39 [2018-11-18 10:50:24,474 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 10:50:24,478 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:50:24,479 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:50:24,480 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:50:24,481 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:50:24,482 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:50:24,483 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:50:24,484 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:50:24,484 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 10:50:24,485 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:50:24,505 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 10:50:24,507 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:50:24,507 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 10:50:24,508 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:50:24,517 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:50:24,523 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 10:50:24,534 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 10:50:24,534 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:97, output treesize:74 [2018-11-18 10:50:24,690 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 26 proven. 117 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-18 10:50:24,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:50:24,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 14] total 36 [2018-11-18 10:50:24,715 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:50:24,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:50:24,715 INFO L82 PathProgramCache]: Analyzing trace with hash -2120802652, now seen corresponding path program 6 times [2018-11-18 10:50:24,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:50:24,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:50:24,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:50:24,716 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:50:24,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:50:24,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:50:24,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:50:25,739 WARN L180 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 220 DAG size of output: 160 [2018-11-18 10:50:25,882 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2018-11-18 10:50:25,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-18 10:50:25,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1121, Unknown=0, NotChecked=0, Total=1260 [2018-11-18 10:50:25,883 INFO L87 Difference]: Start difference. First operand 419 states and 517 transitions. cyclomatic complexity: 106 Second operand 36 states. [2018-11-18 10:50:28,248 WARN L180 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 86 DAG size of output: 46 [2018-11-18 10:50:29,037 WARN L180 SmtUtils]: Spent 736.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 44 [2018-11-18 10:50:30,013 WARN L180 SmtUtils]: Spent 767.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 45 [2018-11-18 10:50:30,815 WARN L180 SmtUtils]: Spent 650.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 46 [2018-11-18 10:50:32,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:50:32,084 INFO L93 Difference]: Finished difference Result 600 states and 742 transitions. [2018-11-18 10:50:32,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-11-18 10:50:32,084 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 600 states and 742 transitions. [2018-11-18 10:50:32,086 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 123 [2018-11-18 10:50:32,087 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 600 states to 600 states and 742 transitions. [2018-11-18 10:50:32,087 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 160 [2018-11-18 10:50:32,088 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 160 [2018-11-18 10:50:32,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 600 states and 742 transitions. [2018-11-18 10:50:32,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:50:32,088 INFO L705 BuchiCegarLoop]: Abstraction has 600 states and 742 transitions. [2018-11-18 10:50:32,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states and 742 transitions. [2018-11-18 10:50:32,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 539. [2018-11-18 10:50:32,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-11-18 10:50:32,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 672 transitions. [2018-11-18 10:50:32,094 INFO L728 BuchiCegarLoop]: Abstraction has 539 states and 672 transitions. [2018-11-18 10:50:32,094 INFO L608 BuchiCegarLoop]: Abstraction has 539 states and 672 transitions. [2018-11-18 10:50:32,094 INFO L442 BuchiCegarLoop]: ======== Iteration 26============ [2018-11-18 10:50:32,094 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 539 states and 672 transitions. [2018-11-18 10:50:32,095 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 107 [2018-11-18 10:50:32,095 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:50:32,095 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:50:32,096 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2018-11-18 10:50:32,096 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1] [2018-11-18 10:50:32,096 INFO L794 eck$LassoCheckResult]: Stem: 22684#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 22681#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; 22650#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 22651#L558-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; 22665#L545-4 assume true; 22676#L545-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); 22677#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 22685#L545-4 assume true; 22686#L545-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); 22682#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 22683#L545-4 assume true; 22701#L545-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); 22700#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 22698#L545-4 assume true; 22699#L545-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); 22695#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 22696#L545-4 assume true; 22674#L545-1 assume !(lis_~i~0 < lis_~N); 22675#L545-5 lis_~i~0 := 1; 22805#L547-4 assume true; 22804#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 22803#L548-4 assume true; 22802#L548-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; 22801#L549 assume !lis_#t~short11; 22800#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 22799#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 22798#L548-4 assume true; 22797#L548-1 assume !(lis_~j~0 < lis_~i~0); 22796#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 22794#L547-4 assume true; 22792#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 22790#L548-4 assume true; 22788#L548-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; 22785#L549 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; 22786#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 22959#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 23188#L548-4 assume true; 23187#L548-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; 23186#L549 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; 22930#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 22929#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 22928#L548-4 assume true; 22927#L548-1 assume !(lis_~j~0 < lis_~i~0); 22926#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 22925#L547-4 assume true; 22924#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 22923#L548-4 assume true; 22922#L548-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; 22921#L549 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; 22920#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 22919#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 22918#L548-4 assume true; 22917#L548-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; 22915#L549 assume !lis_#t~short11; 22916#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 22910#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 22911#L548-4 assume true; 22902#L548-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; 22903#L549 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; 22866#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 22863#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 22860#L548-4 assume true; 22857#L548-1 assume !(lis_~j~0 < lis_~i~0); 22836#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 22833#L547-4 assume true; 22831#L547-1 [2018-11-18 10:50:32,096 INFO L796 eck$LassoCheckResult]: Loop: 22831#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 22830#L548-4 assume true; 22829#L548-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; 22827#L549 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; 22825#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 22824#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 22823#L548-4 assume true; 22822#L548-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; 22820#L549 assume !lis_#t~short11; 22819#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 22818#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 22817#L548-4 assume true; 22816#L548-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; 22813#L549 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; 22814#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 22845#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 22844#L548-4 assume true; 22843#L548-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; 22838#L549 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; 22841#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 22840#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 22839#L548-4 assume true; 22837#L548-1 assume !(lis_~j~0 < lis_~i~0); 22835#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 22832#L547-4 assume true; 22831#L547-1 [2018-11-18 10:50:32,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:50:32,097 INFO L82 PathProgramCache]: Analyzing trace with hash 783836439, now seen corresponding path program 9 times [2018-11-18 10:50:32,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:50:32,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:50:32,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:50:32,097 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:50:32,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:50:32,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:50:32,752 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 70 proven. 79 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-18 10:50:32,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:50:32,752 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25f04ae1-e643-443a-91ff-e3c00beaa66b/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 10:50:32,761 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 10:50:32,844 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-18 10:50:32,845 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 10:50:32,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:50:32,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-11-18 10:50:32,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2018-11-18 10:50:32,866 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:50:32,866 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:50:32,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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 34 [2018-11-18 10:50:32,868 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 10:50:32,876 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:50:32,881 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:50:32,893 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:50:32,893 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 10:50:32,903 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:50:32,904 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:50:32,904 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 10:50:32,904 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 10:50:32,908 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:50:32,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 10:50:32,919 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-11-18 10:50:33,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2018-11-18 10:50:33,031 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 10:50:33,038 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 10:50:33,039 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:56, output treesize:35 [2018-11-18 10:50:33,137 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 59 treesize of output 36 [2018-11-18 10:50:33,139 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:50:33,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 43 [2018-11-18 10:50:33,145 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-18 10:50:33,153 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 37 treesize of output 38 [2018-11-18 10:50:33,156 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 10:50:33,156 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:50:33,160 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:50:33,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 24 [2018-11-18 10:50:33,164 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 10:50:33,164 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 10:50:33,167 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:50:33,174 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 10:50:33,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 10:50:33,190 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:98, output treesize:133 [2018-11-18 10:50:33,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 131 [2018-11-18 10:50:33,715 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:50:33,716 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:50:33,717 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:50:33,717 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:50:33,719 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:50:33,720 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:50:33,721 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:50:33,721 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 47 treesize of output 200 [2018-11-18 10:50:33,721 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:50:33,751 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 132 treesize of output 131 [2018-11-18 10:50:33,753 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:50:33,754 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:50:33,755 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 119 treesize of output 149 [2018-11-18 10:50:33,755 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:50:33,769 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:50:33,778 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 10:50:33,798 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 10:50:33,798 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:178, output treesize:159 [2018-11-18 10:50:34,169 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 55 proven. 91 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 10:50:34,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:50:34,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 24] total 43 [2018-11-18 10:50:34,185 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:50:34,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:50:34,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1076808156, now seen corresponding path program 7 times [2018-11-18 10:50:34,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:50:34,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:50:34,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:50:34,186 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:50:34,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:50:34,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:50:34,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:50:35,288 WARN L180 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 221 DAG size of output: 161 [2018-11-18 10:50:35,475 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2018-11-18 10:50:35,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-18 10:50:35,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1617, Unknown=0, NotChecked=0, Total=1806 [2018-11-18 10:50:35,476 INFO L87 Difference]: Start difference. First operand 539 states and 672 transitions. cyclomatic complexity: 143 Second operand 43 states. [2018-11-18 10:50:38,262 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 74 [2018-11-18 10:50:38,520 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 65 [2018-11-18 10:50:41,308 WARN L180 SmtUtils]: Spent 1.52 s on a formula simplification. DAG size of input: 96 DAG size of output: 81 [2018-11-18 10:50:41,687 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 80 [2018-11-18 10:50:47,325 WARN L180 SmtUtils]: Spent 5.04 s on a formula simplification. DAG size of input: 145 DAG size of output: 76 [2018-11-18 10:50:50,910 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 66 [2018-11-18 10:50:51,884 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 85 [2018-11-18 10:50:53,833 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 79 [2018-11-18 10:50:54,001 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 85 [2018-11-18 10:50:54,949 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 87 [2018-11-18 10:50:56,156 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 77 [2018-11-18 10:50:56,617 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 83 [2018-11-18 10:50:56,874 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 78 [2018-11-18 10:50:57,032 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 82 [2018-11-18 10:50:57,927 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 80 [2018-11-18 10:50:58,398 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 85 [2018-11-18 10:50:59,903 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 72 [2018-11-18 10:51:00,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:51:00,867 INFO L93 Difference]: Finished difference Result 1052 states and 1238 transitions. [2018-11-18 10:51:00,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2018-11-18 10:51:00,867 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1052 states and 1238 transitions. [2018-11-18 10:51:00,869 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 114 [2018-11-18 10:51:00,871 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1052 states to 550 states and 671 transitions. [2018-11-18 10:51:00,871 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 123 [2018-11-18 10:51:00,871 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 123 [2018-11-18 10:51:00,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 550 states and 671 transitions. [2018-11-18 10:51:00,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:51:00,871 INFO L705 BuchiCegarLoop]: Abstraction has 550 states and 671 transitions. [2018-11-18 10:51:00,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states and 671 transitions. [2018-11-18 10:51:00,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 462. [2018-11-18 10:51:00,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2018-11-18 10:51:00,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 573 transitions. [2018-11-18 10:51:00,876 INFO L728 BuchiCegarLoop]: Abstraction has 462 states and 573 transitions. [2018-11-18 10:51:00,876 INFO L608 BuchiCegarLoop]: Abstraction has 462 states and 573 transitions. [2018-11-18 10:51:00,876 INFO L442 BuchiCegarLoop]: ======== Iteration 27============ [2018-11-18 10:51:00,877 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 462 states and 573 transitions. [2018-11-18 10:51:00,877 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 102 [2018-11-18 10:51:00,878 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:51:00,878 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:51:00,878 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2018-11-18 10:51:00,878 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1] [2018-11-18 10:51:00,879 INFO L794 eck$LassoCheckResult]: Stem: 24846#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 24843#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; 24811#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 24812#L558-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; 24826#L545-4 assume true; 24838#L545-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); 24839#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 24847#L545-4 assume true; 24848#L545-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); 24844#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 24845#L545-4 assume true; 24861#L545-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); 24860#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 24859#L545-4 assume true; 24858#L545-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); 24857#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 24856#L545-4 assume true; 24854#L545-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); 24855#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 24853#L545-4 assume true; 24836#L545-1 assume !(lis_~i~0 < lis_~N); 24837#L545-5 lis_~i~0 := 1; 24849#L547-4 assume true; 24821#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 24822#L548-4 assume true; 25039#L548-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; 25037#L549 assume !lis_#t~short11; 25035#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 25031#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 25032#L548-4 assume true; 25027#L548-1 assume !(lis_~j~0 < lis_~i~0); 25028#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 25097#L547-4 assume true; 25096#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 25095#L548-4 assume true; 25094#L548-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; 25093#L549 assume !lis_#t~short11; 25092#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 25091#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 25090#L548-4 assume true; 25089#L548-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; 25083#L549 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; 25080#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 25078#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 25076#L548-4 assume true; 25074#L548-1 assume !(lis_~j~0 < lis_~i~0); 25072#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 25070#L547-4 assume true; 25068#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 25066#L548-4 assume true; 25064#L548-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; 25062#L549 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; 25058#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 25055#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 25054#L548-4 assume true; 25053#L548-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; 25052#L549 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; 24852#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 24820#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 24828#L548-4 assume true; 24835#L548-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; 25045#L549 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; 25042#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 24975#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 24973#L548-4 assume true; 24931#L548-1 assume !(lis_~j~0 < lis_~i~0); 24925#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 24926#L547-4 assume true; 24950#L547-1 [2018-11-18 10:51:00,879 INFO L796 eck$LassoCheckResult]: Loop: 24950#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 24949#L548-4 assume true; 24813#L548-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; 24814#L549 assume !lis_#t~short11; 24817#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 24818#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 24827#L548-4 assume true; 24942#L548-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; 24938#L549 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; 24939#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 24936#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 24967#L548-4 assume true; 24965#L548-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; 24964#L549 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; 24962#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 24875#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 24961#L548-4 assume true; 24960#L548-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; 24956#L549 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; 24958#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 24867#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 24957#L548-4 assume true; 24955#L548-1 assume !(lis_~j~0 < lis_~i~0); 24954#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 24952#L547-4 assume true; 24950#L547-1 [2018-11-18 10:51:00,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:51:00,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1170615440, now seen corresponding path program 4 times [2018-11-18 10:51:00,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:51:00,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:51:00,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:51:00,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:51:00,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:51:00,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:51:01,280 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 5 proven. 132 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-18 10:51:01,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:51:01,280 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25f04ae1-e643-443a-91ff-e3c00beaa66b/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 10:51:01,288 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 10:51:01,312 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 10:51:01,312 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 10:51:01,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:51:01,321 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 10:51:01,326 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:01,327 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:01,327 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 10:51:01,328 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:51:01,330 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:51:01,334 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 10:51:01,334 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:8 [2018-11-18 10:51:01,374 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 10:51:01,377 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 10:51:01,377 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:51:01,386 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 10:51:01,388 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 10:51:01,388 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:51:01,392 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:51:01,398 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 10:51:01,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:51:01,404 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:47, output treesize:30 [2018-11-18 10:51:01,447 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 10:51:01,450 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:01,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 10:51:01,452 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:51:01,466 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 10:51:01,469 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:01,471 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:01,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 10:51:01,473 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:51:01,483 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:51:01,489 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 10:51:01,497 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:51:01,497 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:65, output treesize:48 [2018-11-18 10:51:01,556 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 10:51:01,560 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:01,562 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:01,564 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:01,565 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 10:51:01,565 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:51:01,584 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 10:51:01,587 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:01,587 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:01,588 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:01,590 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:01,591 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:01,592 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:01,592 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 10:51:01,592 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:51:01,607 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:51:01,614 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 10:51:01,624 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 10:51:01,624 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:83, output treesize:66 [2018-11-18 10:51:01,935 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 26 proven. 132 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 10:51:01,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:51:01,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 34 [2018-11-18 10:51:01,951 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:51:01,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:51:01,951 INFO L82 PathProgramCache]: Analyzing trace with hash -2120802652, now seen corresponding path program 8 times [2018-11-18 10:51:01,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:51:01,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:51:01,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:51:01,952 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:51:01,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:51:01,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:51:01,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:51:03,004 WARN L180 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 216 DAG size of output: 159 [2018-11-18 10:51:03,194 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2018-11-18 10:51:03,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-18 10:51:03,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1000, Unknown=0, NotChecked=0, Total=1122 [2018-11-18 10:51:03,195 INFO L87 Difference]: Start difference. First operand 462 states and 573 transitions. cyclomatic complexity: 118 Second operand 34 states. [2018-11-18 10:51:08,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:51:08,307 INFO L93 Difference]: Finished difference Result 711 states and 886 transitions. [2018-11-18 10:51:08,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-11-18 10:51:08,308 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 711 states and 886 transitions. [2018-11-18 10:51:08,309 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 149 [2018-11-18 10:51:08,311 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 711 states to 708 states and 883 transitions. [2018-11-18 10:51:08,311 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 199 [2018-11-18 10:51:08,312 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 199 [2018-11-18 10:51:08,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 708 states and 883 transitions. [2018-11-18 10:51:08,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:51:08,312 INFO L705 BuchiCegarLoop]: Abstraction has 708 states and 883 transitions. [2018-11-18 10:51:08,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states and 883 transitions. [2018-11-18 10:51:08,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 574. [2018-11-18 10:51:08,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2018-11-18 10:51:08,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 712 transitions. [2018-11-18 10:51:08,318 INFO L728 BuchiCegarLoop]: Abstraction has 574 states and 712 transitions. [2018-11-18 10:51:08,318 INFO L608 BuchiCegarLoop]: Abstraction has 574 states and 712 transitions. [2018-11-18 10:51:08,318 INFO L442 BuchiCegarLoop]: ======== Iteration 28============ [2018-11-18 10:51:08,318 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 574 states and 712 transitions. [2018-11-18 10:51:08,319 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 102 [2018-11-18 10:51:08,319 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:51:08,319 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:51:08,319 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 6, 6, 6, 6, 5, 5, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2018-11-18 10:51:08,320 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 4, 4, 4, 4, 1, 1, 1, 1] [2018-11-18 10:51:08,320 INFO L794 eck$LassoCheckResult]: Stem: 26408#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 26405#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; 26380#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 26381#L558-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; 26394#L545-4 assume true; 26403#L545-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); 26404#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 26409#L545-4 assume true; 26410#L545-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); 26406#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 26407#L545-4 assume true; 26424#L545-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); 26423#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 26422#L545-4 assume true; 26421#L545-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); 26420#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 26419#L545-4 assume true; 26417#L545-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); 26418#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 26416#L545-4 assume true; 26401#L545-1 assume !(lis_~i~0 < lis_~N); 26402#L545-5 lis_~i~0 := 1; 26411#L547-4 assume true; 26622#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 26620#L548-4 assume true; 26618#L548-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; 26616#L549 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; 26613#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 26611#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 26612#L548-4 assume true; 26607#L548-1 assume !(lis_~j~0 < lis_~i~0); 26608#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 26565#L547-4 assume true; 26566#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 26557#L548-4 assume true; 26558#L548-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; 26551#L549 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; 26552#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 26546#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 26544#L548-4 assume true; 26540#L548-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; 26534#L549 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; 26535#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 26771#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 26782#L548-4 assume true; 26913#L548-1 assume !(lis_~j~0 < lis_~i~0); 26912#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 26911#L547-4 assume true; 26910#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 26909#L548-4 assume true; 26908#L548-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; 26907#L549 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; 26905#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 26904#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 26903#L548-4 assume true; 26902#L548-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; 26901#L549 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; 26899#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 26897#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 26895#L548-4 assume true; 26893#L548-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; 26891#L549 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; 26889#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 26888#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 26887#L548-4 assume true; 26435#L548-1 assume !(lis_~j~0 < lis_~i~0); 26436#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 26427#L547-4 assume true; 26390#L547-1 [2018-11-18 10:51:08,320 INFO L796 eck$LassoCheckResult]: Loop: 26390#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 26391#L548-4 assume true; 26674#L548-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; 26412#L549 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; 26413#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 26383#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 26395#L548-4 assume true; 26386#L548-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; 26387#L549 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; 26627#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 26626#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 26625#L548-4 assume true; 26624#L548-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; 26623#L549 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; 26441#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 26438#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 26437#L548-4 assume true; 26434#L548-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; 26426#L549 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; 26432#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 26431#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 26430#L548-4 assume true; 26425#L548-1 assume !(lis_~j~0 < lis_~i~0); 26397#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 26398#L547-4 assume true; 26390#L547-1 [2018-11-18 10:51:08,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:51:08,320 INFO L82 PathProgramCache]: Analyzing trace with hash -539576878, now seen corresponding path program 1 times [2018-11-18 10:51:08,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:51:08,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:51:08,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:51:08,321 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:51:08,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:51:08,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:51:09,421 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 10 proven. 157 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 10:51:09,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:51:09,422 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25f04ae1-e643-443a-91ff-e3c00beaa66b/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 10:51:09,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:51:09,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:51:09,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:51:09,455 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 10:51:09,460 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:09,461 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:09,462 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 10:51:09,462 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:51:09,466 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:51:09,469 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 10:51:09,470 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:8 [2018-11-18 10:51:09,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 28 [2018-11-18 10:51:09,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-18 10:51:09,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:51: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, 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 10:51:09,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-18 10:51:09,528 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:51:09,532 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:51:09,536 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 10:51:09,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:51:09,541 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:47, output treesize:30 [2018-11-18 10:51:09,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 48 [2018-11-18 10:51:09,607 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:09,607 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 10:51:09,608 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:51:09,619 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 10:51:09,622 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:09,624 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:09,625 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 10:51:09,625 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:51:09,632 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:51:09,639 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 10:51:09,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:51:09,647 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:65, output treesize:48 [2018-11-18 10:51:09,718 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 10:51:09,720 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:09,721 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:09,723 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:09,724 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 10:51:09,724 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:51:09,739 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 10:51:09,741 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:09,742 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:09,742 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:09,743 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:09,744 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:09,744 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:09,745 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 10:51:09,745 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:51:09,757 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:51:09,764 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 10:51:09,772 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:51:09,772 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:83, output treesize:66 [2018-11-18 10:51:09,851 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 10:51:09,854 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:09,854 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:09,855 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:09,856 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:09,857 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:09,858 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:09,858 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 10:51:09,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:51:09,887 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 10:51:09,889 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:09,890 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:09,890 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:09,891 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:09,892 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:09,892 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:09,893 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:09,894 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:09,895 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:09,895 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:09,896 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:09,897 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:09,898 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 10:51:09,899 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:51:09,921 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:51:09,930 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 10:51:09,941 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 10:51:09,941 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:101, output treesize:84 [2018-11-18 10:51:10,172 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,174 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 155 treesize of output 141 [2018-11-18 10:51:10,181 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,183 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:51:10,184 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,185 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,186 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,187 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,191 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,196 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 84 treesize of output 166 [2018-11-18 10:51:10,207 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-11-18 10:51:10,261 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 118 [2018-11-18 10:51:10,267 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,267 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,268 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,269 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,270 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,270 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,271 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,271 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,272 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:51:10,273 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,273 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,274 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,276 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,276 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,278 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 214 [2018-11-18 10:51:10,279 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:51:10,309 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:51:10,311 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:51:10,313 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 105 treesize of output 107 [2018-11-18 10:51:10,316 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,317 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,317 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,318 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,319 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,319 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,320 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,320 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,321 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:51:10,322 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,322 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,323 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,324 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,324 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,325 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,326 INFO L477 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 216 [2018-11-18 10:51:10,326 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 10:51:10,355 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:51:10,382 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 10:51:10,415 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 2 xjuncts. [2018-11-18 10:51:10,415 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:165, output treesize:209 [2018-11-18 10:51:10,722 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 157 treesize of output 125 [2018-11-18 10:51:10,726 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,727 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,728 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,729 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,729 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,730 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,731 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,732 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,733 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,733 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,734 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,735 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,736 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,736 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,737 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:51:10,738 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,744 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,747 INFO L477 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 261 [2018-11-18 10:51:10,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:51:10,793 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 115 [2018-11-18 10:51:10,798 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,799 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,800 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,800 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,801 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,802 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,803 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,803 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,804 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,804 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:51:10,805 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,806 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,807 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,808 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,809 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,809 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,810 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,811 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,812 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,812 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 58 treesize of output 285 [2018-11-18 10:51:10,813 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:51:10,846 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:51:10,860 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 10:51:10,944 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 182 treesize of output 146 [2018-11-18 10:51:10,947 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,948 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,949 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,949 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,950 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,951 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,953 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,954 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,955 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,955 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,960 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,961 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,962 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,963 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,964 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,964 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:51:10,966 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,967 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,972 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:10,990 INFO L477 Elim1Store]: Elim1 did not use 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 1 new quantified variables, introduced 6 case distinctions, treesize of input 89 treesize of output 367 [2018-11-18 10:51:10,991 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 3 xjuncts. [2018-11-18 10:51:11,106 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,107 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 167 treesize of output 166 [2018-11-18 10:51:11,110 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,111 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,112 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,112 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,113 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,114 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,115 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,115 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,116 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,117 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:51:11,119 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,121 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,122 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,122 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,123 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,124 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 290 [2018-11-18 10:51:11,125 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 10:51:11,161 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:51:11,165 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,166 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 127 treesize of output 130 [2018-11-18 10:51:11,169 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,170 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,170 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,171 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,172 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,172 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,173 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,174 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,175 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,175 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:51:11,176 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,177 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,177 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:51:11,178 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,179 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,179 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,180 INFO L477 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 258 [2018-11-18 10:51:11,180 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 10:51:11,213 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:51:11,251 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 10:51:11,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-11-18 10:51:11,311 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:340, output treesize:385 [2018-11-18 10:51:11,606 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 160 treesize of output 128 [2018-11-18 10:51:11,609 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,610 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,611 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,612 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,613 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,613 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:51:11,614 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,615 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,616 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,617 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,618 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,619 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,623 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,626 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,628 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,630 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,633 INFO L477 Elim1Store]: Elim1 did not use 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 256 [2018-11-18 10:51:11,633 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:51:11,675 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,675 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 113 treesize of output 116 [2018-11-18 10:51:11,678 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,679 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,680 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,681 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,682 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,682 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,683 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,684 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,685 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,686 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,686 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,687 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,688 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,689 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,689 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 241 [2018-11-18 10:51:11,690 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:51:11,716 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:51:11,729 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 10:51:11,918 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 200 treesize of output 164 [2018-11-18 10:51:11,921 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,922 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,923 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,924 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,925 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,926 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,927 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,928 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:51:11,929 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,930 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,931 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,932 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,933 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,935 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,948 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,952 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,955 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,956 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,959 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,967 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:11,970 INFO L477 Elim1Store]: Elim1 did not use 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 3 case distinctions, treesize of input 93 treesize of output 404 [2018-11-18 10:51:11,971 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 10:51:12,022 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:12,024 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 140 treesize of output 141 [2018-11-18 10:51:12,027 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:12,028 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:12,029 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:12,030 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:12,031 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:12,031 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:12,032 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:12,033 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:12,035 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:12,036 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:12,038 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:12,039 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:12,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 227 [2018-11-18 10:51:12,040 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 10:51:12,066 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:51:12,080 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 10:51:12,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 128 [2018-11-18 10:51:12,213 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:12,214 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:12,215 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:12,216 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:12,217 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:12,218 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:12,219 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:12,219 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:12,220 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:12,221 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:51:12,222 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:12,230 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:12,231 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:12,236 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:12,238 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:12,239 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:12,241 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:12,245 INFO L477 Elim1Store]: Elim1 did not use 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 270 [2018-11-18 10:51:12,245 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 10:51:12,286 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:12,288 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 115 treesize of output 118 [2018-11-18 10:51:12,290 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:12,291 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:12,292 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:12,292 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:12,293 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:12,294 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:12,294 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:12,295 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:12,296 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:12,296 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:51:12,297 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:12,298 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:12,299 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:12,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 220 [2018-11-18 10:51:12,299 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-18 10:51:12,323 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:51:12,336 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 10:51:12,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-2 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2018-11-18 10:51:12,386 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 12 variables, input treesize:521, output treesize:368 [2018-11-18 10:51:13,294 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 26 proven. 143 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:51:13,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:51:13,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 24] total 51 [2018-11-18 10:51:13,310 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:51:13,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:51:13,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1532608100, now seen corresponding path program 9 times [2018-11-18 10:51:13,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:51:13,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:51:13,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:51:13,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:51:13,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:51:13,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:51:13,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:51:16,025 WARN L180 SmtUtils]: Spent 2.70 s on a formula simplification. DAG size of input: 245 DAG size of output: 178 [2018-11-18 10:51:16,340 WARN L180 SmtUtils]: Spent 310.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-11-18 10:51:16,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-11-18 10:51:16,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=2348, Unknown=0, NotChecked=0, Total=2550 [2018-11-18 10:51:16,341 INFO L87 Difference]: Start difference. First operand 574 states and 712 transitions. cyclomatic complexity: 146 Second operand 51 states. [2018-11-18 10:51:18,381 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 86 [2018-11-18 10:51:18,718 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 99 [2018-11-18 10:51:19,073 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 98 [2018-11-18 10:51:19,926 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 126 [2018-11-18 10:51:20,329 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 124 [2018-11-18 10:51:21,004 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 131 [2018-11-18 10:51:21,530 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 125 [2018-11-18 10:51:21,993 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 120 [2018-11-18 10:51:23,587 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 120 [2018-11-18 10:51:24,661 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 121 [2018-11-18 10:51:26,066 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 120 [2018-11-18 10:51:26,746 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 128 [2018-11-18 10:51:29,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:51:29,747 INFO L93 Difference]: Finished difference Result 1144 states and 1384 transitions. [2018-11-18 10:51:29,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2018-11-18 10:51:29,748 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1144 states and 1384 transitions. [2018-11-18 10:51:29,750 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 211 [2018-11-18 10:51:29,752 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1144 states to 993 states and 1208 transitions. [2018-11-18 10:51:29,752 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 240 [2018-11-18 10:51:29,752 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 251 [2018-11-18 10:51:29,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 993 states and 1208 transitions. [2018-11-18 10:51:29,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:51:29,752 INFO L705 BuchiCegarLoop]: Abstraction has 993 states and 1208 transitions. [2018-11-18 10:51:29,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states and 1208 transitions. [2018-11-18 10:51:29,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 544. [2018-11-18 10:51:29,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2018-11-18 10:51:29,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 669 transitions. [2018-11-18 10:51:29,756 INFO L728 BuchiCegarLoop]: Abstraction has 544 states and 669 transitions. [2018-11-18 10:51:29,756 INFO L608 BuchiCegarLoop]: Abstraction has 544 states and 669 transitions. [2018-11-18 10:51:29,756 INFO L442 BuchiCegarLoop]: ======== Iteration 29============ [2018-11-18 10:51:29,757 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 544 states and 669 transitions. [2018-11-18 10:51:29,758 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 102 [2018-11-18 10:51:29,758 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:51:29,758 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:51:29,758 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 6, 6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2018-11-18 10:51:29,758 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1] [2018-11-18 10:51:29,759 INFO L794 eck$LassoCheckResult]: Stem: 28677#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 28674#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; 28647#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 28648#L558-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; 28661#L545-4 assume true; 28668#L545-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); 28669#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 28678#L545-4 assume true; 28679#L545-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); 28675#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 28676#L545-4 assume true; 28692#L545-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); 28691#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 28690#L545-4 assume true; 28689#L545-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); 28688#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 28687#L545-4 assume true; 28685#L545-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); 28686#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 28684#L545-4 assume true; 28666#L545-1 assume !(lis_~i~0 < lis_~N); 28667#L545-5 lis_~i~0 := 1; 28680#L547-4 assume true; 28776#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 28775#L548-4 assume true; 28774#L548-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; 28773#L549 assume !lis_#t~short11; 28772#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 28771#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 28770#L548-4 assume true; 28769#L548-1 assume !(lis_~j~0 < lis_~i~0); 28768#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 28766#L547-4 assume true; 28764#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 28762#L548-4 assume true; 28760#L548-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; 28757#L549 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; 28758#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 28745#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 28744#L548-4 assume true; 28743#L548-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; 28741#L549 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; 28739#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 28738#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 28737#L548-4 assume true; 28736#L548-1 assume !(lis_~j~0 < lis_~i~0); 28735#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 28734#L547-4 assume true; 28733#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 28732#L548-4 assume true; 28731#L548-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; 28729#L549 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; 28730#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 28725#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 28723#L548-4 assume true; 28721#L548-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; 28718#L549 assume !lis_#t~short11; 28716#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 28714#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 28712#L548-4 assume true; 28710#L548-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; 28707#L549 assume !lis_#t~short11; 28706#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 28705#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 28704#L548-4 assume true; 28696#L548-1 assume !(lis_~j~0 < lis_~i~0); 28670#L547-3 [2018-11-18 10:51:29,759 INFO L796 eck$LassoCheckResult]: Loop: 28670#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 28671#L547-4 assume true; 28657#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 28658#L548-4 assume true; 28990#L548-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; 28989#L549 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; 28987#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 28662#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 28663#L548-4 assume true; 28649#L548-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; 28650#L549 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; 29160#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 28654#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 28953#L548-4 assume true; 28827#L548-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; 28826#L549 assume !lis_#t~short11; 28782#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 28779#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 28778#L548-4 assume true; 28703#L548-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; 28702#L549 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; 28700#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 28699#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 28697#L548-4 assume true; 28698#L548-1 assume !(lis_~j~0 < lis_~i~0); 28670#L547-3 [2018-11-18 10:51:29,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:51:29,759 INFO L82 PathProgramCache]: Analyzing trace with hash -810359023, now seen corresponding path program 5 times [2018-11-18 10:51:29,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:51:29,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:51:29,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:51:29,760 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:51:29,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:51:29,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:51:30,637 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 8 proven. 149 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 10:51:30,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:51:30,637 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25f04ae1-e643-443a-91ff-e3c00beaa66b/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 10:51:30,646 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 10:51:30,694 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-18 10:51:30,694 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 10:51:30,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:51:30,701 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 10:51:30,711 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:30,712 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:30,712 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 10:51:30,712 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:51:30,715 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:51:30,719 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 10:51:30,719 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2018-11-18 10:51:30,750 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 10:51:30,751 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 10:51:30,751 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:51:30,757 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 10:51:30,759 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 10:51:30,759 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:51:30,762 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:51:30,765 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 10:51:30,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:51:30,770 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:53, output treesize:36 [2018-11-18 10:51:30,814 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 10:51:30,816 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:30,817 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 10:51:30,817 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:51:30,825 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:30,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 57 [2018-11-18 10:51:30,828 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:30,829 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:30,830 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 33 treesize of output 49 [2018-11-18 10:51:30,830 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:51:30,837 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:51:30,841 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 10:51:30,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:51:30,849 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:71, output treesize:50 [2018-11-18 10:51:30,899 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:30,900 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:30,901 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:30,903 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 76 treesize of output 83 [2018-11-18 10:51:30,905 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:30,906 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:30,907 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:30,908 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:30,917 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 46 treesize of output 95 [2018-11-18 10:51:30,918 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 10:51:30,939 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:30,939 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:30,940 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:30,941 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 63 treesize of output 79 [2018-11-18 10:51:30,944 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:30,945 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:30,945 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:30,946 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:30,948 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:30,949 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:30,950 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:30,957 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 46 treesize of output 131 [2018-11-18 10:51:30,958 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 10:51:30,981 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:51:30,987 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 10:51:30,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:51:30,997 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:85, output treesize:68 [2018-11-18 10:51:31,059 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:31,060 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:31,063 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:31,063 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 86 treesize of output 91 [2018-11-18 10:51:31,066 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:31,070 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:31,071 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:31,071 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:31,072 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:31,073 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:31,074 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:31,085 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 53 treesize of output 130 [2018-11-18 10:51:31,085 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 10:51:31,120 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:31,120 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:31,121 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:31,123 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 73 treesize of output 85 [2018-11-18 10:51:31,126 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:31,128 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:31,128 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:31,129 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:31,132 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:31,133 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:31,134 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:31,134 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:31,135 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:31,136 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:31,143 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 43 treesize of output 142 [2018-11-18 10:51:31,144 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 10:51:31,176 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:51:31,184 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 10:51:31,194 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 10:51:31,194 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:92, output treesize:75 [2018-11-18 10:51:31,532 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-18 10:51:31,532 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 10:51:31,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:51:31,535 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:96, output treesize:8 [2018-11-18 10:51:31,573 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 82 proven. 50 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-18 10:51:31,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:51:31,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 19] total 45 [2018-11-18 10:51:31,589 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:51:31,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:51:31,589 INFO L82 PathProgramCache]: Analyzing trace with hash 299108354, now seen corresponding path program 9 times [2018-11-18 10:51:31,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:51:31,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:51:31,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:51:31,590 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:51:31,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:51:31,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:51:31,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:51:32,710 WARN L180 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 221 DAG size of output: 161 [2018-11-18 10:51:32,921 WARN L180 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2018-11-18 10:51:32,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-18 10:51:32,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1802, Unknown=0, NotChecked=0, Total=1980 [2018-11-18 10:51:32,922 INFO L87 Difference]: Start difference. First operand 544 states and 669 transitions. cyclomatic complexity: 132 Second operand 45 states. [2018-11-18 10:51:36,738 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 77 [2018-11-18 10:51:36,964 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 106 [2018-11-18 10:51:37,325 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 91 [2018-11-18 10:51:37,544 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 76 [2018-11-18 10:51:37,736 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 101 [2018-11-18 10:51:38,022 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 72 [2018-11-18 10:51:38,219 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 97 [2018-11-18 10:51:39,005 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 104 [2018-11-18 10:51:39,839 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 107 [2018-11-18 10:51:40,465 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 105 [2018-11-18 10:51:40,635 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 102 [2018-11-18 10:51:41,510 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 98 [2018-11-18 10:51:41,905 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 106 [2018-11-18 10:51:42,459 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 96 [2018-11-18 10:51:42,894 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 77 [2018-11-18 10:51:43,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:51:43,738 INFO L93 Difference]: Finished difference Result 1996 states and 2532 transitions. [2018-11-18 10:51:43,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-11-18 10:51:43,738 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1996 states and 2532 transitions. [2018-11-18 10:51:43,742 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 685 [2018-11-18 10:51:43,748 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1996 states to 1959 states and 2492 transitions. [2018-11-18 10:51:43,748 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 698 [2018-11-18 10:51:43,749 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 698 [2018-11-18 10:51:43,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1959 states and 2492 transitions. [2018-11-18 10:51:43,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:51:43,749 INFO L705 BuchiCegarLoop]: Abstraction has 1959 states and 2492 transitions. [2018-11-18 10:51:43,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1959 states and 2492 transitions. [2018-11-18 10:51:43,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1959 to 952. [2018-11-18 10:51:43,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 952 states. [2018-11-18 10:51:43,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1198 transitions. [2018-11-18 10:51:43,762 INFO L728 BuchiCegarLoop]: Abstraction has 952 states and 1198 transitions. [2018-11-18 10:51:43,762 INFO L608 BuchiCegarLoop]: Abstraction has 952 states and 1198 transitions. [2018-11-18 10:51:43,762 INFO L442 BuchiCegarLoop]: ======== Iteration 30============ [2018-11-18 10:51:43,762 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 952 states and 1198 transitions. [2018-11-18 10:51:43,764 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 102 [2018-11-18 10:51:43,764 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:51:43,764 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:51:43,765 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 6, 6, 6, 6, 5, 5, 5, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:51:43,765 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1] [2018-11-18 10:51:43,765 INFO L794 eck$LassoCheckResult]: Stem: 31676#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 31673#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; 31646#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 31647#L558-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; 31660#L545-4 assume true; 31665#L545-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); 31666#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 31677#L545-4 assume true; 31678#L545-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); 31674#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 31675#L545-4 assume true; 31691#L545-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); 31690#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 31689#L545-4 assume true; 31688#L545-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); 31687#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 31686#L545-4 assume true; 31684#L545-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); 31685#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 31683#L545-4 assume true; 31663#L545-1 assume !(lis_~i~0 < lis_~N); 31664#L545-5 lis_~i~0 := 1; 31679#L547-4 assume true; 31754#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 31753#L548-4 assume true; 31752#L548-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; 31751#L549 assume !lis_#t~short11; 31750#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 31749#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 31748#L548-4 assume true; 31747#L548-1 assume !(lis_~j~0 < lis_~i~0); 31746#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 31744#L547-4 assume true; 31742#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 31740#L548-4 assume true; 31738#L548-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; 31735#L549 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; 31736#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 31733#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 31732#L548-4 assume true; 31731#L548-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; 31729#L549 assume !lis_#t~short11; 31728#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 31727#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 31726#L548-4 assume true; 31725#L548-1 assume !(lis_~j~0 < lis_~i~0); 31724#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 31723#L547-4 assume true; 31722#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 31721#L548-4 assume true; 31720#L548-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; 31718#L549 assume !lis_#t~short11; 31717#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 31716#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 31715#L548-4 assume true; 31714#L548-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; 31712#L549 assume !lis_#t~short11; 31711#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 31710#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 31709#L548-4 assume true; 31708#L548-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; 31705#L549 assume !lis_#t~short11; 31707#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 31758#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 31757#L548-4 assume true; 31696#L548-1 assume !(lis_~j~0 < lis_~i~0); 31668#L547-3 [2018-11-18 10:51:43,765 INFO L796 eck$LassoCheckResult]: Loop: 31668#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 31669#L547-4 assume true; 31656#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 31657#L548-4 assume true; 32577#L548-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; 31680#L549 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; 31681#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 31653#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 31661#L548-4 assume true; 31648#L548-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; 31649#L549 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; 32563#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 32562#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 32561#L548-4 assume true; 31768#L548-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; 31767#L549 assume !lis_#t~short11; 31763#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 31760#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 31759#L548-4 assume true; 31756#L548-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; 31704#L549 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; 31702#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 31701#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 31699#L548-4 assume true; 31700#L548-1 assume !(lis_~j~0 < lis_~i~0); 31668#L547-3 [2018-11-18 10:51:43,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:51:43,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1949674091, now seen corresponding path program 6 times [2018-11-18 10:51:43,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:51:43,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:51:43,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:51:43,766 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:51:43,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:51:43,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:51:44,206 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 10 proven. 147 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 10:51:44,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:51:44,206 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25f04ae1-e643-443a-91ff-e3c00beaa66b/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 10:51:44,214 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 10:51:44,252 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-11-18 10:51:44,252 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 10:51:44,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:51:44,265 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:44,266 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 10:51:44,276 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:44,277 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:44,278 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 10:51:44,278 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:51:44,282 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:51:44,286 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 10:51:44,287 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:11 [2018-11-18 10:51:44,299 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 10:51:44,301 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 10:51:44,301 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:51:44,307 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 10:51:44,308 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 10:51:44,309 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:51:44,312 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:51:44,315 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 10:51:44,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:51:44,320 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:50, output treesize:33 [2018-11-18 10:51:44,354 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 10:51:44,356 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:44,356 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 10:51:44,357 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:51:44,366 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 10:51:44,368 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:44,369 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:44,369 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 10:51:44,369 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:51:44,376 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:51:44,380 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 10:51:44,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:51:44,387 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:64, output treesize:47 [2018-11-18 10:51:44,431 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 10:51:44,433 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:44,434 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:44,435 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:44,435 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 10:51:44,435 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:51:44,451 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 10:51:44,457 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:44,458 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:44,459 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:44,460 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:44,460 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:44,461 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:44,462 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 10:51:44,462 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:51:44,475 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:51:44,481 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 10:51:44,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:51:44,491 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:82, output treesize:65 [2018-11-18 10:51:44,548 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 10:51:44,550 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:44,551 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:44,552 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:44,552 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:44,553 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:44,554 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:44,555 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 10:51:44,555 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:51:44,577 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 10:51:44,579 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:44,580 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:44,580 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:44,581 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:44,582 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:44,582 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:44,583 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:44,584 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:44,584 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:44,585 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:44,586 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:44,587 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:44,587 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 10:51:44,588 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:51:44,610 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:51:44,618 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 10:51:44,629 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:51:44,629 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:100, output treesize:83 [2018-11-18 10:51:44,707 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 112 treesize of output 96 [2018-11-18 10:51:44,710 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:44,711 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:44,712 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:44,713 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:44,714 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:44,714 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:44,716 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:44,716 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:44,717 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:44,718 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:44,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 136 [2018-11-18 10:51:44,719 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:51:44,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 99 treesize of output 92 [2018-11-18 10:51:44,759 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:44,760 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:44,761 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:44,761 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:44,762 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:44,763 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:44,763 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:44,764 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:44,765 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:44,766 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:44,766 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:44,767 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:44,768 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:44,769 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:44,769 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:44,770 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:44,771 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:44,771 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:44,772 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:44,773 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:51:44,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 272 [2018-11-18 10:51:44,774 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:51:44,812 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:51:44,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 10:51:44,840 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 10:51:44,840 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:127, output treesize:110 [2018-11-18 10:51:45,075 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 64 proven. 46 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-11-18 10:51:45,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:51:45,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 16] total 39 [2018-11-18 10:51:45,090 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:51:45,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:51:45,090 INFO L82 PathProgramCache]: Analyzing trace with hash 299108354, now seen corresponding path program 10 times [2018-11-18 10:51:45,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:51:45,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:51:45,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:51:45,091 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:51:45,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:51:45,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:51:45,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:51:46,158 WARN L180 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 216 DAG size of output: 159 [2018-11-18 10:51:46,287 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2018-11-18 10:51:46,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-18 10:51:46,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1351, Unknown=0, NotChecked=0, Total=1482 [2018-11-18 10:51:46,288 INFO L87 Difference]: Start difference. First operand 952 states and 1198 transitions. cyclomatic complexity: 253 Second operand 39 states. [2018-11-18 10:52:11,711 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 105 [2018-11-18 10:52:19,107 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 97 [2018-11-18 10:52:19,623 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 100 [2018-11-18 10:52:21,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:52:21,573 INFO L93 Difference]: Finished difference Result 3249 states and 4204 transitions. [2018-11-18 10:52:21,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2018-11-18 10:52:21,573 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3249 states and 4204 transitions. [2018-11-18 10:52:21,577 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 713 [2018-11-18 10:52:21,582 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3249 states to 3249 states and 4204 transitions. [2018-11-18 10:52:21,583 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 809 [2018-11-18 10:52:21,583 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 809 [2018-11-18 10:52:21,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3249 states and 4204 transitions. [2018-11-18 10:52:21,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:52:21,583 INFO L705 BuchiCegarLoop]: Abstraction has 3249 states and 4204 transitions. [2018-11-18 10:52:21,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3249 states and 4204 transitions. [2018-11-18 10:52:21,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3249 to 2041. [2018-11-18 10:52:21,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2041 states. [2018-11-18 10:52:21,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2041 states to 2041 states and 2641 transitions. [2018-11-18 10:52:21,597 INFO L728 BuchiCegarLoop]: Abstraction has 2041 states and 2641 transitions. [2018-11-18 10:52:21,597 INFO L608 BuchiCegarLoop]: Abstraction has 2041 states and 2641 transitions. [2018-11-18 10:52:21,597 INFO L442 BuchiCegarLoop]: ======== Iteration 31============ [2018-11-18 10:52:21,597 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2041 states and 2641 transitions. [2018-11-18 10:52:21,599 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 102 [2018-11-18 10:52:21,599 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:52:21,599 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:52:21,599 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 6, 6, 6, 6, 6, 5, 5, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2018-11-18 10:52:21,599 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 4, 4, 4, 4, 1, 1, 1, 1] [2018-11-18 10:52:21,599 INFO L794 eck$LassoCheckResult]: Stem: 36477#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 36474#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; 36446#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 36447#L558-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; 36461#L545-4 assume true; 36466#L545-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); 36467#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 36478#L545-4 assume true; 36479#L545-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); 36475#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 36476#L545-4 assume true; 36493#L545-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); 36492#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 36491#L545-4 assume true; 36490#L545-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); 36489#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 36488#L545-4 assume true; 36486#L545-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); 36487#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 36485#L545-4 assume true; 36464#L545-1 assume !(lis_~i~0 < lis_~N); 36465#L545-5 lis_~i~0 := 1; 36480#L547-4 assume true; 36548#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 36547#L548-4 assume true; 36546#L548-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; 36545#L549 assume !lis_#t~short11; 36544#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 36543#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 36542#L548-4 assume true; 36541#L548-1 assume !(lis_~j~0 < lis_~i~0); 36539#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 36538#L547-4 assume true; 36537#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 36536#L548-4 assume true; 36535#L548-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; 36534#L549 assume !lis_#t~short11; 36533#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 36532#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 36531#L548-4 assume true; 36530#L548-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; 36528#L549 assume !lis_#t~short11; 36527#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 36526#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 36525#L548-4 assume true; 36524#L548-1 assume !(lis_~j~0 < lis_~i~0); 36523#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 36522#L547-4 assume true; 36521#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 36520#L548-4 assume true; 36519#L548-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; 36517#L549 assume !lis_#t~short11; 36516#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 36515#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 36514#L548-4 assume true; 36513#L548-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; 36511#L549 assume !lis_#t~short11; 36510#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 36509#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 36508#L548-4 assume true; 36507#L548-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; 36503#L549 assume !lis_#t~short11; 36505#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 36552#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 36551#L548-4 assume true; 36496#L548-1 assume !(lis_~j~0 < lis_~i~0); 36469#L547-3 [2018-11-18 10:52:21,600 INFO L796 eck$LassoCheckResult]: Loop: 36469#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 36470#L547-4 assume true; 36457#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 36458#L548-4 assume true; 36962#L548-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; 36481#L549 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; 36482#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 36453#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 36462#L548-4 assume true; 36448#L548-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; 36449#L549 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; 36609#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 36606#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 36605#L548-4 assume true; 36604#L548-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; 36587#L549 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; 36557#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 36554#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 36553#L548-4 assume true; 36550#L548-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; 36506#L549 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; 36501#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 36500#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 36498#L548-4 assume true; 36499#L548-1 assume !(lis_~j~0 < lis_~i~0); 36469#L547-3 [2018-11-18 10:52:21,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:52:21,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1927041837, now seen corresponding path program 1 times [2018-11-18 10:52:21,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:52:21,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:52:21,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:52:21,600 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:52:21,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:52:21,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:52:21,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:52:21,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:52:21,616 INFO L82 PathProgramCache]: Analyzing trace with hash 12076994, now seen corresponding path program 10 times [2018-11-18 10:52:21,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:52:21,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:52:21,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:52:21,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:52:21,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:52:21,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:52:21,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:52:21,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:52:21,630 INFO L82 PathProgramCache]: Analyzing trace with hash -116110544, now seen corresponding path program 10 times [2018-11-18 10:52:21,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:52:21,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:52:21,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:52:21,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:52:21,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:52:21,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:52:22,817 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 35 proven. 305 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-18 10:52:22,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:52:22,817 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25f04ae1-e643-443a-91ff-e3c00beaa66b/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 10:52:22,823 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 10:52:22,851 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 10:52:22,851 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 10:52:22,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:52:22,855 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 10:52:22,859 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:22,861 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:22,861 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 10:52:22,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:52:22,864 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:52:22,866 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 10:52:22,866 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:8 [2018-11-18 10:52:22,954 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 10:52:22,955 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 10:52:22,955 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:52:22,961 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 10:52:22,963 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 10:52:22,963 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:52:22,967 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:52:22,974 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 10:52:22,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:52:22,981 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:47, output treesize:30 [2018-11-18 10:52:23,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2018-11-18 10:52:23,048 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:23,049 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 10:52:23,049 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:52:23,059 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 10:52:23,061 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:23,061 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:23,062 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 10:52:23,062 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:52:23,069 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:52:23,073 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 10:52:23,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:52:23,079 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:56, output treesize:41 [2018-11-18 10:52:23,373 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:23,376 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 10:52:23,378 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:23,379 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:52:23,380 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:23,380 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:23,384 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:23,385 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 10:52:23,385 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:52:23,405 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:23,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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 10:52:23,408 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:23,408 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:52:23,409 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:23,410 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:23,410 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 62 [2018-11-18 10:52:23,411 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:52:23,422 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:52:23,431 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 10:52:23,441 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:52:23,441 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:125, output treesize:72 [2018-11-18 10:52:23,615 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:23,617 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 169 treesize of output 155 [2018-11-18 10:52:23,619 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:23,620 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:23,621 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:23,622 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:23,622 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:23,624 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:23,625 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:23,626 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:23,627 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:23,629 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:23,630 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:23,631 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 103 treesize of output 306 [2018-11-18 10:52:23,631 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:52:23,665 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:23,666 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 127 treesize of output 128 [2018-11-18 10:52:23,668 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:23,669 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:23,670 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:23,670 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 94 treesize of output 98 [2018-11-18 10:52:23,670 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:52:23,684 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:52:23,693 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 10:52:23,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:52:23,704 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:176, output treesize:97 [2018-11-18 10:52:23,897 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:23,899 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 149 treesize of output 131 [2018-11-18 10:52:23,902 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:23,904 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:23,904 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:23,905 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:23,906 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:23,906 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:23,907 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:23,908 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:23,908 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:23,910 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:23,911 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:23,912 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:23,913 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:23,914 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:23,915 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:23,915 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:23,916 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:23,917 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:23,919 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:23,920 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:23,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 23 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 349 [2018-11-18 10:52:23,921 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:52:23,966 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:23,967 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 107 treesize of output 114 [2018-11-18 10:52:23,969 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:23,970 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:23,971 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:23,971 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 39 treesize of output 55 [2018-11-18 10:52:23,971 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:52:23,985 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:52:23,993 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 10:52:24,005 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 10:52:24,005 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:159, output treesize:102 [2018-11-18 10:52:24,206 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 35 proven. 305 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-18 10:52:24,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:52:24,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 24] total 50 [2018-11-18 10:52:26,437 WARN L180 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 245 DAG size of output: 178 [2018-11-18 10:52:26,777 WARN L180 SmtUtils]: Spent 334.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-11-18 10:52:26,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-18 10:52:26,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2291, Unknown=0, NotChecked=0, Total=2450 [2018-11-18 10:52:26,778 INFO L87 Difference]: Start difference. First operand 2041 states and 2641 transitions. cyclomatic complexity: 621 Second operand 50 states. [2018-11-18 10:52:29,360 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 77 [2018-11-18 10:52:36,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:52:36,048 INFO L93 Difference]: Finished difference Result 3698 states and 4799 transitions. [2018-11-18 10:52:36,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-11-18 10:52:36,048 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3698 states and 4799 transitions. [2018-11-18 10:52:36,056 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 184 [2018-11-18 10:52:36,063 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3698 states to 3698 states and 4799 transitions. [2018-11-18 10:52:36,063 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 379 [2018-11-18 10:52:36,063 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 379 [2018-11-18 10:52:36,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3698 states and 4799 transitions. [2018-11-18 10:52:36,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:52:36,064 INFO L705 BuchiCegarLoop]: Abstraction has 3698 states and 4799 transitions. [2018-11-18 10:52:36,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3698 states and 4799 transitions. [2018-11-18 10:52:36,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3698 to 2930. [2018-11-18 10:52:36,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2930 states. [2018-11-18 10:52:36,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2930 states to 2930 states and 3809 transitions. [2018-11-18 10:52:36,081 INFO L728 BuchiCegarLoop]: Abstraction has 2930 states and 3809 transitions. [2018-11-18 10:52:36,081 INFO L608 BuchiCegarLoop]: Abstraction has 2930 states and 3809 transitions. [2018-11-18 10:52:36,081 INFO L442 BuchiCegarLoop]: ======== Iteration 32============ [2018-11-18 10:52:36,081 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2930 states and 3809 transitions. [2018-11-18 10:52:36,084 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 124 [2018-11-18 10:52:36,084 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:52:36,084 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:52:36,085 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 6, 6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:52:36,085 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1] [2018-11-18 10:52:36,085 INFO L794 eck$LassoCheckResult]: Stem: 42704#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 42701#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; 42670#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 42671#L558-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; 42684#L545-4 assume true; 42698#L545-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); 42699#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 42705#L545-4 assume true; 42706#L545-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); 42702#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 42703#L545-4 assume true; 42720#L545-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); 42719#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 42718#L545-4 assume true; 42717#L545-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); 42716#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 42715#L545-4 assume true; 42713#L545-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); 42714#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 42712#L545-4 assume true; 42696#L545-1 assume !(lis_~i~0 < lis_~N); 42697#L545-5 lis_~i~0 := 1; 42707#L547-4 assume true; 42857#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 42856#L548-4 assume true; 42855#L548-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; 42854#L549 assume !lis_#t~short11; 42853#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 42852#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 42851#L548-4 assume true; 42850#L548-1 assume !(lis_~j~0 < lis_~i~0); 42848#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 42849#L547-4 assume true; 43025#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 43024#L548-4 assume true; 43023#L548-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; 43022#L549 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; 43021#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 43020#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 43019#L548-4 assume true; 43018#L548-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; 43017#L549 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; 43016#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 43015#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 43013#L548-4 assume true; 43011#L548-1 assume !(lis_~j~0 < lis_~i~0); 43009#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 43007#L547-4 assume true; 43005#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 43003#L548-4 assume true; 43001#L548-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; 42998#L549 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; 42999#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 43644#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 43645#L548-4 assume true; 43640#L548-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; 43641#L549 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; 43703#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 43701#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 43699#L548-4 assume true; 43697#L548-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; 43694#L549 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; 43689#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 43690#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 44117#L548-4 assume true; 44116#L548-1 assume !(lis_~j~0 < lis_~i~0); 44115#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 44114#L547-4 assume true; 43109#L547-1 [2018-11-18 10:52:36,085 INFO L796 eck$LassoCheckResult]: Loop: 43109#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 43108#L548-4 assume true; 43107#L548-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; 43105#L549 assume !lis_#t~short11; 43106#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 43104#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 43145#L548-4 assume true; 43144#L548-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; 43143#L549 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; 43141#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 43140#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 43139#L548-4 assume true; 43138#L548-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; 43137#L549 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; 43136#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 43089#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 43135#L548-4 assume true; 43134#L548-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; 43116#L549 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; 43132#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 43131#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 43130#L548-4 assume true; 43115#L548-1 assume !(lis_~j~0 < lis_~i~0); 43113#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 43112#L547-4 assume true; 43109#L547-1 [2018-11-18 10:52:36,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:52:36,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1158066004, now seen corresponding path program 11 times [2018-11-18 10:52:36,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:52:36,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:52:36,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:52:36,086 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:52:36,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:52:36,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:52:36,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:52:36,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:52:36,136 INFO L82 PathProgramCache]: Analyzing trace with hash -2120802652, now seen corresponding path program 11 times [2018-11-18 10:52:36,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:52:36,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:52:36,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:52:36,137 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:52:36,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:52:36,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:52:36,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:52:36,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:52:36,152 INFO L82 PathProgramCache]: Analyzing trace with hash -124173647, now seen corresponding path program 12 times [2018-11-18 10:52:36,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:52:36,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:52:36,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:52:36,157 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:52:36,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:52:36,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:52:36,940 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 66 proven. 281 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-18 10:52:36,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:52:36,940 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25f04ae1-e643-443a-91ff-e3c00beaa66b/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 10:52:36,946 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 10:52:37,346 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-11-18 10:52:37,346 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 10:52:37,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:52:37,368 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:37,369 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 10:52:37,378 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:37,379 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:37,379 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 10:52:37,379 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:52:37,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:52:37,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:52:37,387 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:19 [2018-11-18 10:52:37,505 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 69 treesize of output 53 [2018-11-18 10:52:37,506 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:37,507 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:37,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 10:52:37,508 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:52:37,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 59 [2018-11-18 10:52:37,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-18 10:52:37,524 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:52:37,534 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:52:37,538 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 10:52:37,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:52:37,548 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:90, output treesize:67 [2018-11-18 10:52:37,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 83 [2018-11-18 10:52:37,617 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:37,617 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:37,618 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:37,621 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:37,622 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:37,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 96 [2018-11-18 10:52:37,631 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-18 10:52:37,662 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 76 treesize of output 83 [2018-11-18 10:52:37,665 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:37,666 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 10:52:37,667 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:52:37,677 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:52:37,683 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 66 treesize of output 73 [2018-11-18 10:52:37,685 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:37,686 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:37,686 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 10:52:37,687 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 10:52:37,698 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:52:37,714 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 10:52:37,741 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 10:52:37,741 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:120, output treesize:167 [2018-11-18 10:52:37,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 141 [2018-11-18 10:52:38,002 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:38,004 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:38,005 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:38,006 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:38,017 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:38,019 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:38,025 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:38,030 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:38,034 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 5 case distinctions, treesize of input 57 treesize of output 170 [2018-11-18 10:52:38,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:52:38,072 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 117 treesize of output 122 [2018-11-18 10:52:38,075 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:38,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 43 [2018-11-18 10:52:38,078 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:52:38,091 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:52:38,109 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 10:52:38,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:52:38,173 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:333, output treesize:117 [2018-11-18 10:52:38,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 162 [2018-11-18 10:52:38,603 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:38,604 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:38,605 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:38,606 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:38,607 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:38,607 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:52:38,608 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:38,609 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:38,615 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:38,616 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:38,617 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:38,619 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:38,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 230 [2018-11-18 10:52:38,632 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-18 10:52:38,710 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 167 treesize of output 164 [2018-11-18 10:52:38,713 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:38,713 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:38,714 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:38,715 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:38,717 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 101 treesize of output 156 [2018-11-18 10:52:38,718 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:52:38,742 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:52:38,750 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 157 treesize of output 154 [2018-11-18 10:52:38,752 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:38,753 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:38,754 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:38,755 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:38,756 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:38,756 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:38,757 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 101 treesize of output 176 [2018-11-18 10:52:38,757 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 10:52:38,783 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:52:38,821 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 10:52:38,870 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 10:52:38,870 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:203, output treesize:349 [2018-11-18 10:52:39,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 209 treesize of output 181 [2018-11-18 10:52:39,011 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:39,013 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:39,014 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:39,016 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:39,019 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:39,021 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:39,022 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:39,025 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:39,030 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:39,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 51 treesize of output 179 [2018-11-18 10:52:39,040 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-18 10:52:39,119 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:39,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 177 [2018-11-18 10:52:39,123 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:39,123 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:39,124 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:39,125 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:39,126 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:39,128 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:39,130 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 118 treesize of output 174 [2018-11-18 10:52:39,130 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:52:39,158 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:52:39,165 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:52:39,166 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 162 treesize of output 166 [2018-11-18 10:52:39,169 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:39,170 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:39,171 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:39,172 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:39,173 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:39,173 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:39,174 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 117 treesize of output 173 [2018-11-18 10:52:39,174 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 10:52:39,203 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:52:39,252 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 10:52:39,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 219 treesize of output 191 [2018-11-18 10:52:39,463 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:39,466 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:39,467 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:39,470 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:39,471 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:39,474 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:39,482 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:39,488 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:39,491 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:39,495 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:39,506 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:39,523 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 10 case distinctions, treesize of input 72 treesize of output 244 [2018-11-18 10:52:39,524 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 3 xjuncts. [2018-11-18 10:52:39,614 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 173 treesize of output 168 [2018-11-18 10:52:39,617 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:39,618 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:39,619 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:39,621 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:39,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 158 [2018-11-18 10:52:39,626 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 10:52:39,652 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:52:39,661 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:39,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 177 [2018-11-18 10:52:39,666 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:39,667 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:39,668 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:39,671 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:39,672 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:39,675 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:39,676 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 191 [2018-11-18 10:52:39,677 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 10:52:39,717 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 10:52:39,764 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 10:52:39,905 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 13 dim-0 vars, and 4 xjuncts. [2018-11-18 10:52:39,906 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:429, output treesize:682 [2018-11-18 10:52:40,109 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 105 [2018-11-18 10:52:40,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 147 [2018-11-18 10:52:40,227 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:40,228 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:40,229 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:40,232 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:40,234 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:40,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 78 [2018-11-18 10:52:40,236 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 10:52:40,266 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:40,267 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:40,268 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:40,269 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:40,269 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:40,270 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:40,271 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:40,272 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:40,273 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:40,276 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:40,279 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:40,280 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:40,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 104 [2018-11-18 10:52:40,287 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-18 10:52:40,315 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:40,316 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:40,316 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:52:40,317 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:40,318 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:40,319 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:40,319 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:40,320 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:40,321 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:40,322 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:40,323 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:40,323 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:40,324 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:40,325 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:40,326 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:40,327 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:40,328 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:40,329 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:40,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 20 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 120 [2018-11-18 10:52:40,331 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:52:40,349 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:52:40,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 139 [2018-11-18 10:52:40,434 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:40,437 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:40,438 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:40,439 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:40,439 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:40,440 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:52:40,441 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:40,449 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:40,450 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:40,451 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:40,453 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:40,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 83 [2018-11-18 10:52:40,454 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 10:52:40,481 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:40,481 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:40,482 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:40,485 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:40,485 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 61 [2018-11-18 10:52:40,486 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 10:52:40,505 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:40,505 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:40,506 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:40,507 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:40,509 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:40,509 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:40,510 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:40,512 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:40,514 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:40,517 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:40,517 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:40,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 108 [2018-11-18 10:52:40,527 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 3 xjuncts. [2018-11-18 10:52:40,543 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:52:40,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 10:52:40,577 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 20 variables, input treesize:689, output treesize:36 [2018-11-18 10:52:40,755 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 33 proven. 297 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-11-18 10:52:40,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:52:40,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 26] total 46 [2018-11-18 10:52:42,281 WARN L180 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 216 DAG size of output: 159 [2018-11-18 10:52:42,579 WARN L180 SmtUtils]: Spent 292.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2018-11-18 10:52:42,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-18 10:52:42,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=1772, Unknown=0, NotChecked=0, Total=2070 [2018-11-18 10:52:42,579 INFO L87 Difference]: Start difference. First operand 2930 states and 3809 transitions. cyclomatic complexity: 922 Second operand 46 states. [2018-11-18 10:52:44,608 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 85 [2018-11-18 10:52:44,920 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 89 [2018-11-18 10:52:47,869 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 88 [2018-11-18 10:52:48,170 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 131 [2018-11-18 10:52:48,454 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 119 [2018-11-18 10:52:48,773 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 121 [2018-11-18 10:52:49,213 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 87 [2018-11-18 10:52:49,542 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 77 [2018-11-18 10:52:49,904 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 96 [2018-11-18 10:52:50,065 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 78 [2018-11-18 10:52:50,381 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 80 [2018-11-18 10:52:50,566 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 82 [2018-11-18 10:52:50,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:52:50,578 INFO L93 Difference]: Finished difference Result 5543 states and 7141 transitions. [2018-11-18 10:52:50,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-11-18 10:52:50,578 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5543 states and 7141 transitions. [2018-11-18 10:52:50,588 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 192 [2018-11-18 10:52:50,598 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5543 states to 5446 states and 7029 transitions. [2018-11-18 10:52:50,598 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 669 [2018-11-18 10:52:50,598 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 669 [2018-11-18 10:52:50,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5446 states and 7029 transitions. [2018-11-18 10:52:50,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:52:50,598 INFO L705 BuchiCegarLoop]: Abstraction has 5446 states and 7029 transitions. [2018-11-18 10:52:50,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5446 states and 7029 transitions. [2018-11-18 10:52:50,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5446 to 4160. [2018-11-18 10:52:50,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4160 states. [2018-11-18 10:52:50,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4160 states to 4160 states and 5377 transitions. [2018-11-18 10:52:50,635 INFO L728 BuchiCegarLoop]: Abstraction has 4160 states and 5377 transitions. [2018-11-18 10:52:50,635 INFO L608 BuchiCegarLoop]: Abstraction has 4160 states and 5377 transitions. [2018-11-18 10:52:50,635 INFO L442 BuchiCegarLoop]: ======== Iteration 33============ [2018-11-18 10:52:50,635 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4160 states and 5377 transitions. [2018-11-18 10:52:50,642 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 146 [2018-11-18 10:52:50,642 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:52:50,642 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:52:50,642 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 6, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2018-11-18 10:52:50,642 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 4, 4, 4, 4, 1, 1, 1, 1] [2018-11-18 10:52:50,643 INFO L794 eck$LassoCheckResult]: Stem: 51680#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 51677#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; 51646#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 51647#L558-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; 51660#L545-4 assume true; 51672#L545-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); 51673#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 51681#L545-4 assume true; 51682#L545-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); 51678#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 51679#L545-4 assume true; 51698#L545-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); 51697#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 51696#L545-4 assume true; 51695#L545-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); 51694#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 51693#L545-4 assume true; 51691#L545-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); 51692#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 51690#L545-4 assume true; 51670#L545-1 assume !(lis_~i~0 < lis_~N); 51671#L545-5 lis_~i~0 := 1; 51683#L547-4 assume true; 51815#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 51814#L548-4 assume true; 51813#L548-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; 51812#L549 assume !lis_#t~short11; 51811#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 51810#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 51809#L548-4 assume true; 51808#L548-1 assume !(lis_~j~0 < lis_~i~0); 51806#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 51805#L547-4 assume true; 51804#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 51803#L548-4 assume true; 51802#L548-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; 51801#L549 assume !lis_#t~short11; 51800#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 51799#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 51798#L548-4 assume true; 51797#L548-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; 51795#L549 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; 51796#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 52041#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 52040#L548-4 assume true; 52039#L548-1 assume !(lis_~j~0 < lis_~i~0); 52038#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 52037#L547-4 assume true; 52036#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 52035#L548-4 assume true; 52034#L548-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; 52032#L549 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; 52033#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 54861#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 54860#L548-4 assume true; 54859#L548-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; 54857#L549 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; 54858#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 54869#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 55094#L548-4 assume true; 55093#L548-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; 55092#L549 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; 55082#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 55078#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 55079#L548-4 assume true; 55246#L548-1 assume !(lis_~j~0 < lis_~i~0); 55245#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 55244#L547-4 assume true; 51656#L547-1 [2018-11-18 10:52:50,643 INFO L796 eck$LassoCheckResult]: Loop: 51656#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 51657#L548-4 assume true; 52331#L548-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; 52329#L549 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; 52325#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 52223#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 52324#L548-4 assume true; 52323#L548-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; 52322#L549 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; 52320#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 52218#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 52319#L548-4 assume true; 52318#L548-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; 52317#L549 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; 52315#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 52211#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 52310#L548-4 assume true; 52309#L548-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; 52287#L549 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; 52307#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 52205#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 52295#L548-4 assume true; 52286#L548-1 assume !(lis_~j~0 < lis_~i~0); 52284#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 51674#L547-4 assume true; 51656#L547-1 [2018-11-18 10:52:50,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:52:50,643 INFO L82 PathProgramCache]: Analyzing trace with hash 2072385878, now seen corresponding path program 13 times [2018-11-18 10:52:50,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:52:50,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:52:50,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:52:50,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:52:50,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:52:50,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:52:50,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:52:50,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:52:50,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1532608100, now seen corresponding path program 11 times [2018-11-18 10:52:50,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:52:50,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:52:50,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:52:50,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:52:50,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:52:50,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:52:50,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:52:50,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:52:50,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1730519377, now seen corresponding path program 14 times [2018-11-18 10:52:50,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:52:50,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:52:50,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:52:50,701 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:52:50,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:52:50,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:52:51,629 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 73 proven. 272 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-18 10:52:51,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:52:51,629 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25f04ae1-e643-443a-91ff-e3c00beaa66b/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 10:52:51,637 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 10:52:51,670 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 10:52:51,670 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 10:52:51,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:52:51,679 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:51,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 10:52:51,689 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:51,690 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:51,690 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 10:52:51,691 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:52:51,694 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:52:51,697 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 10:52:51,697 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:8 [2018-11-18 10:52:51,769 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 10:52:51,771 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:51,772 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:51,772 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 10:52:51,772 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:52:51,781 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 10:52:51,783 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 10:52:51,783 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:52:51,787 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:52:51,790 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 10:52:51,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:52:51,797 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:73, output treesize:46 [2018-11-18 10:52:51,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 79 [2018-11-18 10:52:51,928 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:51,929 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:51,933 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:51,935 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:51,936 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:51,940 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:51,956 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 49 treesize of output 121 [2018-11-18 10:52:51,957 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-11-18 10:52:51,991 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:51,993 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 68 treesize of output 77 [2018-11-18 10:52:51,995 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 32 treesize of output 16 [2018-11-18 10:52:51,995 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:52:52,002 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:52:52,006 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 61 treesize of output 60 [2018-11-18 10:52:52,008 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 22 treesize of output 11 [2018-11-18 10:52:52,008 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 10:52:52,014 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:52:52,025 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 10:52:52,040 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 10:52:52,041 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:117, output treesize:110 [2018-11-18 10:52:52,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 88 [2018-11-18 10:52:52,224 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:52,225 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:52,226 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:52,227 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:52,228 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:52,230 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:52,230 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:52:52,231 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:52,235 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:52,237 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:52,241 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:52,246 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:52,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 55 treesize of output 246 [2018-11-18 10:52:52,256 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-18 10:52:52,322 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 83 treesize of output 82 [2018-11-18 10:52:52,324 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:52,325 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 40 treesize of output 53 [2018-11-18 10:52:52,326 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:52:52,334 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:52:52,338 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 72 [2018-11-18 10:52:52,340 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:52,341 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:52,341 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 30 treesize of output 55 [2018-11-18 10:52:52,342 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 10:52:52,351 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:52:52,371 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 10:52:52,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 91 [2018-11-18 10:52:52,466 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:52,467 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:52,467 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:52,468 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:52,469 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:52,470 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:52:52,471 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:52,471 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:52,472 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:52,473 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:52,474 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:52,476 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:52,478 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:52,479 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 243 [2018-11-18 10:52:52,479 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 10:52:52,516 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 90 treesize of output 89 [2018-11-18 10:52:52,519 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:52,520 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:52:52,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 51 [2018-11-18 10:52:52,521 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 10:52:52,531 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:52:52,544 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:52:52,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2018-11-18 10:52:52,607 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 8 variables, input treesize:244, output treesize:289 [2018-11-18 10:52:52,987 WARN L180 SmtUtils]: Spent 326.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2018-11-18 10:52:53,274 WARN L180 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2018-11-18 10:52:53,332 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 247 proven. 70 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-11-18 10:52:53,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:52:53,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 17] total 41 [2018-11-18 10:52:56,759 WARN L180 SmtUtils]: Spent 3.41 s on a formula simplification. DAG size of input: 245 DAG size of output: 178 [2018-11-18 10:52:57,151 WARN L180 SmtUtils]: Spent 386.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-11-18 10:52:57,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-18 10:52:57,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=1425, Unknown=0, NotChecked=0, Total=1640 [2018-11-18 10:52:57,152 INFO L87 Difference]: Start difference. First operand 4160 states and 5377 transitions. cyclomatic complexity: 1275 Second operand 41 states. [2018-11-18 10:53:00,190 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 111 [2018-11-18 10:53:00,576 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 107 [2018-11-18 10:53:00,751 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 80 [2018-11-18 10:53:01,916 WARN L180 SmtUtils]: Spent 987.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 96 [2018-11-18 10:53:02,392 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 109 [2018-11-18 10:53:02,876 WARN L180 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 100 [2018-11-18 10:53:03,342 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 73 [2018-11-18 10:53:04,347 WARN L180 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 102 [2018-11-18 10:53:05,024 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 66 [2018-11-18 10:53:05,516 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 82 [2018-11-18 10:53:08,254 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 74 [2018-11-18 10:53:08,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:53:08,695 INFO L93 Difference]: Finished difference Result 16664 states and 21448 transitions. [2018-11-18 10:53:08,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-11-18 10:53:08,695 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16664 states and 21448 transitions. [2018-11-18 10:53:08,726 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 740 [2018-11-18 10:53:08,762 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16664 states to 16592 states and 21370 transitions. [2018-11-18 10:53:08,762 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2047 [2018-11-18 10:53:08,763 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2047 [2018-11-18 10:53:08,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16592 states and 21370 transitions. [2018-11-18 10:53:08,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:53:08,764 INFO L705 BuchiCegarLoop]: Abstraction has 16592 states and 21370 transitions. [2018-11-18 10:53:08,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16592 states and 21370 transitions. [2018-11-18 10:53:08,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16592 to 13055. [2018-11-18 10:53:08,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13055 states. [2018-11-18 10:53:08,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13055 states to 13055 states and 17002 transitions. [2018-11-18 10:53:08,950 INFO L728 BuchiCegarLoop]: Abstraction has 13055 states and 17002 transitions. [2018-11-18 10:53:08,950 INFO L608 BuchiCegarLoop]: Abstraction has 13055 states and 17002 transitions. [2018-11-18 10:53:08,951 INFO L442 BuchiCegarLoop]: ======== Iteration 34============ [2018-11-18 10:53:08,951 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13055 states and 17002 transitions. [2018-11-18 10:53:08,968 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 498 [2018-11-18 10:53:08,968 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:53:08,968 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:53:08,969 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 6, 6, 6, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-18 10:53:08,969 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 4, 4, 4, 3, 1, 1, 1, 1, 1] [2018-11-18 10:53:08,969 INFO L794 eck$LassoCheckResult]: Stem: 73052#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 73049#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; 73018#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 73019#L558-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; 73032#L545-4 assume true; 73043#L545-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); 73044#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 73053#L545-4 assume true; 73054#L545-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); 73050#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 73051#L545-4 assume true; 73073#L545-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); 73072#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 73071#L545-4 assume true; 73070#L545-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); 73069#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 73067#L545-4 assume true; 73068#L545-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); 73236#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 73062#L545-4 assume true; 73063#L545-1 assume !(lis_~i~0 < lis_~N); 73055#L545-5 lis_~i~0 := 1; 73056#L547-4 assume true; 73582#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 73581#L548-4 assume true; 73580#L548-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; 73579#L549 assume !lis_#t~short11; 73578#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 73577#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 73576#L548-4 assume true; 73575#L548-1 assume !(lis_~j~0 < lis_~i~0); 73573#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 73572#L547-4 assume true; 73571#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 73570#L548-4 assume true; 73569#L548-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; 73568#L549 assume !lis_#t~short11; 73567#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 73566#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 73565#L548-4 assume true; 73564#L548-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; 73563#L549 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; 73561#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 73559#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 73557#L548-4 assume true; 73555#L548-1 assume !(lis_~j~0 < lis_~i~0); 73553#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 73551#L547-4 assume true; 73549#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 73547#L548-4 assume true; 73545#L548-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; 73541#L549 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; 73542#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 74342#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 74341#L548-4 assume true; 74340#L548-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; 74338#L549 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; 74339#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 84551#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 84623#L548-4 assume true; 84622#L548-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; 84621#L549 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; 84618#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 84619#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 85101#L548-4 assume true; 85100#L548-1 assume !(lis_~j~0 < lis_~i~0); 85099#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 85098#L547-4 assume true; 74378#L547-1 [2018-11-18 10:53:08,969 INFO L796 eck$LassoCheckResult]: Loop: 74378#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 74377#L548-4 assume true; 74376#L548-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; 74375#L549 assume !lis_#t~short11; 74134#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 74132#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 74361#L548-4 assume true; 74360#L548-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; 74236#L549 assume !lis_#t~short11; 74125#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 74103#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 73871#L548-4 assume true; 73872#L548-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; 73962#L549 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; 73963#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 73856#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 73847#L548-4 assume true; 73848#L548-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; 73841#L549 assume !lis_#t~short11; 73843#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 73853#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 73854#L548-4 assume true; 73846#L548-1 assume !(lis_~j~0 < lis_~i~0); 73085#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 74380#L547-4 assume true; 74378#L547-1 [2018-11-18 10:53:08,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:53:08,970 INFO L82 PathProgramCache]: Analyzing trace with hash 2129644180, now seen corresponding path program 15 times [2018-11-18 10:53:08,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:53:08,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:53:08,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:53:08,970 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:53:08,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:53:09,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:53:10,325 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 28 proven. 139 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 10:53:10,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:53:10,325 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25f04ae1-e643-443a-91ff-e3c00beaa66b/bin-2019/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 10:53:10,339 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 10:53:10,519 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-18 10:53:10,519 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 10:53:10,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:53:10,531 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:10,532 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 10:53:10,543 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:10,544 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:10,544 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 10:53:10,545 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:53:10,553 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:53:10,562 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 10:53:10,562 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:11 [2018-11-18 10:53:10,667 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 10:53:10,669 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 10:53:10,669 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:53:10,677 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 10:53:10,685 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 10:53:10,685 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:53:10,689 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:53:10,692 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 10:53:10,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:53:10,701 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:50, output treesize:33 [2018-11-18 10:53:10,758 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 10:53:10,761 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:10,761 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 10:53:10,762 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:53:10,776 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 10:53:10,779 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:10,780 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:10,781 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 10:53:10,781 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:53:10,791 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:53:10,798 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 10:53:10,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:53:10,807 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:64, output treesize:47 [2018-11-18 10:53:10,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 72 treesize of output 60 [2018-11-18 10:53:10,873 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:10,874 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:10,875 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:10,876 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 10:53:10,876 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:53:10,892 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 10:53:10,895 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:10,895 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:10,896 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:10,897 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:10,898 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:10,898 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:10,899 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 10:53:10,899 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:53:10,940 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:53:10,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 10:53:10,956 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:53:10,957 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:82, output treesize:65 [2018-11-18 10:53:11,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 76 [2018-11-18 10:53:11,031 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:11,031 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:11,032 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:11,033 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:11,034 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:11,034 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:11,035 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 10:53:11,035 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:53:11,059 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 10:53:11,061 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:11,061 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:11,062 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:11,063 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:11,063 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:11,064 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:11,065 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:11,065 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:11,066 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:11,067 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:11,067 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:11,068 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:11,069 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 10:53:11,069 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:53:11,092 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:53:11,100 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 10:53:11,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:53:11,112 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:100, output treesize:83 [2018-11-18 10:53:11,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 92 [2018-11-18 10:53:11,197 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:11,198 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:11,199 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:11,200 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:11,201 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:11,202 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:11,203 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:11,204 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:11,206 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:11,207 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:11,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 126 [2018-11-18 10:53:11,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:53:11,241 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 88 [2018-11-18 10:53:11,244 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:11,244 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:11,245 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:11,246 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:11,247 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:11,247 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:11,248 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:11,249 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:11,250 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:11,250 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:11,251 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:11,252 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:11,252 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:11,253 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:11,254 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:11,255 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:11,256 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:11,257 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:11,258 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:11,259 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:11,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 254 [2018-11-18 10:53:11,260 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:53:11,307 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:53:11,318 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 10:53:11,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:53:11,334 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:118, output treesize:101 [2018-11-18 10:53:11,568 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:11,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, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 165 treesize of output 149 [2018-11-18 10:53:11,592 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:11,593 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:11,594 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:11,595 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:11,598 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:11,599 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:11,600 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:11,602 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:11,603 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:11,606 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:11,624 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:11,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 13 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 23 case distinctions, treesize of input 87 treesize of output 299 [2018-11-18 10:53:11,695 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 10:53:11,718 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 99 xjuncts. [2018-11-18 10:53:12,446 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:53:12,446 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 124 treesize of output 124 [2018-11-18 10:53:12,449 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,450 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,451 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,452 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,452 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:53:12,453 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,454 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,454 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,455 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,456 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,456 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,457 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,458 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,459 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,459 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,460 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,461 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,462 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,462 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,463 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,464 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 20 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 261 [2018-11-18 10:53:12,465 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:53:12,512 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:53:12,517 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,517 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 134 treesize of output 135 [2018-11-18 10:53:12,521 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,521 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,522 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,523 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,524 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,524 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,525 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,525 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,526 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,527 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,530 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,531 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,543 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,544 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:53:12,549 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,550 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,551 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,552 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,553 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,554 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,555 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,557 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,558 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,560 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 289 [2018-11-18 10:53:12,562 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 10:53:12,615 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:53:12,620 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:53:12,620 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 124 treesize of output 124 [2018-11-18 10:53:12,623 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,624 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,625 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,626 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,626 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,627 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,628 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,629 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,630 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,630 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,631 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,631 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:53:12,632 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,633 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,634 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,635 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,635 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,636 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,637 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,638 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,639 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,639 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,640 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 20 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 281 [2018-11-18 10:53:12,642 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 10:53:12,692 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:53:12,697 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:53:12,697 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 124 treesize of output 124 [2018-11-18 10:53:12,700 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,701 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,702 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,703 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,704 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,705 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,705 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,706 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,707 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,708 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,709 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,710 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,710 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:53:12,711 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,712 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,713 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,714 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,715 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,716 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,717 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,718 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,719 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,720 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,721 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 20 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 291 [2018-11-18 10:53:12,722 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 10:53:12,776 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:53:12,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 171 treesize of output 162 [2018-11-18 10:53:12,786 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,787 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,787 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,788 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,789 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,790 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,790 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,791 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,792 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,793 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,793 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,794 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,795 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,796 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,796 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,797 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,798 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,799 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,800 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,801 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,802 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,803 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,805 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,805 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,807 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 25 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 327 [2018-11-18 10:53:12,810 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-18 10:53:12,873 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:53:12,878 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,879 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 134 treesize of output 135 [2018-11-18 10:53:12,881 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,882 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,883 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,883 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,884 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,885 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,885 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,886 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:53:12,886 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,887 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,888 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,888 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,889 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,890 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,891 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,891 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,893 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,894 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,894 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,895 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,896 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,897 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 269 [2018-11-18 10:53:12,900 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-18 10:53:12,959 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:53:12,964 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:53:12,965 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 124 treesize of output 124 [2018-11-18 10:53:12,968 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,969 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,970 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,970 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,971 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,972 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,973 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,973 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,974 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,975 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,975 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,976 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,976 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,977 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,978 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:53:12,978 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,979 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,980 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,981 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,981 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,982 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,983 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,984 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,984 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,985 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:12,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 20 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 309 [2018-11-18 10:53:12,986 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-18 10:53:13,040 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:53:13,045 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 135 [2018-11-18 10:53:13,051 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,052 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,053 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,054 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,055 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,056 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,057 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,061 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,062 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,063 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,063 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,064 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,065 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,065 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,066 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:53:13,067 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,067 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,068 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,069 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,070 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,071 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,072 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,073 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,074 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,075 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 307 [2018-11-18 10:53:13,077 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-18 10:53:13,139 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:53:13,144 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,145 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 134 treesize of output 135 [2018-11-18 10:53:13,149 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,149 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,150 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,151 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,151 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:53:13,152 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,153 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,153 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,154 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,155 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,156 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,157 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,157 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,158 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,159 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,160 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,161 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,162 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,163 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,164 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,166 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 259 [2018-11-18 10:53:13,169 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-18 10:53:13,216 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:53:13,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 152 [2018-11-18 10:53:13,224 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,225 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,226 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,227 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,228 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,228 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,229 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,230 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,231 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,231 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,232 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,233 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,234 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,234 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,235 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,236 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,236 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,237 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,238 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,239 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,239 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,240 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,241 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,241 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,242 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,243 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,244 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,244 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,245 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,246 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 30 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 375 [2018-11-18 10:53:13,247 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-18 10:53:13,324 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:53:13,329 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:53:13,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 124 [2018-11-18 10:53:13,332 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,333 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,334 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,334 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,342 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,342 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,343 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,343 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:53:13,344 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,345 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,345 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,346 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,347 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,347 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,348 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,349 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,349 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,350 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,351 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,351 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,352 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,353 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 20 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 271 [2018-11-18 10:53:13,354 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-18 10:53:13,402 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:53:13,407 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 135 [2018-11-18 10:53:13,411 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,412 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,413 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,413 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,414 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,415 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,416 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,416 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,417 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,418 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,419 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,419 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:53:13,420 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,421 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,421 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,422 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,423 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,424 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,425 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,426 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,428 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,429 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,430 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:13,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 279 [2018-11-18 10:53:13,433 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-18 10:53:13,484 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:53:13,734 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 12 xjuncts. [2018-11-18 10:53:13,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 12 xjuncts. [2018-11-18 10:53:13,973 INFO L202 ElimStorePlain]: Needed 27 recursive calls to eliminate 2 variables, input treesize:175, output treesize:1529 [2018-11-18 10:53:14,341 WARN L180 SmtUtils]: Spent 283.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2018-11-18 10:53:14,712 WARN L180 SmtUtils]: Spent 278.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2018-11-18 10:53:15,293 WARN L180 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 88 [2018-11-18 10:53:15,308 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:15,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 153 [2018-11-18 10:53:15,313 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:15,314 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:15,315 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:15,316 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:53:15,317 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:15,318 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:15,319 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:15,320 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:15,321 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:15,322 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:15,323 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:15,324 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:15,324 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:53:15,325 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:15,326 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:15,327 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:53:15,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 12 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 253 [2018-11-18 10:53:15,328 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:53:15,382 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:15,384 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 137 treesize of output 138 [2018-11-18 10:53:15,387 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:15,388 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:15,389 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:15,389 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:15,390 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:15,391 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:15,392 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:15,393 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:15,393 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:15,394 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:53:15,395 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:15,395 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:15,397 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:15,398 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:15,399 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:15,400 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:15,401 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:15,402 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:15,402 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:15,403 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:15,404 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:53:15,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 20 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 303 [2018-11-18 10:53:15,406 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:53:15,449 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:53:15,468 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 10:54:34,035 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:54:34,036 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 198 treesize of output 178 [2018-11-18 10:54:34,041 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:54:34,042 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:54:34,048 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:54:34,048 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:54:34,049 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:54:34,050 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:54:34,050 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:54:34,051 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:54:34,052 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:54:34,052 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:54:34,053 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:54:34,054 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:54:34,055 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:54:34,056 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:54:34,056 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:54:34,059 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:54:34,066 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:54:34,067 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:54:34,068 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:54:34,081 INFO L477 Elim1Store]: Elim1 did not use 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 1 new quantified variables, introduced 7 case distinctions, treesize of input 112 treesize of output 411 [2018-11-18 10:54:34,082 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 3 xjuncts. [2018-11-18 10:54:34,233 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:54:34,235 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 159 treesize of output 158 [2018-11-18 10:54:34,238 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:54:34,239 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:54:34,239 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:54:34,240 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:54:34,241 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:54:34,241 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:54:34,242 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:54:34,242 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:54:34,243 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:54:34,244 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:54:34,244 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:54:34,245 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:54:34,246 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:54:34,246 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:54:34,247 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:54:34,248 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:54:34,249 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:54:34,250 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:54:34,252 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:54:34,252 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:54:34,254 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:54:34,255 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:54:34,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 22 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 328 [2018-11-18 10:54:34,256 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 10:54:34,301 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:54:34,304 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:54:34,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 141 [2018-11-18 10:54:34,309 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:54:34,310 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:54:34,310 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:54:34,311 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:54:34,312 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:54:34,313 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:54:34,314 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:54:34,314 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:54:34,315 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:54:34,316 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:54:34,316 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:54:34,317 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:54:34,318 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:54:34,318 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:54:34,319 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:54:34,320 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:54:34,321 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:54:34,322 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:54:34,322 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:54:34,323 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:54:34,324 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:54:34,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 20 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 287 [2018-11-18 10:54:34,325 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 10:54:34,368 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:54:34,411 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 10:55:20,946 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 190 treesize of output 152 [2018-11-18 10:55:20,950 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:20,951 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:20,952 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:20,955 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:20,956 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:20,956 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:55:20,959 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:20,960 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:20,961 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:20,963 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:20,964 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:20,965 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:20,966 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:20,971 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:20,972 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:20,974 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:20,979 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:20,980 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:20,981 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:20,990 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:20,991 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:20,992 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:20,998 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,003 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 23 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 12 case distinctions, treesize of input 81 treesize of output 391 [2018-11-18 10:55:21,042 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 8 xjuncts. [2018-11-18 10:55:21,349 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 148 treesize of output 137 [2018-11-18 10:55:21,352 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,353 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,354 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,354 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,355 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,356 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,357 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,357 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,358 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,358 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,359 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,360 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,360 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,361 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,362 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,362 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,363 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,364 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,364 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,365 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,366 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,371 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,372 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,373 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,373 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,374 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,375 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,375 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,376 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,377 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,377 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 31 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 424 [2018-11-18 10:55:21,378 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-18 10:55:21,441 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:55:21,446 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:55:21,447 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 169 treesize of output 165 [2018-11-18 10:55:21,450 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,450 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,451 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,452 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,453 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,453 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,454 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,454 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,455 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,456 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,456 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,457 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,458 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,458 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,459 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,460 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,460 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,461 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,461 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:55:21,465 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,466 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,466 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,467 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,467 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,468 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,469 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,469 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,470 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,471 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 26 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 418 [2018-11-18 10:55:21,472 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-18 10:55:21,537 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:55:21,544 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 137 treesize of output 126 [2018-11-18 10:55:21,547 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,548 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,548 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,549 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,550 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,551 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,551 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,552 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,553 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,553 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,554 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,555 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,555 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,556 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,557 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,557 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,558 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,559 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,559 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,560 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,561 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,562 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,563 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,563 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,564 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,565 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,566 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,567 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,567 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,568 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,569 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,569 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,570 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,571 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,571 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,572 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 36 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 506 [2018-11-18 10:55:21,573 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-18 10:55:21,647 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:55:21,651 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:55:21,652 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 149 treesize of output 147 [2018-11-18 10:55:21,655 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,655 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,656 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,657 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,657 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,658 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,659 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,659 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,660 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,660 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,661 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,662 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,662 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,663 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,664 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,664 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,665 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,666 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,666 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,667 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,667 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:55:21,668 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,669 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,669 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,670 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,671 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,671 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,672 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,673 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,673 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,674 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:21,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 25 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 431 [2018-11-18 10:55:21,675 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-18 10:55:21,741 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:55:21,832 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-18 10:55:53,161 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:53,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, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 153 [2018-11-18 10:55:53,164 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:53,165 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:53,166 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:53,166 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:53,167 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:55:53,167 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:53,168 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:53,169 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:53,170 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:53,170 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:55:53,171 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:53,172 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:53,172 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:53,173 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:53,173 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:55:53,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 12 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 244 [2018-11-18 10:55:53,175 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-18 10:55:53,227 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:53,229 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 137 treesize of output 138 [2018-11-18 10:55:53,232 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:53,233 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:53,234 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:53,235 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:53,235 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:53,236 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:53,237 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:53,237 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:55:53,238 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:53,239 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:53,239 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:53,240 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:53,241 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:53,242 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:53,243 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:53,243 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:53,244 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:53,245 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:53,246 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:53,247 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:53,248 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:55:53,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 290 [2018-11-18 10:55:53,249 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-18 10:55:53,289 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:55:53,306 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:56:10,051 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:10,052 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 194 treesize of output 174 [2018-11-18 10:56:10,058 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:10,067 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:10,068 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:10,069 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:10,070 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:10,070 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:56:10,071 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:10,072 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:10,073 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:10,074 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:10,075 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:10,076 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:10,077 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:10,077 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:56:10,078 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:10,082 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:10,094 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:10,107 INFO L477 Elim1Store]: Elim1 did not use 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 1 new quantified variables, introduced 8 case distinctions, treesize of input 110 treesize of output 337 [2018-11-18 10:56:10,108 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 3 xjuncts. [2018-11-18 10:56:10,218 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:10,220 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 133 [2018-11-18 10:56:10,222 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:10,223 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:10,224 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:56:10,224 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:10,225 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:10,226 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:10,227 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:10,227 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:10,228 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:10,229 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:10,230 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:10,230 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:10,231 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:56:10,232 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:10,232 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:10,233 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:10,234 INFO L477 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 241 [2018-11-18 10:56:10,234 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-18 10:56:10,269 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:56:10,273 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:10,275 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 172 treesize of output 169 [2018-11-18 10:56:10,278 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:10,279 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:10,280 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:10,280 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:10,281 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:10,282 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:10,282 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:56:10,283 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:10,283 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:10,284 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:10,285 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:10,285 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:10,286 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:10,287 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:10,288 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:10,289 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:10,290 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:10,293 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 299 [2018-11-18 10:56:10,294 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-18 10:56:10,332 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:56:10,371 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 10:56:19,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 214 treesize of output 180 [2018-11-18 10:56:19,168 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,169 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,170 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,171 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,171 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:56:19,174 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,175 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,176 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,177 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,178 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,179 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,180 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,181 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,182 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,183 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,186 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,193 INFO L477 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 4 case distinctions, treesize of input 54 treesize of output 206 [2018-11-18 10:56:19,193 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 2 xjuncts. [2018-11-18 10:56:19,304 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 135 treesize of output 124 [2018-11-18 10:56:19,308 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,309 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,310 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,311 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,313 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,314 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,315 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,316 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,318 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,319 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,321 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,322 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,323 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,325 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,326 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,327 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,328 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,329 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,330 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,332 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,333 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,334 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,335 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,336 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,338 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,340 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,342 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,343 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,345 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,347 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,348 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,349 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,350 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,352 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,353 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,354 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 36 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 504 [2018-11-18 10:56:19,355 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-11-18 10:56:19,429 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:56:19,432 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:56:19,434 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 135 treesize of output 133 [2018-11-18 10:56:19,437 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,438 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,439 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,440 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,440 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,441 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,442 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,443 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,443 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,444 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,445 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,446 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,447 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,447 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,448 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,448 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:56:19,449 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,461 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,465 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,466 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,467 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,468 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,469 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,469 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,470 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,471 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,472 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,472 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,473 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,474 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,475 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,476 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,476 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,477 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:19,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 30 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 470 [2018-11-18 10:56:19,478 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-11-18 10:56:19,545 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:56:19,593 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 10:56:24,090 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:24,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 153 [2018-11-18 10:56:24,094 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:24,095 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:24,096 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:56:24,096 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:24,097 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:24,098 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:24,099 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:24,100 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:24,101 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:24,101 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:56:24,102 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:24,103 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:24,104 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:24,105 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:24,106 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:56:24,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 12 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 244 [2018-11-18 10:56:24,106 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-11-18 10:56:24,157 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:24,159 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 126 treesize of output 127 [2018-11-18 10:56:24,162 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:24,162 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:24,163 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:56:24,163 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:24,164 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:24,165 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:24,166 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:24,166 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:24,167 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:24,168 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:24,169 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:24,170 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:24,171 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:24,172 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:24,173 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:24,173 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:24,174 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:24,175 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:24,176 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:24,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, 20 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 288 [2018-11-18 10:56:24,177 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-11-18 10:56:24,216 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:56:24,233 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:56:27,092 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:27,097 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 173 treesize of output 157 [2018-11-18 10:56:27,100 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:27,101 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:27,102 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:27,102 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:56:27,103 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:27,103 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:27,104 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:56:27,105 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:27,105 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:27,106 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:27,107 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:27,107 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:27,108 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:27,109 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:27,110 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:27,110 INFO L477 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 277 [2018-11-18 10:56:27,111 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-11-18 10:56:27,165 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:27,165 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 127 treesize of output 128 [2018-11-18 10:56:27,169 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:27,169 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:27,170 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:27,170 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:56:27,171 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:27,172 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:27,173 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:27,174 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:27,174 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:27,175 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:27,178 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:27,179 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:27,179 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:27,180 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:27,181 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:27,182 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:27,183 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:27,184 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:27,185 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:27,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 20 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 301 [2018-11-18 10:56:27,186 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-11-18 10:56:27,224 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:56:27,242 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:56:28,935 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:28,936 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 194 treesize of output 174 [2018-11-18 10:56:28,943 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:28,950 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:28,951 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:28,951 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:56:28,952 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:28,953 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:28,954 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:28,955 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:28,956 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:28,957 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:28,957 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:56:28,958 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:28,959 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:28,960 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:28,966 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:28,977 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:28,990 INFO L477 Elim1Store]: Elim1 did not use 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 1 new quantified variables, introduced 8 case distinctions, treesize of input 110 treesize of output 328 [2018-11-18 10:56:28,991 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 3 xjuncts. [2018-11-18 10:56:29,128 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:29,130 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 172 treesize of output 169 [2018-11-18 10:56:29,133 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:29,134 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:29,134 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:29,135 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:29,136 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:29,136 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:56:29,137 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:29,137 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:29,138 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:29,138 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:29,139 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:29,141 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:29,141 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:29,142 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:29,143 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:29,143 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:29,147 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:29,147 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 283 [2018-11-18 10:56:29,148 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-11-18 10:56:29,185 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:56:29,189 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:29,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 132 treesize of output 133 [2018-11-18 10:56:29,193 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:29,194 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:29,194 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:29,195 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:29,196 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:29,196 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:29,197 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:56:29,197 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:29,198 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:29,198 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:29,199 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:29,200 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:29,200 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:29,201 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:29,202 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:56:29,202 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:29,203 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:29,203 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:29,204 INFO L477 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 250 [2018-11-18 10:56:29,204 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-11-18 10:56:29,241 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:56:29,282 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 10:56:30,358 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:30,358 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 194 treesize of output 174 [2018-11-18 10:56:30,363 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:30,363 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:30,364 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:30,365 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:30,365 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:56:30,366 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:30,368 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:30,369 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:30,370 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:30,370 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:56:30,372 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:30,373 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:30,374 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:30,375 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:30,383 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:30,386 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:30,403 INFO L477 Elim1Store]: Elim1 did not use 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 1 new quantified variables, introduced 8 case distinctions, treesize of input 110 treesize of output 328 [2018-11-18 10:56:30,404 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 3 xjuncts. [2018-11-18 10:56:30,518 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:30,519 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 133 [2018-11-18 10:56:30,522 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:30,523 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:30,524 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:30,524 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:30,525 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:30,525 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:30,526 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:30,527 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:30,527 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:30,528 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:30,528 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:30,529 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:56:30,529 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:30,530 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:30,531 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:30,531 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:30,532 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:30,533 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:30,533 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:56:30,534 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:30,535 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:30,535 INFO L477 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 311 [2018-11-18 10:56:30,535 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-11-18 10:56:30,588 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:56:30,591 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:30,593 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 172 treesize of output 169 [2018-11-18 10:56:30,597 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:30,598 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:30,598 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:30,599 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:30,600 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:30,601 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:30,601 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:30,602 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:30,603 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:30,603 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:56:30,604 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:30,604 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:30,606 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:30,607 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:30,608 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:30,609 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:30,613 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:30,614 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:30,615 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 310 [2018-11-18 10:56:30,615 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-11-18 10:56:30,656 INFO L267 ElimStorePlain]: Start of recursive call 56: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:56:30,698 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 10:56:31,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 20 dim-0 vars, 10 dim-2 vars, End of recursive call: 36 dim-0 vars, and 18 xjuncts. [2018-11-18 10:56:31,339 INFO L202 ElimStorePlain]: Needed 57 recursive calls to eliminate 30 variables, input treesize:1865, output treesize:2603 [2018-11-18 10:56:32,362 WARN L180 SmtUtils]: Spent 744.00 ms on a formula simplification that was a NOOP. DAG size: 532 [2018-11-18 10:56:33,468 WARN L180 SmtUtils]: Spent 790.00 ms on a formula simplification that was a NOOP. DAG size: 551 [2018-11-18 10:56:34,637 WARN L180 SmtUtils]: Spent 756.00 ms on a formula simplification that was a NOOP. DAG size: 553 [2018-11-18 10:56:35,567 WARN L180 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 554 DAG size of output: 196 [2018-11-18 10:56:35,580 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-18 10:56:35,580 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 10:56:35,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 130 [2018-11-18 10:56:35,829 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:35,831 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:35,832 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:35,833 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:35,833 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:35,834 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:35,835 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:35,835 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:35,836 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:35,837 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:35,839 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:35,841 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:35,842 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:35,842 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:35,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 187 [2018-11-18 10:56:35,858 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-18 10:56:35,892 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:35,893 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:35,894 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:35,894 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:35,895 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:35,895 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:35,896 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:35,896 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:35,897 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:35,897 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:35,898 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:56:35,899 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:35,900 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:35,903 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:35,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 124 [2018-11-18 10:56:35,903 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:56:35,918 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:56:36,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 129 [2018-11-18 10:56:36,133 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,134 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,134 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,135 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,135 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,136 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,140 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,140 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,141 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,142 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,142 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,143 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,145 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,150 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 187 [2018-11-18 10:56:36,162 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-18 10:56:36,195 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,196 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,196 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,197 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,197 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,198 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,198 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,199 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,199 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,200 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,201 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:56:36,202 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,202 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,205 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 124 [2018-11-18 10:56:36,206 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 10:56:36,220 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:56:36,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 103 [2018-11-18 10:56:36,393 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,394 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,394 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,395 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,395 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,396 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,397 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,397 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,398 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,398 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,399 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,399 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,400 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:56:36,400 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,401 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,401 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,402 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 43 treesize of output 130 [2018-11-18 10:56:36,403 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 10:56:36,431 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,432 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,432 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,433 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,433 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,434 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,434 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,435 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,435 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,436 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:56:36,436 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 77 [2018-11-18 10:56:36,437 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 10:56:36,448 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:56:36,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 97 [2018-11-18 10:56:36,764 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,765 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,765 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,766 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,766 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,767 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,768 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,768 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,769 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,769 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:56:36,770 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 77 [2018-11-18 10:56:36,771 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-18 10:56:36,792 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,792 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,793 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,793 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,794 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,795 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,795 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,796 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,796 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,797 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,798 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,798 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,799 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,800 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,800 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,801 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,801 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:56:36,802 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 41 treesize of output 124 [2018-11-18 10:56:36,803 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-18 10:56:36,820 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:56:36,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 102 [2018-11-18 10:56:36,955 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,955 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,956 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,957 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,957 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,958 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,958 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,959 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,959 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,960 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,961 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,961 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,962 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,962 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,963 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,963 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,964 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:56:36,964 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 41 treesize of output 124 [2018-11-18 10:56:36,965 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-18 10:56:36,995 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,996 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,996 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,997 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,997 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,998 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,998 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,999 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:36,999 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,000 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:56:37,000 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 77 [2018-11-18 10:56:37,001 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-18 10:56:37,013 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:56:37,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 111 [2018-11-18 10:56:37,130 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,131 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,131 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,132 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,133 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,133 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,134 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,134 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,137 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,138 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,138 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,139 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:56:37,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 77 [2018-11-18 10:56:37,139 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-18 10:56:37,161 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,162 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,162 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,163 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,163 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,164 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,164 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,165 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,166 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,166 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,167 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,167 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,168 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,168 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,169 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:56:37,169 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,170 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,171 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 43 treesize of output 130 [2018-11-18 10:56:37,172 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-18 10:56:37,194 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:56:37,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 97 [2018-11-18 10:56:37,288 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,289 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,290 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,291 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,292 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,292 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,293 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,294 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,295 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,295 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,297 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,297 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:56:37,298 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,299 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,299 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,300 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,301 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 41 treesize of output 124 [2018-11-18 10:56:37,301 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-18 10:56:37,328 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,328 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,330 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,331 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,331 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,332 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,332 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,333 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,333 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,334 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:56:37,334 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 77 [2018-11-18 10:56:37,335 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-18 10:56:37,358 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:56:37,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 100 [2018-11-18 10:56:37,520 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,521 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,521 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,522 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,522 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,523 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,523 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,524 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,524 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,525 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,526 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,526 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,527 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,528 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,528 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,529 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,530 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,530 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,531 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,531 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:56:37,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 43 treesize of output 130 [2018-11-18 10:56:37,532 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-18 10:56:37,596 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,596 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,597 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,597 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,598 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,598 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,599 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,599 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,600 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,600 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:56:37,601 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 77 [2018-11-18 10:56:37,602 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-18 10:56:37,613 INFO L267 ElimStorePlain]: Start of recursive call 24: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:56:37,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 129 [2018-11-18 10:56:37,680 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,683 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,684 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,685 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,686 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,687 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,688 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,689 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,690 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,691 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,694 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,696 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,698 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,699 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 187 [2018-11-18 10:56:37,715 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 2 xjuncts. [2018-11-18 10:56:37,755 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,758 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,767 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,768 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,769 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,769 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,770 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,771 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,772 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,772 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,776 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:56:37,777 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,778 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,779 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:56:37,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 128 [2018-11-18 10:56:37,780 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-18 10:56:37,796 INFO L267 ElimStorePlain]: Start of recursive call 27: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:56:37,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 36 dim-0 vars, 12 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 10:56:37,835 INFO L202 ElimStorePlain]: Needed 29 recursive calls to eliminate 48 variables, input treesize:1717, output treesize:32 [2018-11-18 10:56:38,178 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 7 proven. 143 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-18 10:56:38,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 10:56:38,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-18 10:56:38,194 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:56:38,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:56:38,194 INFO L82 PathProgramCache]: Analyzing trace with hash 2098078630, now seen corresponding path program 1 times [2018-11-18 10:56:38,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:56:38,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:56:38,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:56:38,195 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:56:38,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:56:38,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:56:38,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:56:38,380 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 106 [2018-11-18 10:56:38,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-18 10:56:38,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=2100, Unknown=0, NotChecked=0, Total=2256 [2018-11-18 10:56:38,404 INFO L87 Difference]: Start difference. First operand 13055 states and 17002 transitions. cyclomatic complexity: 4144 Second operand 48 states. [2018-11-18 10:56:40,352 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 71 [2018-11-18 10:56:40,751 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 68 [2018-11-18 10:56:41,533 WARN L180 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 98 [2018-11-18 10:56:42,284 WARN L180 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 87 [2018-11-18 10:56:42,828 WARN L180 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 78 [2018-11-18 10:56:43,352 WARN L180 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 79 [2018-11-18 10:56:55,861 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 70 [2018-11-18 10:56:57,041 WARN L180 SmtUtils]: Spent 881.00 ms on a formula simplification. DAG size of input: 570 DAG size of output: 298 [2018-11-18 10:56:57,443 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 67 [2018-11-18 10:56:57,841 WARN L180 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 91 [2018-11-18 10:56:58,933 WARN L180 SmtUtils]: Spent 832.00 ms on a formula simplification. DAG size of input: 603 DAG size of output: 306 [2018-11-18 10:56:59,222 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 72 [2018-11-18 10:57:00,364 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 67 [2018-11-18 10:57:01,622 WARN L180 SmtUtils]: Spent 828.00 ms on a formula simplification. DAG size of input: 609 DAG size of output: 308 [2018-11-18 10:57:02,806 WARN L180 SmtUtils]: Spent 609.00 ms on a formula simplification. DAG size of input: 619 DAG size of output: 225 [2018-11-18 10:57:03,106 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 82 [2018-11-18 10:57:03,879 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 74 [2018-11-18 10:57:04,470 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 75 [2018-11-18 10:57:05,201 WARN L180 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 582 DAG size of output: 123 [2018-11-18 10:57:05,447 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 70 [2018-11-18 10:57:05,963 WARN L180 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 615 DAG size of output: 126 [2018-11-18 10:57:06,260 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 84 [2018-11-18 10:57:07,188 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 85 [2018-11-18 10:57:20,489 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 76 [2018-11-18 10:57:21,007 WARN L180 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 268 DAG size of output: 128 [2018-11-18 10:57:21,297 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 74 [2018-11-18 10:57:22,127 WARN L180 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 272 DAG size of output: 129 [2018-11-18 10:57:22,894 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 74 [2018-11-18 10:57:23,813 WARN L180 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 114 [2018-11-18 10:57:24,333 WARN L180 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 89 [2018-11-18 10:57:24,961 WARN L180 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 78 [2018-11-18 10:57:25,396 WARN L180 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 79 [2018-11-18 10:57:26,524 WARN L180 SmtUtils]: Spent 771.00 ms on a formula simplification. DAG size of input: 544 DAG size of output: 292 [2018-11-18 10:57:26,760 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 66 [2018-11-18 10:57:27,809 WARN L180 SmtUtils]: Spent 782.00 ms on a formula simplification. DAG size of input: 563 DAG size of output: 301 [2018-11-18 10:57:28,235 WARN L180 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 100 [2018-11-18 10:57:28,444 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 63 [2018-11-18 10:57:29,057 WARN L180 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 101 [2018-11-18 10:57:42,296 WARN L180 SmtUtils]: Spent 773.00 ms on a formula simplification. DAG size of input: 578 DAG size of output: 312 [2018-11-18 10:57:42,699 WARN L180 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 91 [2018-11-18 10:57:43,243 WARN L180 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 202 [2018-11-18 10:57:43,793 WARN L180 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 204 [2018-11-18 10:57:44,187 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 119 [2018-11-18 10:57:45,175 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 67 [2018-11-18 10:57:45,795 WARN L180 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 108 [2018-11-18 10:57:46,719 WARN L180 SmtUtils]: Spent 481.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 95 [2018-11-18 10:57:47,449 WARN L180 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 116 [2018-11-18 10:57:48,207 WARN L180 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 91 [2018-11-18 10:57:48,803 WARN L180 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 81 [2018-11-18 10:57:49,416 WARN L180 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 82 [2018-11-18 10:57:49,986 WARN L180 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 199 [2018-11-18 10:57:50,264 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 114 [2018-11-18 10:57:50,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:57:50,360 INFO L93 Difference]: Finished difference Result 21406 states and 27936 transitions. [2018-11-18 10:57:50,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-11-18 10:57:50,360 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21406 states and 27936 transitions. [2018-11-18 10:57:50,390 INFO L131 ngComponentsAnalysis]: Automaton has 84 accepting balls. 989 [2018-11-18 10:57:50,419 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21406 states to 21406 states and 27936 transitions. [2018-11-18 10:57:50,419 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2941 [2018-11-18 10:57:50,421 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2941 [2018-11-18 10:57:50,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21406 states and 27936 transitions. [2018-11-18 10:57:50,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:57:50,427 INFO L705 BuchiCegarLoop]: Abstraction has 21406 states and 27936 transitions. [2018-11-18 10:57:50,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21406 states and 27936 transitions. [2018-11-18 10:57:50,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21406 to 13061. [2018-11-18 10:57:50,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13061 states. [2018-11-18 10:57:50,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13061 states to 13061 states and 17021 transitions. [2018-11-18 10:57:50,530 INFO L728 BuchiCegarLoop]: Abstraction has 13061 states and 17021 transitions. [2018-11-18 10:57:50,531 INFO L608 BuchiCegarLoop]: Abstraction has 13061 states and 17021 transitions. [2018-11-18 10:57:50,531 INFO L442 BuchiCegarLoop]: ======== Iteration 35============ [2018-11-18 10:57:50,531 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13061 states and 17021 transitions. [2018-11-18 10:57:50,550 INFO L131 ngComponentsAnalysis]: Automaton has 35 accepting balls. 543 [2018-11-18 10:57:50,550 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:57:50,550 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:57:50,550 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 6, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2018-11-18 10:57:50,550 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1] [2018-11-18 10:57:50,551 INFO L794 eck$LassoCheckResult]: Stem: 108026#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 108023#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; 107993#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 107994#L558-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; 108007#L545-4 assume true; 108017#L545-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); 108018#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 108027#L545-4 assume true; 108028#L545-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); 108024#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 108025#L545-4 assume true; 108047#L545-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); 108046#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 108045#L545-4 assume true; 108044#L545-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); 108043#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 108041#L545-4 assume true; 108042#L545-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); 108038#L545-3 lis_#t~post4 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post4;havoc lis_#t~post4; 108039#L545-4 assume true; 108015#L545-1 assume !(lis_~i~0 < lis_~N); 108016#L545-5 lis_~i~0 := 1; 108179#L547-4 assume true; 108177#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 108176#L548-4 assume true; 108175#L548-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; 108174#L549 assume !lis_#t~short11; 108173#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 108172#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 108171#L548-4 assume true; 108170#L548-1 assume !(lis_~j~0 < lis_~i~0); 108168#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 108167#L547-4 assume true; 108166#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 108165#L548-4 assume true; 108164#L548-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; 108163#L549 assume !lis_#t~short11; 108162#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 108161#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 108160#L548-4 assume true; 108159#L548-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; 108157#L549 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; 108158#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 108622#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 108618#L548-4 assume true; 108619#L548-1 assume !(lis_~j~0 < lis_~i~0); 108614#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 108615#L547-4 assume true; 108610#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 108611#L548-4 assume true; 108606#L548-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; 108607#L549 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; 108736#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 109650#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 109649#L548-4 assume true; 109648#L548-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; 109645#L549 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; 109646#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 119402#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 119718#L548-4 assume true; 119717#L548-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; 119716#L549 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; 119715#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 119387#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 119708#L548-4 assume true; 119703#L548-1 assume !(lis_~j~0 < lis_~i~0); 119685#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 119684#L547-4 assume true; 109382#L547-1 [2018-11-18 10:57:50,551 INFO L796 eck$LassoCheckResult]: Loop: 109382#L547-1 assume !!(lis_~i~0 < lis_~N);lis_~j~0 := 0; 109381#L548-4 assume true; 109379#L548-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; 109380#L549 assume !lis_#t~short11; 108116#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 109375#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 109559#L548-4 assume true; 109558#L548-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; 109555#L549 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; 109517#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 109514#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 109513#L548-4 assume true; 109512#L548-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; 109457#L549 assume !lis_#t~short11; 109456#L549-2 assume !lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;havoc lis_#t~short11;havoc lis_#t~mem8; 109454#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 109453#L548-4 assume true; 109452#L548-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; 109390#L549 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; 109411#L549-2 assume lis_#t~short11;havoc lis_#t~mem9;havoc lis_#t~mem10;havoc lis_#t~mem7;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); 108193#L548-3 lis_#t~post6 := lis_~j~0;lis_~j~0 := 1 + lis_#t~post6;havoc lis_#t~post6; 109393#L548-4 assume true; 109386#L548-1 assume !(lis_~j~0 < lis_~i~0); 109385#L547-3 lis_#t~post5 := lis_~i~0;lis_~i~0 := 1 + lis_#t~post5;havoc lis_#t~post5; 109384#L547-4 assume true; 109382#L547-1 [2018-11-18 10:57:50,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:57:50,551 INFO L82 PathProgramCache]: Analyzing trace with hash 2072385878, now seen corresponding path program 16 times [2018-11-18 10:57:50,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:57:50,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:57:50,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:57:50,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:57:50,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:57:50,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:57:50,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:57:50,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:57:50,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1161572636, now seen corresponding path program 12 times [2018-11-18 10:57:50,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:57:50,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:57:50,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:57:50,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:57:50,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:57:50,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:57:50,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:57:50,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:57:50,614 INFO L82 PathProgramCache]: Analyzing trace with hash -129732817, now seen corresponding path program 17 times [2018-11-18 10:57:50,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:57:50,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:57:50,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:57:50,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:57:50,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:57:50,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:57:51,672 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 51 proven. 296 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-18 10:57:51,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:57:51,672 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25f04ae1-e643-443a-91ff-e3c00beaa66b/bin-2019/uautomizer/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 10:57:51,682 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 10:57:52,813 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-11-18 10:57:52,813 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 10:57:52,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:57:52,821 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 10:57:52,825 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:57:52,826 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:57:52,826 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 10:57:52,826 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:57:52,829 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:57:52,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:57:52,833 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:15 [2018-11-18 10:57:53,061 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 64 [2018-11-18 10:57:53,065 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:57:53,065 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:57:53,066 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:57:53,067 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:57:53,068 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:57:53,068 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:57:53,073 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:57:53,075 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 0 case distinctions, treesize of input 50 treesize of output 128 [2018-11-18 10:57:53,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:57:53,112 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:57:53,113 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:57:53,114 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 55 treesize of output 90 [2018-11-18 10:57:53,114 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 10:57:53,149 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 56 treesize of output 61 [2018-11-18 10:57:53,151 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 10:57:53,151 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 10:57:53,158 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:57:53,183 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 40 treesize of output 41 [2018-11-18 10:57:53,184 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 10:57:53,184 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 10:57:53,190 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:57:53,212 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 10:57:53,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 10:57:53,229 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 1 variables, input treesize:95, output treesize:125 [2018-11-18 10:57:53,753 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 76 [2018-11-18 10:57:53,943 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 80 [2018-11-18 10:57:53,947 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:57:53,954 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:57:53,966 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:57:53,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 149 [2018-11-18 10:57:53,973 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:57:53,975 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:57:53,982 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:57:53,983 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:57:53,984 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:57:54,000 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:57:54,001 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:57:54,023 INFO L477 Elim1Store]: Elim1 applied some 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 4 new quantified variables, introduced 9 case distinctions, treesize of input 75 treesize of output 218 [2018-11-18 10:57:54,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 10:57:54,137 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:57:54,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 149 [2018-11-18 10:57:54,144 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:57:54,145 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:57:54,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 47 [2018-11-18 10:57:54,145 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:57:54,165 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:57:54,168 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:57:54,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 152 [2018-11-18 10:57:54,176 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:57:54,177 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:57:54,177 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 22 treesize of output 47 [2018-11-18 10:57:54,177 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 10:57:54,197 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:57:54,204 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 113 treesize of output 120 [2018-11-18 10:57:54,207 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:57:54,208 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:57:54,208 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 22 treesize of output 47 [2018-11-18 10:57:54,208 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 10:57:54,224 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:57:54,232 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 136 treesize of output 143 [2018-11-18 10:57:54,235 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:57:54,236 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:57:54,236 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 22 treesize of output 47 [2018-11-18 10:57:54,236 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 10:57:54,254 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:57:54,315 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 10:57:54,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2018-11-18 10:57:54,393 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 2 variables, input treesize:173, output treesize:625 [2018-11-18 10:57:54,690 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 116 [2018-11-18 10:58:01,351 WARN L180 SmtUtils]: Spent 6.57 s on a formula simplification that was a NOOP. DAG size: 118 [2018-11-18 10:58:08,449 WARN L180 SmtUtils]: Spent 6.99 s on a formula simplification that was a NOOP. DAG size: 118 [2018-11-18 10:58:24,128 WARN L180 SmtUtils]: Spent 15.44 s on a formula simplification. DAG size of input: 126 DAG size of output: 125 [2018-11-18 10:58:24,134 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:24,135 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:24,138 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:24,141 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:24,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 202 [2018-11-18 10:58:24,151 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:24,152 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:24,153 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:24,153 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:58:24,159 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:58:24,160 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:24,170 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 99 treesize of output 192 [2018-11-18 10:58:24,171 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 10:58:24,254 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:24,255 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:24,260 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:24,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 167 [2018-11-18 10:58:24,263 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:24,264 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:24,265 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:24,265 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 41 treesize of output 59 [2018-11-18 10:58:24,266 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:58:24,285 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:58:24,288 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:24,289 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:24,293 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:24,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 160 [2018-11-18 10:58:24,296 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:24,297 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:24,298 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:24,298 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 41 treesize of output 59 [2018-11-18 10:58:24,298 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 10:58:24,317 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:58:24,320 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:24,320 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:24,325 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:24,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 160 [2018-11-18 10:58:24,329 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:24,330 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:24,330 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:24,331 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 41 treesize of output 59 [2018-11-18 10:58:24,331 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 10:58:24,351 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:58:24,402 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 10:58:24,570 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:24,571 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:24,575 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:24,578 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:24,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 194 treesize of output 205 [2018-11-18 10:58:24,585 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:24,588 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:24,590 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:24,591 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:24,594 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:24,595 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:58:24,601 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:24,608 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:24,611 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:24,612 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:24,621 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:24,622 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:24,635 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 101 treesize of output 277 [2018-11-18 10:58:24,636 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-18 10:58:24,806 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:24,807 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:24,813 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:24,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 179 [2018-11-18 10:58:24,817 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:24,818 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:24,819 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:24,819 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 41 treesize of output 59 [2018-11-18 10:58:24,820 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-18 10:58:24,843 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:58:24,846 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:24,847 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:24,853 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:24,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 186 [2018-11-18 10:58:24,857 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:24,858 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:24,859 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:24,859 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 41 treesize of output 59 [2018-11-18 10:58:24,859 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-18 10:58:24,884 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:58:24,886 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:24,888 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:24,893 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:24,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 177 [2018-11-18 10:58:24,897 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:24,898 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:24,899 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:24,899 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 41 treesize of output 59 [2018-11-18 10:58:24,899 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-18 10:58:24,922 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:58:24,988 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-18 10:58:25,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-11-18 10:58:25,170 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 4 variables, input treesize:386, output treesize:798 [2018-11-18 10:58:25,366 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 57 [2018-11-18 10:58:25,746 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:25,748 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:25,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 165 treesize of output 143 [2018-11-18 10:58:25,768 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:25,769 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:25,771 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:25,772 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:25,773 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:25,775 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:58:25,785 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:25,787 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:25,788 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:25,788 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:58:25,789 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:25,790 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:25,828 INFO L477 Elim1Store]: Elim1 applied some 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 6 new quantified variables, introduced 15 case distinctions, treesize of input 52 treesize of output 197 [2018-11-18 10:58:25,829 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-11-18 10:58:25,934 INFO L267 ElimStorePlain]: Start of recursive call 3: 72 dim-0 vars, End of recursive call: 72 dim-0 vars, and 84 xjuncts. [2018-11-18 10:58:27,487 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:27,491 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:27,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 174 [2018-11-18 10:58:27,497 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:27,497 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:58:27,498 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 0 case distinctions, treesize of input 39 treesize of output 46 [2018-11-18 10:58:27,498 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:58:27,522 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:58:27,527 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:27,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 164 [2018-11-18 10:58:27,535 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:27,536 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:27,538 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:27,539 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 29 treesize of output 69 [2018-11-18 10:58:27,539 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 10:58:27,564 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:58:27,568 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:27,571 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:27,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 170 [2018-11-18 10:58:27,576 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:27,577 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:58:27,577 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 0 case distinctions, treesize of input 39 treesize of output 46 [2018-11-18 10:58:27,577 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 10:58:27,619 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:58:27,623 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:27,626 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:27,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 168 [2018-11-18 10:58:27,632 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:27,632 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:58:27,633 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 0 case distinctions, treesize of input 39 treesize of output 46 [2018-11-18 10:58:27,633 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 10:58:27,655 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:58:27,661 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:27,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 143 [2018-11-18 10:58:27,671 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:27,672 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:27,673 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:27,674 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:27,674 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 29 treesize of output 82 [2018-11-18 10:58:27,675 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-18 10:58:27,702 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:58:27,707 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:27,710 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:27,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 159 [2018-11-18 10:58:27,715 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:27,716 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:58:27,716 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 0 case distinctions, treesize of input 39 treesize of output 46 [2018-11-18 10:58:27,716 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-18 10:58:27,738 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:58:27,745 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:27,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 169 [2018-11-18 10:58:27,756 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:27,758 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:27,760 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:27,761 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 29 treesize of output 69 [2018-11-18 10:58:27,761 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-18 10:58:27,793 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:58:27,797 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:27,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 168 [2018-11-18 10:58:27,807 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:27,808 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:27,810 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:27,811 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 29 treesize of output 69 [2018-11-18 10:58:27,811 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-18 10:58:27,838 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:58:27,843 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:27,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 166 [2018-11-18 10:58:27,853 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:27,854 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:27,856 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:27,856 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 29 treesize of output 69 [2018-11-18 10:58:27,856 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-18 10:58:27,882 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:58:27,887 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:27,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 156 [2018-11-18 10:58:27,896 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:27,896 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:27,897 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:27,898 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:27,898 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 29 treesize of output 82 [2018-11-18 10:58:27,899 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-18 10:58:27,928 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:58:27,932 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:27,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 170 [2018-11-18 10:58:27,941 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:27,942 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:27,945 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:27,945 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 29 treesize of output 69 [2018-11-18 10:58:27,946 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-18 10:58:27,972 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:58:27,977 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:27,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 150 [2018-11-18 10:58:27,987 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:27,988 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:27,989 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:27,990 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:27,990 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 29 treesize of output 82 [2018-11-18 10:58:27,990 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-18 10:58:28,018 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:58:28,022 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:28,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 159 [2018-11-18 10:58:28,032 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:28,033 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:28,035 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:28,035 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 29 treesize of output 69 [2018-11-18 10:58:28,035 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-18 10:58:28,059 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:58:28,064 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:28,068 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:28,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 173 [2018-11-18 10:58:28,074 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:28,074 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:58:28,075 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 0 case distinctions, treesize of input 39 treesize of output 46 [2018-11-18 10:58:28,075 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-18 10:58:28,103 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:58:28,108 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:28,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 156 [2018-11-18 10:58:28,118 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:28,119 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:28,120 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:28,120 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:28,121 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 29 treesize of output 82 [2018-11-18 10:58:28,121 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-11-18 10:58:28,151 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:58:28,157 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:28,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 159 [2018-11-18 10:58:28,167 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:28,168 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:28,169 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:28,170 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:28,171 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 29 treesize of output 82 [2018-11-18 10:58:28,171 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-11-18 10:58:28,206 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:58:28,210 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:28,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 152 [2018-11-18 10:58:28,222 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:28,223 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:28,224 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:28,225 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:28,225 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 29 treesize of output 82 [2018-11-18 10:58:28,225 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-11-18 10:58:28,250 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:58:28,254 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:28,258 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:28,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 170 [2018-11-18 10:58:28,266 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:28,266 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:58:28,267 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 0 case distinctions, treesize of input 39 treesize of output 46 [2018-11-18 10:58:28,267 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-11-18 10:58:28,300 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:58:28,305 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:28,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 170 [2018-11-18 10:58:28,316 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:28,317 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:28,320 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:28,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 69 [2018-11-18 10:58:28,320 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-11-18 10:58:28,347 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:58:28,352 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:28,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 152 [2018-11-18 10:58:28,364 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:28,365 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:28,366 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:28,367 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:28,368 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 29 treesize of output 82 [2018-11-18 10:58:28,368 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-11-18 10:58:28,398 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:58:28,401 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:28,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 147 [2018-11-18 10:58:28,411 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:28,412 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:28,414 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:28,414 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:28,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 82 [2018-11-18 10:58:28,415 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-11-18 10:58:28,440 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:58:28,450 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 120 treesize of output 125 [2018-11-18 10:58:28,453 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:28,454 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:28,455 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:28,456 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:28,457 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 29 treesize of output 82 [2018-11-18 10:58:28,457 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-11-18 10:58:28,479 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:58:28,483 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:28,486 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:28,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 164 [2018-11-18 10:58:28,492 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:28,492 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:58:28,493 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 0 case distinctions, treesize of input 39 treesize of output 46 [2018-11-18 10:58:28,493 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-11-18 10:58:28,516 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:58:29,073 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 18 dim-0 vars, and 23 xjuncts. [2018-11-18 10:58:30,615 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:30,619 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:30,621 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:30,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 144 [2018-11-18 10:58:30,642 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:30,644 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:58:30,657 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:30,658 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:30,659 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:30,660 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:30,661 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:30,662 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:30,694 INFO L477 Elim1Store]: Elim1 applied some 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 5 new quantified variables, introduced 14 case distinctions, treesize of input 58 treesize of output 161 [2018-11-18 10:58:30,694 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-11-18 10:58:30,726 INFO L267 ElimStorePlain]: Start of recursive call 51: 32 dim-0 vars, End of recursive call: 32 dim-0 vars, and 39 xjuncts. [2018-11-18 10:58:31,293 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,296 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:58:31,297 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 142 [2018-11-18 10:58:31,302 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,303 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:58:31,303 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 53 [2018-11-18 10:58:31,304 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-11-18 10:58:31,325 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:58:31,328 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,331 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,332 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 148 [2018-11-18 10:58:31,337 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:58:31,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2018-11-18 10:58:31,338 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-11-18 10:58:31,358 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:58:31,361 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,364 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,365 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 150 [2018-11-18 10:58:31,371 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:58:31,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 44 [2018-11-18 10:58:31,371 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-11-18 10:58:31,393 INFO L267 ElimStorePlain]: Start of recursive call 56: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:58:31,396 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,399 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 133 [2018-11-18 10:58:31,405 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,406 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,406 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,407 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,408 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 10:58:31,408 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-11-18 10:58:31,431 INFO L267 ElimStorePlain]: Start of recursive call 58: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:58:31,434 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,436 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:58:31,437 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 151 [2018-11-18 10:58:31,443 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,444 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,444 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:58:31,445 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 61 [2018-11-18 10:58:31,445 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-11-18 10:58:31,469 INFO L267 ElimStorePlain]: Start of recursive call 60: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:58:31,472 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,475 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,476 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 148 [2018-11-18 10:58:31,481 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:58:31,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2018-11-18 10:58:31,482 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-11-18 10:58:31,502 INFO L267 ElimStorePlain]: Start of recursive call 62: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:58:31,504 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,508 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 140 [2018-11-18 10:58:31,513 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,514 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,515 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,515 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,516 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 10:58:31,516 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2018-11-18 10:58:31,540 INFO L267 ElimStorePlain]: Start of recursive call 64: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:58:31,543 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,545 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:58:31,546 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 149 [2018-11-18 10:58:31,552 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,553 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,553 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:58:31,554 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 61 [2018-11-18 10:58:31,554 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-11-18 10:58:31,578 INFO L267 ElimStorePlain]: Start of recursive call 66: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:58:31,581 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,584 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 144 [2018-11-18 10:58:31,590 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,590 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,591 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,592 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,592 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 10:58:31,592 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-11-18 10:58:31,617 INFO L267 ElimStorePlain]: Start of recursive call 68: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:58:31,619 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,623 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,624 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 141 [2018-11-18 10:58:31,630 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:58:31,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2018-11-18 10:58:31,633 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2018-11-18 10:58:31,652 INFO L267 ElimStorePlain]: Start of recursive call 70: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:58:31,655 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,658 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 142 [2018-11-18 10:58:31,664 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,665 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,665 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,666 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,666 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 10:58:31,667 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2018-11-18 10:58:31,692 INFO L267 ElimStorePlain]: Start of recursive call 72: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:58:31,694 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,697 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:58:31,697 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 153 [2018-11-18 10:58:31,703 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,704 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:58:31,704 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 53 [2018-11-18 10:58:31,705 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2018-11-18 10:58:31,727 INFO L267 ElimStorePlain]: Start of recursive call 74: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:58:31,730 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,732 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:58:31,733 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 152 [2018-11-18 10:58:31,739 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,740 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:58:31,740 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 53 [2018-11-18 10:58:31,741 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2018-11-18 10:58:31,766 INFO L267 ElimStorePlain]: Start of recursive call 76: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:58:31,769 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,772 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 143 [2018-11-18 10:58:31,778 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,779 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,780 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,781 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,781 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 10:58:31,781 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2018-11-18 10:58:31,809 INFO L267 ElimStorePlain]: Start of recursive call 78: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:58:31,812 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,817 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 125 [2018-11-18 10:58:31,824 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,825 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,826 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,827 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,827 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 10:58:31,827 INFO L267 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2018-11-18 10:58:31,849 INFO L267 ElimStorePlain]: Start of recursive call 80: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:58:31,852 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,855 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,856 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:58:31,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 151 [2018-11-18 10:58:31,862 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 10:58:31,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 44 [2018-11-18 10:58:31,862 INFO L267 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2018-11-18 10:58:31,886 INFO L267 ElimStorePlain]: Start of recursive call 82: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:58:32,208 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 12 dim-0 vars, and 16 xjuncts. [2018-11-18 10:58:33,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: 163 dim-0 vars, and 39 xjuncts. [2018-11-18 10:58:33,854 INFO L202 ElimStorePlain]: Needed 83 recursive calls to eliminate 9 variables, input treesize:307, output treesize:5625 [2018-11-18 10:59:12,025 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000) stderr output: (error "out of memory") [2018-11-18 10:59:12,026 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:626) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:122) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:371) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:650) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:187) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:151) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:354) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkFeasibilityAndComputeInterpolants(LassoCheck.java:929) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkConcatFeasibility(LassoCheck.java:899) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:832) 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) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 45 more [2018-11-18 10:59:12,028 INFO L168 Benchmark]: Toolchain (without parser) took 614661.25 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 304.6 MB). Free memory was 958.5 MB in the beginning and 1.1 GB in the end (delta: -166.3 MB). Peak memory consumption was 541.1 MB. Max. memory is 11.5 GB. [2018-11-18 10:59:12,028 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 982.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 10:59:12,028 INFO L168 Benchmark]: CACSL2BoogieTranslator took 407.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.2 MB). Free memory was 958.5 MB in the beginning and 1.2 GB in the end (delta: -195.2 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. [2018-11-18 10:59:12,028 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2018-11-18 10:59:12,029 INFO L168 Benchmark]: Boogie Preprocessor took 23.90 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 10:59:12,029 INFO L168 Benchmark]: RCFGBuilder took 255.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. [2018-11-18 10:59:12,029 INFO L168 Benchmark]: BuchiAutomizer took 613936.68 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 138.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 205.5 kB). Peak memory consumption was 541.3 MB. Max. memory is 11.5 GB. [2018-11-18 10:59:12,030 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 982.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 407.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.2 MB). Free memory was 958.5 MB in the beginning and 1.2 GB in the end (delta: -195.2 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.90 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 255.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 613936.68 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 138.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 205.5 kB). Peak memory consumption was 541.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...